Semi-equilibrium models for paracoherent answer set programs
From MaRDI portal
Publication:253992
DOI10.1016/j.artint.2016.01.011zbMath1351.68259OpenAlexW2301736536MaRDI QIDQ253992
Giovanni Amendola, João Moura, Michael Fink, Nicola Leone, Thomas Eiter
Publication date: 8 March 2016
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/36215331/AIJ2016_2.pdf
inconsistency managementanswer set programmingequilibrium logicparacoherent reasoningsplitting sequences
Related Items
Witnesses for Answer Sets of Logic Programs ⋮ Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT ⋮ ASP and subset minimality: enumeration, cautious reasoning and MUSes ⋮ Paracoherent Answer Set Semantics meets Argumentation Frameworks ⋮ Better Paracoherent Answer Sets with Less Resources ⋮ Solving problems in the polynomial hierarchy with ASP(Q) ⋮ Approximating operators and semantics for abstract dialectical frameworks ⋮ Weakening and extending \(\mathbb{Z}\) ⋮ Paracoherent answer set computation ⋮ Determining inference semantics for disjunctive logic programs ⋮ The Seventh Answer Set Programming Competition: Design and Results ⋮ Autoepistemic answer set programming ⋮ Answers set programs for non-transferable utility games: expressiveness, complexity and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The alternating fixpoint of logic programs with negation
- Equilibrium logic
- Magic Sets and their application to data integration
- Paraconsistent logic programming
- Logic programs, well-orderings, and forward chaining
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning
- A three-valued semantics for deductive databases and logic programs
- On the partial semantics for disjunctive deductive databases
- On the computational cost of disjunctive logic programming: Propositional case
- Propositional semantics for disjunctive logic programs
- Nested expressions in logic programs
- Logic programming and nonmonotonic reasoning. 8th international conference, LPNMR 2005, Diamante, Italy, September 5--8, 2005. Proceedings.
- Partial equilibrium logic
- Stepwise Debugging of Description-Logic Programs
- Modular Paracoherent Answer Sets
- Approved Models for Normal Logic Programs
- Logical Weak Completions of Paraconsistent Logics
- Modularity Aspects of Disjunctive Stable Models
- The well-founded semantics for general logic programs
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Modular Nonmonotonic Logic Programming Revisited
- Weight constraints as nested expressions
- Strong equivalence made easy: nested expressions and weight constraints
- An abductive framework for computing knowledge base updates
- Paraconsistent Stable Semantics for Extended Disjunctive Programs
- Reasoning with inconsistencies in hybrid MKNF knowledge bases
- Comparisons and computation of well-founded semantics for disjunctive logic programs
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Quantified Equilibrium Logic and Foundations for Answer Set Programs
- Depth-First Search and Linear Graph Algorithms
- Strongly equivalent logic programs