Forgetting in ASP: The Forgotten Properties

DOI10.1007/978-3-319-48758-8_37zbMath1483.68059OpenAlexW2545324938WikidataQ62046415 ScholiaQ62046415MaRDI QIDQ2835900

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

Publication date: 30 November 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-48758-8_37

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

When you must forget: Beyond strong persistence when forgetting in answer set programming

Uses Software

• Potassco
• NoHR

Cites Work

• 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
• Local closed world reasoning with description logics under the well-founded semantics
• On updates of hybrid knowledge bases composed of ontologies and rules
• Knowledge forgetting: properties and applications
• How to progress a database
• Nested expressions in logic programs
• 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
• A Unifying Perspective on Knowledge Updates
• Preserving Strong Equivalence while Forgetting
• On properties of update sequences based on causal rejection
• Dynamic updates of non-monotonic knowledge bases
• You Can't Always Forget What You Want: On the Limits of Forgetting in Answer Set Programming
• Parametrized Logic Programming
• Knowledge Forgetting in Answer Set Programming
• Propositional theories are strongly equivalent to logic programs
• Strongly equivalent logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Forgetting in ASP: The Forgotten Properties