Tie-breaking semantics and structural totality

DOI10.1006/jcss.1997.1451zbMath0864.68028OpenAlexW2085193523MaRDI QIDQ676419

Christos H. Papadimitriou, Mihalis Yannakakis

Publication date: 18 March 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1997.1451

zbMATH Keywords

Datalog program

Mathematics Subject Classification ID

Database theory (68P15) Theory of programming languages (68N15)

Related Items

Polynomial-time computable stable models, A nondeterministic well-founded semantics, Complexity and undecidability results for logic programming, Graph theoretical structures in logic programs and default theories, Complexity of super-coherence problems in ASP, Functional queries in datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Negation in rule-based database languages: A survey
• Negation by default and unstratifiable logic programs
• Datalog extensions for database queries and updates
• Why not negation by fixpoint?
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs
• On the relations between stable and well-founded semantics of logic programs
• The expressive powers of the logic programming semantics
• Undecidable optimization problems for database logic programs
• Horn clause queries and generalizations
• Contributions to the Theory of Logic Programming
• The well-founded semantics for general logic programs