A three-valued semantics for deductive databases and logic programs
From MaRDI portal
Publication:1337468
DOI10.1016/S0022-0000(05)80053-4zbMATH Open0821.68080OpenAlexW2024943265MaRDI QIDQ1337468FDOQ1337468
Publication date: 6 November 1994
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(05)80053-4
Cites Work
- The Semantics of Predicate Logic as a Programming Language
- An algorithm to compute circumscription
- A kripke-kleene semantics for logic programs*
- On the declarative and procedural semantics of logic programs
- Negation in logic programming
- Nonmonotonic logic and temporal projection
- A procedural semantics for well-founded negation in logic programs
- The anomalous extension problem in default reasoning
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (23)
- Semi-equilibrium models for paracoherent answer set programs
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- Characterizing D-WFS: Confluence and iterated GCWA
- Abduction in argumentation frameworks
- Oscillating Behavior of Logic Programs
- Expressive power and complexity of partial models for disjunctive deductive databases
- On the extension of logic programming with negation through uniform proofs
- Answering the โwhyโ in answer set programming โ A survey of explanation approaches
- Realizability of three-valued semantics for abstract dialectical frameworks
- Paracoherent answer set computation
- Characterising and Explaining Inconsistency in Logic Programs
- On logics and semantics for general logic programs
- Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
- Modular Paracoherent Answer Sets
- Solving logic program conflict through strong and weak forgettings
- Three-valued semantics for hybrid MKNF knowledge bases revisited
- Logic programming and knowledge representation---The A-Prolog perspective
- Annotated defeasible logic
- Better Paracoherent Answer Sets with Less Resources
- Paracoherent Answer Set Semantics meets Argumentation Frameworks
- Title not available (Why is that?)
- Complexity of super-coherence problems in ASP
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting
Recommendations
- Three-valued nonmonotonic formalisms and semantics of logic programs ๐ ๐
- Intuitionistic three-valued logic and logic programming ๐ ๐
- Logic Programs under Three-Valued ลukasiewicz Semantics ๐ ๐
- A three-valued semantics for logic programmers ๐ ๐
- The intricacies of three-valued extensional semantics for higher-order logic programs ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
This page was built for publication: A three-valued semantics for deductive databases and logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337468)