Forgetting auxiliary atoms in forks

DOI10.1016/j.artint.2019.07.005zbMath1478.68338MaRDI QIDQ2321342

Yanyan Li

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

zbMATH Keywords

denotational semantics; nonmonotonic reasoning; forgetting; answer set programming; equilibrium logic; strong equivalence

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

68T30: Knowledge representation

68N17: Logic programming

Related Items

Modular Answer Set Programming as a Formal Specification Language, Syntactic ASP forgetting with forks, Answer set programming made easy, Autoepistemic answer set programming, On syntactic forgetting under uniform equivalence, 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, On the limits of forgetting in answer set programming, Syntactic ASP forgetting with forks

Uses Software

• CP-logic

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