Forgetting in ASP: the forgotten properties

DOI10.1007/978-3-319-48758-8_37MaRDI QIDQ2835900zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Matthias Knorr, João Leite, 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)

Recommendations

• A bird's-eye view of forgetting in answer-set programming
• On the limits of forgetting in answer set programming
• A syntactic operator for forgetting that satisfies strong persistence
• You can't always forget what you want: on the limits of forgetting in answer set programming
• When you must forget: Beyond strong persistence when forgetting in answer set programming

Cites work

• A Unifying Perspective on Knowledge Updates
• Dynamic updates of non-monotonic knowledge bases
• Forgetting under the well-founded semantics
• How to progress a database
• scientific article; zbMATH DE number 5914356 (Why is no real title available?)
• scientific article; zbMATH DE number 1946872 (Why is no real title available?)
• scientific article; zbMATH DE number 1878314 (Why is no real title available?)
• scientific article; zbMATH DE number 6747883 (Why is no real title available?)
• scientific article; zbMATH DE number 6747919 (Why is no real title available?)
• scientific article; zbMATH DE number 2243387 (Why is no real title available?)
• Knowledge Forgetting in Answer Set Programming
• Knowledge forgetting: properties and applications
• Local closed world reasoning with description logics under the well-founded semantics
• Logic-based ontology comparison and module extraction, with an application to DL-Lite
• Model-theoretic inseparability and modularity of description logic ontologies
• Nested expressions in logic programs
• On properties of update sequences based on causal rejection
• On updates of hybrid knowledge bases composed of ontologies and rules
• Parametrized logic programming
• Preserving strong equivalence while forgetting
• Propositional theories are strongly equivalent to logic programs
• Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
• Semantic forgetting in answer set programming
• Solving logic program conflict through strong and weak forgettings
• Strongly equivalent logic programs
• You can't always forget what you want: on the limits of forgetting in answer set programming

Cited in

(7)

• A bird's-eye view of forgetting in answer-set programming
• Syntactic ASP forgetting with forks
• Forgetting under the well-founded semantics
• 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
• Forgetting in answer set programming -- a survey

Describes a project that uses

Uses Software

• NoHR
• Potassco

This page was built for publication: Forgetting in ASP: the forgotten properties

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