On the limits of forgetting in answer set programming

DOI10.1016/J.ARTINT.2020.103307zbMath1493.68350OpenAlexW3034914877MaRDI QIDQ2211850

João Leite, Ricardo Gonçalves, Matthias Knorr, Stefan Woltran

Publication date: 16 November 2020

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2020.103307

zbMATH Keywords

computational complexityforgettinganswer set programmingstrong equivalencerelativized equivalence

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Related Items (4)

Knowledge forgetting in propositional \(\mu\)-calculus ⋮ Computing sufficient and necessary conditions in CTL: a forgetting approach ⋮ Common equivalence and size of forgetting from Horn formulae ⋮ On syntactic forgetting under uniform equivalence

Uses Software

• Potassco

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forgetting for knowledge bases in DL-lite
• Logic-based ontology comparison and module extraction, with an application to DL-Lite
• Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
• Lazy narrowing: strong completeness and eager variable elimination
• Reasoning under inconsistency: a forgetting-based approach
• Knowledge forgetting: properties and applications
• How to progress a database
• On the computational cost of disjunctive logic programming: Propositional case
• Nested expressions in logic programs
• Forgetting auxiliary atoms in forks
• Model-theoretic inseparability and modularity of description logic ontologies
• Semantic forgetting in answer set programming
• Solving logic program conflict through strong and weak forgettings
• Forgetting under the Well-Founded Semantics
• The Logical Difference for the Lightweight Description Logic EL
• A Unifying Perspective on Knowledge Updates
• The rise and fall of semantic rule updates based onSE-models
• Preserving Strong Equivalence while Forgetting
• A Model-Theoretic Approach to Belief Change in Answer Set Programming
• Modularity Aspects of Disjunctive Stable Models
• Stable inference as intuitionistic validity
• The well-founded semantics for general logic programs
• Dynamic updates of non-monotonic knowledge bases
• You Can't Always Forget What You Want: On the Limits of Forgetting in Answer Set Programming
• When you must forget: Beyond strong persistence when forgetting in answer set programming
• A Knowledge Level Account of Forgetting
• Semantics of (disjunctive) logic programs based on partial evaluation
• An abductive framework for computing knowledge base updates
• A Syntactic Operator for Forgetting that Satisfies Strong Persistence
• The DLV system for knowledge representation and reasoning
• Semantical characterizations and complexity of equivalences in answer set programming
• Knowledge Forgetting in Answer Set Programming
• Logic Programming and Nonmonotonic Reasoning
• Propositional theories are strongly equivalent to logic programs
• Forgetting Literals with Varying Propositional Symbols
• Strongly equivalent logic programs

This page was built for publication: On the limits of forgetting in answer set programming