Unfounded Sets and Well-Founded Semantics for General Logic Programs
Summary: Introduce unfounded sets and the well‑founded partial model as a canonical semantics for general logic programs with negation; 'well‑behaved' programs have a total well‑founded model. Prove this strictly generalizes stratified/local stratified programs and that a well‑founded model yields a unique (coinciding) stable model, though the converse may fail. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Allen Van Gelder (University of California Santa Cruz)
- 2. Kenneth Ross (Stanford University)
- 3. John S. Schlipf (University of Cincinnati)
BibTeX Citation
@inproceedings{gelder_pods88,
address = {New York, NY, USA},
series = {{PODS} '88},
title = {{Unfounded Sets and Well-Founded Semantics for General Logic Programs}},
url = {https://dl.acm.org/doi/10.1145/308386.308444},
doi = {10.1145/308386.308444},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Van Gelder, Allen and Ross, Kenneth and Schlipf, John S.},
year = {1988}
}
Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,297 | The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract) | 1989 | PODS |
| 2 | 6,221 | Well-Founded Semantics for Extended Datalog and Ontological Reasoning | 2013 | PODS |
| 3 | 8,621 | Three-Valued Formalization of Logic Programming: Is It Needed? | 1990 | PODS |
| 4 | 2,474 | Logic Programming as Constructivism: A Formalization and its Application to Databases | 1989 | PODS |
| 5 | 2,028 | A Procedural Semantics for Well Founded Negation in Logic Programs | 1989 | PODS |
| 6 | 5,111 | The Well-Founded Semantics of Aggregation (Extended Abstract) | 1992 | PODS |
| 7 | 4,831 | Stable Models and Non-Determinism in Logic Programs with Negation | 1990 | PODS |
| 8 | 1,419 | Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model | 1989 | PODS |
| 9 | 8,083 | The Valid Model Semantics for Logic Programs | 1992 | PODS |
| 10 | 8,295 | The Expressive Powers of the Logic Programming Semantics | 1990 | PODS |