Preserving strong equivalence while forgetting

DOI10.1007/978-3-319-11558-0_29MaRDI QIDQ2938510zbMATH OpenOpenAlexFDO

Authors Matthias Knorr, José Júlio Alferes

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)

Recommendations

• Forgetting under the well-founded semantics
• On the limits of forgetting in answer set programming
• Knowledge Forgetting in Answer Set Programming
• You can't always forget what you want: on the limits of forgetting in answer set programming
• Solving logic program conflict through strong and weak forgettings

Cites work

• Forgetting for defeasible logic
• Forgetting for knowledge bases in DL-lite
• Forgetting under the well-founded semantics
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• Knowledge forgetting: properties and applications
• Logic-based ontology comparison and module extraction, with an application to DL-Lite
• Logics in Artificial Intelligence
• Nested expressions in logic programs
• Semantic forgetting in answer set programming
• Semantical characterizations and complexity of equivalences in answer set programming
• Semantics of (disjunctive) logic programs based on partial evaluation
• Solving logic program conflict through strong and weak forgettings
• Strongly equivalent logic programs
• The well-founded semantics for general logic programs

Cited in

(16)

• On syntactic forgetting under uniform equivalence
• A polynomial reduction of forks into logic programs
• On the limits of forgetting in answer set programming
• Forgetting auxiliary atoms in forks
• Solving logic program conflict through strong and weak forgettings
• Syntactic ASP forgetting with forks
• Forgetting in ASP: the forgotten properties
• Forgetting under the well-founded semantics
• When you must forget: Beyond strong persistence when forgetting in answer set programming
• Formal proof for the constant trace forgetting factor
• A syntactic operator for forgetting that satisfies strong persistence
• Forgetting Literals with Varying Propositional Symbols
• Syntactic ASP forgetting with forks
• Common equivalence and size of forgetting from Horn formulae
• Forgetting in abstract argumentation: limits and possibilities
• Forgetting in answer set programming -- a survey

This page was built for publication: Preserving strong equivalence while forgetting

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