Tie-breaking semantics and structural totality
From MaRDI portal
Publication:676419
DOI10.1006/JCSS.1997.1451zbMATH Open0864.68028OpenAlexW2085193523MaRDI QIDQ676419FDOQ676419
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- The well-founded semantics for general logic programs
- Datalog extensions for database queries and updates
- Title not available (Why is that?)
- Title not available (Why is that?)
- Negation in rule-based database languages: A survey
- Contributions to the Theory of Logic Programming
- Horn clause queries and generalizations
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- Undecidable optimization problems for database logic programs
- Why not negation by fixpoint?
- On the relations between stable and well-founded semantics of logic programs
- The expressive powers of the logic programming semantics
- Title not available (Why is that?)
- Negation by default and unstratifiable logic programs
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)
