Forgetting under the well-founded semantics

DOI10.1007/978-3-642-40564-8_4MaRDI QIDQ2851229zbMATH OpenOpenAlexWikidataFDO

Authors José Júlio Alferes, Matthias Knorr, Kewen Wang

Publication date 10 October 2013

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10072/59817

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Preserving strong equivalence while forgetting
• Semantic forgetting in answer set programming
• On the limits of forgetting in answer set programming
• A knowledge level account of forgetting
• Forgetting in ASP: the forgotten properties

Cited in

(17)

• When you must forget: Beyond strong persistence when forgetting in answer set programming
• A polynomial reduction of forks into logic programs
• Forgetting in multi-agent modal logics
• Variable Forgetting in Reasoning about Knowledge
• Naturalizing logic
• scientific article; zbMATH DE number 1302067 (Why is no real title available?)
• Forgetting in ASP: the forgotten properties
• On a general concept of forgetting
• Semantic forgetting in expressive description logics
• Preserving strong equivalence while forgetting
• A syntactic operator for forgetting that satisfies strong persistence
• From forgetting signature elements to forgetting formulas in epistemic states
• Solving logic program conflict through strong and weak forgettings
• On the limits of forgetting in answer set programming
• Forgetting Literals with Varying Propositional Symbols
• Forgetting for defeasible logic
• Semantic forgetting in answer set programming

This page was built for publication: Forgetting under the well-founded semantics

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