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.00013272698
Overall Rank
1,208 | 91.61%
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
839 Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model 1989 PODS 0.00015989602
3,215 Design and Implementation of the Glue-Nail Database System 1993 SIGMOD 7.370155e-05
3,452 Minimum and Maximum Predicates in Logic Programming 1991 PODS 7.0792604e-05
3,559 A Unified Framework for Enforcing Multiple Access Control Policies 1997 SIGMOD 6.9706969e-05
4,754 Stable Models and Non-Determinism in Logic Programs with Negation 1990 PODS 5.9377721e-05
5,716 Datalog Unchained 2021 PODS 5.3569788e-05
6,254 Queries are easier than you thought (probably) 1992 PODS 5.1318451e-05
6,513 An alternating fixpoint tailored to magic programs 1993 PODS 5.0273291e-05
7,671 The Valid Model Semantics for Logic Programs 1992 PODS 4.6781479e-05
7,980 The Expressive Powers of the Logic Programming Semantics 1990 PODS 4.6089395e-05
8,391 Three-Valued Formalization of Logic Programming: Is It Needed? 1990 PODS 4.523998e-05
12,626 Soft Stratification for Magic Set Based Query Evaluation in Deductive Databases 2003 PODS 4.1905499e-05
12,899 Implementing Deductive Databases by Linear Programming 1992 PODS 4.1905499e-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
375 PROCEDURAL AND DECLARATIVE DATABASE UPDATE LANGUAGES (Extended Abstract) 1988 PODS 0.00025262028
839 Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model 1989 PODS 0.00015989602
1,166 Unfounded Sets and Well-Founded Semantics for General Logic Programs 1988 PODS 0.00013542063
1,624 A Procedural Semantics for Well Founded Negation in Logic Programs 1989 PODS 0.00011095143
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
3,452 Minimum and Maximum Predicates in Logic Programming 1991 PODS 7.0792604e-05
1,166 Unfounded Sets and Well-Founded Semantics for General Logic Programs 1988 PODS 0.00013542063
12,979 Fixed-point semantics and the representation of algorithms on large data 1988 VLDB 4.1905499e-05
5,102 On the Expressive Power of Logic Programming Languages with Sets 1988 PODS 5.6936517e-05
7,671 The Valid Model Semantics for Logic Programs 1992 PODS 4.6781479e-05
839 Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model 1989 PODS 0.00015989602
5,058 Tie-Breaking Semantics and Structural Totality (Extended Abstract) 1992 PODS 5.7212391e-05
490 Horn Clauses and the Fixpoint Query Hierarchy 1982 PODS 0.00021979489
6,513 An alternating fixpoint tailored to magic programs 1993 PODS 5.0273291e-05
4,754 Stable Models and Non-Determinism in Logic Programs with Negation 1990 PODS 5.9377721e-05