Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model

Summary: Shows the well‑founded model is an iterated least fixed point of a natural operator and the minimal three‑valued model, introducing dynamic stratification with an atom‑preference. Extends SLS‑resolution to all programs (sound/complete for non‑floundering queries) and links to other non‑monotonic formalisms. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 846
Venue: PODS
Year: 1989
Pagerank: 0.00010830412
Overall Rank: 1,419 | 90.27%
DOI: 10.1145/73721.73723

Incoming Non-self Citations Over Time

Authors

1. Teodor C. Przymusinski (University of Texas at El Paso)

BibTeX Citation

@inproceedings{przymusinski_pods89,
        address = {New York, NY, USA},
        series = {{PODS} '89},
        title = {{Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model}},
        url = {https://dl.acm.org/doi/10.1145/73721.73723},
        doi = {10.1145/73721.73723},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Przymusinski, Teodor C.},
        year = {1989}
}

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,297	The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract)	1989	PODS	0.0001126031
2,028	A Procedural Semantics for Well Founded Negation in Logic Programs	1989	PODS	9.285972e-05
2,474	Logic Programming as Constructivism: A Formalization and its Application to Databases	1989	PODS	8.5305658e-05
4,831	Stable Models and Non-Determinism in Logic Programs with Negation	1990	PODS	6.4877275e-05
4,943	Datalog Unchained	2021	PODS	6.4332239e-05
8,295	The Expressive Powers of the Logic Programming Semantics	1990	PODS	5.4574671e-05
8,621	Three-Valued Formalization of Logic Programming: Is It Needed?	1990	PODS	5.3986999e-05
12,991	Structural Totality and Constraint Stratification	1995	PODS	5.093636e-05
13,049	Query Evaluation under the Well Founded Semantics (Extended Abstract)	1993	PODS	5.093636e-05

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
1,297	The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract)	1989	PODS	0.0001126031
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
2,474	Logic Programming as Constructivism: A Formalization and its Application to Databases	1989	PODS	8.5305658e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	13,117	Backward chaining evaluation in stratified disjunctive theories	1990	PODS
2	8,295	The Expressive Powers of the Logic Programming Semantics	1990	PODS
3	1,297	The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract)	1989	PODS
4	4,831	Stable Models and Non-Determinism in Logic Programs with Negation	1990	PODS
5	8,621	Three-Valued Formalization of Logic Programming: Is It Needed?	1990	PODS
6	12,991	Structural Totality and Constraint Stratification	1995	PODS
7	1,714	Modular Stratification and Magic Sets for DATALOG Programs with Negation	1990	PODS
8	8,083	The Valid Model Semantics for Logic Programs	1992	PODS
9	2,474	Logic Programming as Constructivism: A Formalization and its Application to Databases	1989	PODS
10	1,522	Unfounded Sets and Well-Founded Semantics for General Logic Programs	1988	PODS