Database Paper Browser

Back to papers

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)

Paper ID
846
Venue
PODS
Year
1989
Pagerank
0.00013285448
Overall Rank
1,205 | 91.62%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 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
3,209 Design and Implementation of the Glue-Nail Database System 1993 SIGMOD 7.3763539e-05
3,446 Minimum and Maximum Predicates in Logic Programming 1991 PODS 7.0861064e-05
3,557 A Unified Framework for Enforcing Multiple Access Control Policies 1997 SIGMOD 6.9767329e-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
6,255 Queries are easier than you thought (probably) 1992 PODS 5.1367617e-05
6,517 An alternating fixpoint tailored to magic programs 1993 PODS 5.0321577e-05
7,672 The Valid Model Semantics for Logic Programs 1992 PODS 4.6826453e-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,617 Soft Stratification for Magic Set Based Query Evaluation in Deductive Databases 2003 PODS 4.1945683e-05
12,889 Implementing Deductive Databases by Linear Programming 1992 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
374 PROCEDURAL AND DECLARATIVE DATABASE UPDATE LANGUAGES (Extended Abstract) 1988 PODS 0.00025286717
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
1,622 A Procedural Semantics for Well Founded Negation in Logic Programs 1989 PODS 0.00011106192
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
3,446 Minimum and Maximum Predicates in Logic Programming 1991 PODS 7.0861064e-05
1,166 Unfounded Sets and Well-Founded Semantics for General Logic Programs 1988 PODS 0.00013554968
12,969 Fixed-point semantics and the representation of algorithms on large data 1988 VLDB 4.1945683e-05
5,102 On the Expressive Power of Logic Programming Languages with Sets 1988 PODS 5.6992154e-05
7,672 The Valid Model Semantics for Logic Programs 1992 PODS 4.6826453e-05
843 Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model 1989 PODS 0.00016005595
5,063 Tie-Breaking Semantics and Structural Totality (Extended Abstract) 1992 PODS 5.7267485e-05
490 Horn Clauses and the Fixpoint Query Hierarchy 1982 PODS 0.00022016773
6,517 An alternating fixpoint tailored to magic programs 1993 PODS 5.0321577e-05
4,757 Stable Models and Non-Determinism in Logic Programs with Negation 1990 PODS 5.9434944e-05