Tie-Breaking Semantics and Structural Totality (Extended Abstract)

Summary: Introduce tie-breaking semantics for Datalog with negation: a polynomial-time computable fixpoint semantics that guarantees a fixpoint whenever the rule–goal graph has no cycle with an odd number of negative edges. Show maximality: presence of an odd-negative cycle implies non-structural totality (an alphabetic variant lacking any fixpoint) and nonstructural totality is undecidable. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: ha7310f6688cc9360
Venue: PODS
Year: 1992
Pagerank: 5.968205e-05
Overall Rank: 5,861 | 60.60%
DOI: 10.1145/137097.137103

Incoming Non-self Citations Over Time

Authors

1. Christos H. Papadimitriou (University of California San Diego)
2. Mihalis Yannakakis (AT&T)

BibTeX Citation

@inproceedings{papadimitriou_pods92,
        address = {New York, NY, USA},
        series = {{PODS} '92},
        title = {{Tie-Breaking Semantics and Structural Totality (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/137097.137103},
        doi = {10.1145/137097.137103},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Papadimitriou, Christos H. and Yannakakis, Mihalis},
        year = {1992}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
6,087	Negation and Minimality in Non-Horn Databases	1993	PODS	5.8910601e-05
13,281	Structural Totality and Constraint Stratification	1995	PODS	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
317	OPTIMIZING DATALOG PROGRAMS (Extended Abstract)	1987	PODS	0.00021220438

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,541	Data Functions, Datalog and Negation (Extended Abstract)	1988	SIGMOD
2	7,682	Database Updates in Logic Programming	1988	PODS
3	6,429	Evaluating Datalog over Semirings: A Grounding-based Approach	2024	PODS
4	7,696	Hard problems for simple logic programs	1990	SIGMOD
5	13,317	Adding Disjunction to Datalog (Extended Abstract)	1994	PODS
6	8,136	On the First-Order Expressibility of Recursive Queries	1989	PODS
7	6,350	Well-Founded Semantics for Extended Datalog and Ontological Reasoning	2013	PODS
8	4,949	Stable Models and Non-Determinism in Logic Programs with Negation	1990	PODS
9	1,012	Why Not Negation By Fixpoint?	1988	PODS
10	1,325	The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract)	1989	PODS