The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract)
Summary: Introduces the alternating fixpoint: a monotonic two-pass (underestimate→overestimate→underestimate) transformation for logic programs with negation whose fixpoint equals the well-founded partial model. Provides translations showing alternating-fixpoint programs capture least-fixpoint semantics of fixpoint logic and are expressively equivalent on finite structures. (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)
BibTeX Citation
@inproceedings{gelder_pods89,
address = {New York, NY, USA},
series = {{PODS} '89},
title = {{The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract)}},
url = {https://dl.acm.org/doi/10.1145/73721.73722},
doi = {10.1145/73721.73722},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Van Gelder, Allen},
year = {1989}
}
Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
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 |
|---|---|---|---|---|
| 702 | PROCEDURAL AND DECLARATIVE DATABASE UPDATE LANGUAGES (Extended Abstract) | 1988 | PODS | 0.00014855299 |
| 1,419 | Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model | 1989 | PODS | 0.00010830412 |
| 1,522 | Unfounded Sets and Well-Founded Semantics for General Logic Programs | 1988 | PODS | 0.00010502706 |
| 2,028 | A Procedural Semantics for Well Founded Negation in Logic Programs | 1989 | PODS | 9.285972e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,560 | Minimum and Maximum Predicates in Logic Programming | 1991 | PODS |
| 2 | 1,522 | Unfounded Sets and Well-Founded Semantics for General Logic Programs | 1988 | PODS |
| 3 | 13,166 | Fixed-point semantics and the representation of algorithms on large data | 1988 | VLDB |
| 4 | 5,210 | On the Expressive Power of Logic Programming Languages with Sets | 1988 | PODS |
| 5 | 8,083 | The Valid Model Semantics for Logic Programs | 1992 | PODS |
| 6 | 1,419 | Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model | 1989 | PODS |
| 7 | 5,735 | Tie-Breaking Semantics and Structural Totality (Extended Abstract) | 1992 | PODS |
| 8 | 888 | Horn Clauses and the Fixpoint Query Hierarchy | 1982 | PODS |
| 9 | 6,620 | An alternating fixpoint tailored to magic programs | 1993 | PODS |
| 10 | 4,831 | Stable Models and Non-Determinism in Logic Programs with Negation | 1990 | PODS |