Knowledge Forgetting in Answer Set Programming

DOI10.1613/JAIR.4297MaRDI QIDQ5417593zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 22 May 2014

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.4297

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Logic programming (68N17)

Recommendations

• On the limits of forgetting in answer set programming
• Semantic forgetting in answer set programming
• A bird's-eye view of forgetting in answer-set programming
• When you must forget: Beyond strong persistence when 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 propositional \(\mu\)-calculus
• Forgetting for knowledge bases in DL-lite

Cited in

(23)

• A bird's-eye view of forgetting in answer-set programming
• One head is better than two: a polynomial restriction for propositional definite Horn forgetting
• The ghosts of forgotten things: a study on size after forgetting
• Forgetting for knowledge bases in DL-lite
• First-order modular logic programs and their conservative extensions
• When you must forget: Beyond strong persistence when forgetting in answer set programming
• A brief history of updates of answer-set programs
• Forgetting in answer set programming -- a survey
• Forgetting in multi-agent modal logics
• Variable Forgetting in Reasoning about Knowledge
• Forgetting in ASP: the forgotten properties
• Knowledge forgetting in propositional \(\mu\)-calculus
• Preserving strong equivalence while forgetting
• You can't always forget what you want: on the limits of forgetting in answer set programming
• Forgetting auxiliary atoms in forks
• A syntactic operator for forgetting that satisfies strong persistence
• On syntactic forgetting under uniform equivalence
• Solving logic program conflict through strong and weak forgettings
• Computing sufficient and necessary conditions in CTL: a forgetting approach
• On the limits of forgetting in answer set programming
• Common equivalence and size of forgetting from Horn formulae
• Techniques for measuring the inferential strength of forgetting policies
• Semantic forgetting in answer set programming

This page was built for publication: Knowledge Forgetting in Answer Set Programming

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