Forgetting auxiliary atoms in forks

DOI10.1016/J.ARTINT.2019.07.005MaRDI QIDQ2321342zbMATH OpenOpenAlexWikidataFDO

Authors 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

answer set programmingequilibrium logicnonmonotonic reasoningdenotational semanticsforgettingstrong equivalence

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• A polynomial reduction of forks into logic programs
• Preserving strong equivalence while forgetting
• On the limits of forgetting in answer set programming
• You can't always forget what you want: on the limits of forgetting in answer set programming
• Knowledge Forgetting in Answer Set Programming

Cites work

• A bird's-eye view of forgetting in answer-set programming
• A denotational semantics for equilibrium logic
• A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there
• CP-logic: A language of causal probabilistic events and its relation to logic programming
• Characterising equilibrium logic and nested logic programs: Reductions and complexity,
• Conflict-driven answer set solving: from theory to practice
• Design and implementation of aggregate functions in the DLV system
• Equilibrium logic
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic Programming and Nonmonotonic Reasoning
• Minimal Logic Programs
• On equivalence of infinitary formulas under the stable model semantics
• Preserving strong equivalence while forgetting
• Propositional semantics for disjunctive logic programs
• Propositional theories are strongly equivalent to logic programs
• Semantical characterizations and complexity of equivalences in answer set programming
• Strongly equivalent logic programs
• You can't always forget what you want: on the limits of forgetting in answer set programming

Cited in

(10)

• A polynomial reduction of forks into logic programs
• Autoepistemic answer set programming
• On syntactic forgetting under uniform equivalence
• Syntactic ASP forgetting with forks
• Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
• Modular answer set programming as a formal specification language
• Answer set programming made easy
• On the limits of forgetting in answer set programming
• Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
• Syntactic ASP forgetting with forks

Describes a project that uses

Uses Software

• CP-logic

This page was built for publication: Forgetting auxiliary atoms in forks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321342)