A Procedural Semantics for Well Founded Negation in Logic Programs
Summary: Global SLS-resolution: a procedural semantics extending Przymusinski's SLS to realize Van Gelder et al.'s well-founded negation for arbitrary, nonstratified logic programs. Introduces global trees to record negative-subgoal dependencies; proves soundness w.r.t. the well-founded semantics and completeness for non-floundering queries. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 843 | Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model | 1989 | PODS | 0.00016005595 |
| 1,189 | Independence of Logic Database Queries and Updates | 1990 | PODS | 0.00013441514 |
| 1,205 | The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract) | 1989 | PODS | 0.00013285448 |
| 1,381 | Modular Stratification and Magic Sets for DATALOG Programs with Negation | 1990 | PODS | 0.00012283951 |
| 4,757 | Stable Models and Non-Determinism in Logic Programs with Negation | 1990 | PODS | 5.9434944e-05 |
| 6,517 | An alternating fixpoint tailored to magic programs | 1993 | PODS | 5.0321577e-05 |
| 7,977 | The Expressive Powers of the Logic Programming Semantics | 1990 | PODS | 4.613363e-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 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 843 | Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model | 1989 | PODS | 0.00016005595 |
| 1,166 | Unfounded Sets and Well-Founded Semantics for General Logic Programs | 1988 | PODS | 0.00013554968 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,381 | Modular Stratification and Magic Sets for DATALOG Programs with Negation | 1990 | PODS | 0.00012283951 |
| 7,977 | The Expressive Powers of the Logic Programming Semantics | 1990 | PODS | 4.613363e-05 |
| 5,063 | Tie-Breaking Semantics and Structural Totality (Extended Abstract) | 1992 | PODS | 5.7267485e-05 |
| 14,196 | On Negation in HiLog | 1991 | PODS | - |
| 11,762 | Stable Model Semantics for Tuple-Generating Dependencies Revisited | 2017 | PODS | 4.1945683e-05 |
| 4,298 | Well-Founded Semantics for Extended Datalog and Ontological Reasoning | 2013 | PODS | 6.2885419e-05 |
| 7,672 | The Valid Model Semantics for Logic Programs | 1992 | PODS | 4.6826453e-05 |
| 1,166 | Unfounded Sets and Well-Founded Semantics for General Logic Programs | 1988 | PODS | 0.00013554968 |
| 843 | Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model | 1989 | PODS | 0.00016005595 |
| 12,856 | Query Evaluation under the Well Founded Semantics (Extended Abstract) | 1993 | PODS | 4.1945683e-05 |