Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model
Summary: Shows the well‑founded model is an iterated least fixed point of a natural operator and the minimal three‑valued model, introducing dynamic stratification with an atom‑preference. Extends SLS‑resolution to all programs (sound/complete for non‑floundering queries) and links to other non‑monotonic formalisms. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,205 | The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract) | 1989 | PODS | 0.00013285448 |
| 1,622 | A Procedural Semantics for Well Founded Negation in Logic Programs | 1989 | PODS | 0.00011106192 |
| 1,979 | Logic Programming as Constructivism: A Formalization and its Application to Databases | 1989 | PODS | 9.8794371e-05 |
| 4,757 | Stable Models and Non-Determinism in Logic Programs with Negation | 1990 | PODS | 5.9434944e-05 |
| 5,705 | Datalog Unchained | 2021 | PODS | 5.3621239e-05 |
| 7,977 | The Expressive Powers of the Logic Programming Semantics | 1990 | PODS | 4.613363e-05 |
| 8,392 | Three-Valued Formalization of Logic Programming: Is It Needed? | 1990 | PODS | 4.5283415e-05 |
| 12,797 | Structural Totality and Constraint Stratification | 1995 | PODS | 4.1945683e-05 |
| 12,856 | Query Evaluation under the Well Founded Semantics (Extended Abstract) | 1993 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,166 | Unfounded Sets and Well-Founded Semantics for General Logic Programs | 1988 | PODS | 0.00013554968 |
| 1,205 | The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract) | 1989 | PODS | 0.00013285448 |
| 1,622 | A Procedural Semantics for Well Founded Negation in Logic Programs | 1989 | PODS | 0.00011106192 |
| 1,979 | Logic Programming as Constructivism: A Formalization and its Application to Databases | 1989 | PODS | 9.8794371e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,922 | Backward chaining evaluation in stratified disjunctive theories | 1990 | PODS | 4.1945683e-05 |
| 7,977 | The Expressive Powers of the Logic Programming Semantics | 1990 | PODS | 4.613363e-05 |
| 1,205 | The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract) | 1989 | PODS | 0.00013285448 |
| 4,757 | Stable Models and Non-Determinism in Logic Programs with Negation | 1990 | PODS | 5.9434944e-05 |
| 8,392 | Three-Valued Formalization of Logic Programming: Is It Needed? | 1990 | PODS | 4.5283415e-05 |
| 12,797 | Structural Totality and Constraint Stratification | 1995 | PODS | 4.1945683e-05 |
| 1,381 | Modular Stratification and Magic Sets for DATALOG Programs with Negation | 1990 | PODS | 0.00012283951 |
| 7,672 | The Valid Model Semantics for Logic Programs | 1992 | PODS | 4.6826453e-05 |
| 1,979 | Logic Programming as Constructivism: A Formalization and its Application to Databases | 1989 | PODS | 9.8794371e-05 |
| 1,166 | Unfounded Sets and Well-Founded Semantics for General Logic Programs | 1988 | PODS | 0.00013554968 |