Preserving Strong Equivalence while Forgetting

DOI10.1007/978-3-319-11558-0_29zbMath1432.68059OpenAlexW2167167097MaRDI QIDQ2938510

José Júlio Alferes, Matthias Knorr

Publication date: 14 January 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-11558-0_29

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

When you must forget: Beyond strong persistence when forgetting in answer set programming ⋮ A Syntactic Operator for Forgetting that Satisfies Strong Persistence ⋮ Syntactic ASP forgetting with forks ⋮ On the limits of forgetting in answer set programming ⋮ Syntactic ASP forgetting with forks ⋮ On syntactic forgetting under uniform equivalence ⋮ Forgetting in ASP: The Forgotten Properties ⋮ Forgetting auxiliary atoms in forks

Cites Work

• Unnamed Item
• Forgetting for knowledge bases in DL-lite
• Logic-based ontology comparison and module extraction, with an application to DL-Lite
• Knowledge forgetting: properties and applications
• Nested expressions in logic programs
• Semantic forgetting in answer set programming
• Solving logic program conflict through strong and weak forgettings
• Forgetting under the Well-Founded Semantics
• Forgetting for Defeasible Logic
• The well-founded semantics for general logic programs
• Semantics of (disjunctive) logic programs based on partial evaluation
• Semantical characterizations and complexity of equivalences in answer set programming
• Logics in Artificial Intelligence
• Strongly equivalent logic programs