A three-valued semantics for deductive databases and logic programs
From MaRDI portal
Recommendations
- A three-valued semantics for logic programmers
- A three-valued semantics for typed logic programming
- The intricacies of three-valued extensional semantics for higher-order logic programs
- Three-valued nonmonotonic formalisms and semantics of logic programs
- Logic Programs under Three-Valued Łukasiewicz Semantics
- Intuitionistic three-valued logic and logic programming
- scientific article; zbMATH DE number 3896341
- scientific article; zbMATH DE number 15392
- scientific article; zbMATH DE number 1163566
Cites work
- scientific article; zbMATH DE number 4199654 (Why is no real title available?)
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 4210121 (Why is no real title available?)
- scientific article; zbMATH DE number 15392 (Why is no real title available?)
- scientific article; zbMATH DE number 4185010 (Why is no real title available?)
- scientific article; zbMATH DE number 4185011 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- A kripke-kleene semantics for logic programs*
- A procedural semantics for well-founded negation in logic programs
- An algorithm to compute circumscription
- Negation in logic programming
- Nonmonotonic logic and temporal projection
- On the declarative and procedural semantics of logic programs
- The Semantics of Predicate Logic as a Programming Language
- The anomalous extension problem in default reasoning
Cited in
(25)- On logics and semantics for general logic programs
- Complexity of super-coherence problems in ASP
- Paracoherent answer set semantics meets argumentation frameworks
- Better paracoherent answer sets with less resources
- scientific article; zbMATH DE number 1761893 (Why is no real title available?)
- Modular paracoherent answer sets
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting
- Deductive databases in four-valued logic: rule semantics and models
- On the extension of logic programming with negation through uniform proofs
- Oscillating behavior of logic programs
- Realizability of three-valued semantics for abstract dialectical frameworks
- Logic programming and knowledge representation---The A-Prolog perspective
- Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
- Semi-equilibrium models for paracoherent answer set programs
- Solving logic program conflict through strong and weak forgettings
- Three-valued semantics for hybrid MKNF knowledge bases revisited
- Abduction in argumentation frameworks
- Characterising and explaining inconsistency in logic programs
- Paracoherent answer set computation
- Answering the ``why in answer set programming -- a survey of explanation approaches
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- Annotated defeasible logic
- scientific article; zbMATH DE number 4155872 (Why is no real title available?)
- Expressive power and complexity of partial models for disjunctive deductive databases
- Characterizing D-WFS: confluence and iterated GCWA
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)
