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
- 1. Kenneth A. Ross (Stanford University)
BibTeX Citation
@inproceedings{ross_pods89,
address = {New York, NY, USA},
series = {{PODS} '89},
title = {{A Procedural Semantics for Well Founded Negation in Logic Programs}},
url = {https://dl.acm.org/doi/10.1145/73721.73724},
doi = {10.1145/73721.73724},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Ross, Kenneth A.},
year = {1989}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,338 | The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract) | 1989 | PODS | 0.00010967767 |
| 1,355 | Independence of Logic Database Queries and Updates | 1990 | PODS | 0.00010910619 |
| 1,463 | Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model | 1989 | PODS | 0.00010547887 |
| 1,758 | Modular Stratification and Magic Sets for DATALOG Programs with Negation | 1990 | PODS | 9.6999549e-05 |
| 4,977 | Stable Models and Non-Determinism in Logic Programs with Negation | 1990 | PODS | 6.3182174e-05 |
| 6,774 | An alternating fixpoint tailored to magic programs | 1993 | PODS | 5.669182e-05 |
| 8,487 | The Expressive Powers of the Logic Programming Semantics | 1990 | PODS | 5.3148581e-05 |
| 13,386 | Query Evaluation under the Well Founded Semantics (Extended Abstract) | 1993 | PODS | 4.9605343e-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 |
|---|---|---|---|---|
| 1,463 | Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model | 1989 | PODS | 0.00010547887 |
| 1,557 | Unfounded Sets and Well-Founded Semantics for General Logic Programs | 1988 | PODS | 0.00010228729 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,758 | Modular Stratification and Magic Sets for DATALOG Programs with Negation | 1990 | PODS |
| 2 | 5,875 | Tie-Breaking Semantics and Structural Totality (Extended Abstract) | 1992 | PODS |
| 3 | 8,487 | The Expressive Powers of the Logic Programming Semantics | 1990 | PODS |
| 4 | 14,752 | On Negation in HiLog | 1991 | PODS |
| 5 | 12,315 | Stable Model Semantics for Tuple-Generating Dependencies Revisited | 2017 | PODS |
| 6 | 6,364 | Well-Founded Semantics for Extended Datalog and Ontological Reasoning | 2013 | PODS |
| 7 | 8,275 | The Valid Model Semantics for Logic Programs | 1992 | PODS |
| 8 | 1,557 | Unfounded Sets and Well-Founded Semantics for General Logic Programs | 1988 | PODS |
| 9 | 1,463 | Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model | 1989 | PODS |
| 10 | 13,386 | Query Evaluation under the Well Founded Semantics (Extended Abstract) | 1993 | PODS |