Tie-breaking semantics and structural totality

DOI10.1006/JCSS.1997.1451MaRDI QIDQ676419zbMATH OpenOpenAlexFDO

Authors Christos 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

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

Recommendations

• scientific article; zbMATH DE number 2152683
• Tarskian Structured Consequence Relations and Functional Completeness
• On conceptual completeness of syntactic-semantical systems
• Revisiting Semilattice Semantics
• Bi-inductive structural semantics
• A generalization of ordered-pair semantics
• Higher-order semantics and extensionality
• Completeness and correspondence in Chellas-Segerberg semantics
• scientific article; zbMATH DE number 7696694

Cites work

• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• scientific article; zbMATH DE number 4147465 (Why is no real title available?)
• scientific article; zbMATH DE number 194907 (Why is no real title available?)
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Contributions to the Theory of Logic Programming
• Datalog extensions for database queries and updates
• Horn clause queries and generalizations
• Negation by default and unstratifiable logic programs
• Negation in rule-based database languages: A survey
• On the relations between stable and well-founded semantics of logic programs
• The expressive powers of the logic programming semantics
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs
• The well-founded semantics for general logic programs
• Undecidable optimization problems for database logic programs
• Why not negation by fixpoint?

Cited in

(7)

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

This page was built for publication: Tie-breaking semantics and structural totality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676419)