Forgetting auxiliary atoms in forks
From MaRDI portal
Publication:2321342
DOI10.1016/j.artint.2019.07.005zbMath1478.68338OpenAlexW2964186776MaRDI QIDQ2321342
Publication date: 28 August 2019
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2019.07.005
denotational semanticsnonmonotonic reasoningforgettinganswer set programmingequilibrium logicstrong equivalence
Related Items
Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version, A polynomial reduction of forks into logic programs, Answer set programming made easy, Syntactic ASP forgetting with forks, On the limits of forgetting in answer set programming, Modular Answer Set Programming as a Formal Specification Language, Syntactic ASP forgetting with forks, Autoepistemic answer set programming, On syntactic forgetting under uniform equivalence
Uses Software
Cites Work
- Equilibrium logic
- Conflict-driven answer set solving: from theory to practice
- Propositional semantics for disjunctive logic programs
- A bird's-eye view of forgetting in answer-set programming
- Preserving Strong Equivalence while Forgetting
- A general framework for equivalences in Answer-Set Programming by countermodels in the logic of Here-and-There
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- CP-logic: A language of causal probabilistic events and its relation to logic programming
- Design and implementation of aggregate functions in the DLV system
- Minimal Logic Programs
- Knowledge Representation, Reasoning and Declarative Problem Solving
- You Can't Always Forget What You Want: On the Limits of Forgetting in Answer Set Programming
- On equivalence of infinitary formulas under the stable model semantics
- A denotational semantics for equilibrium logic
- Semantical characterizations and complexity of equivalences in answer set programming
- Propositional theories are strongly equivalent to logic programs
- Logic Programming and Nonmonotonic Reasoning
- Strongly equivalent logic programs