On the limits of forgetting in answer set programming
From MaRDI portal
Recommendations
- 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
- A bird's-eye view of forgetting in answer-set programming
- Knowledge Forgetting in Answer Set Programming
- A syntactic operator for forgetting that satisfies strong persistence
Cites work
- scientific article; zbMATH DE number 5914356 (Why is no real title available?)
- scientific article; zbMATH DE number 3684932 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 1946872 (Why is no real title available?)
- scientific article; zbMATH DE number 2080314 (Why is no real title available?)
- scientific article; zbMATH DE number 2243387 (Why is no real title available?)
- A Unifying Perspective on Knowledge Updates
- A knowledge level account of forgetting
- A model-theoretic approach to belief change in answer set programming
- A syntactic operator for forgetting that satisfies strong persistence
- An abductive framework for computing knowledge base updates
- Dynamic updates of non-monotonic knowledge bases
- Forgetting Literals with Varying Propositional Symbols
- Forgetting auxiliary atoms in forks
- Forgetting for knowledge bases in DL-lite
- Forgetting under the well-founded semantics
- How to progress a database
- Knowledge Forgetting in Answer Set Programming
- Knowledge forgetting: properties and applications
- Lazy narrowing: strong completeness and eager variable elimination
- Logic Programming and Nonmonotonic Reasoning
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Model-theoretic inseparability and modularity of description logic ontologies
- Modularity aspects of disjunctive stable models
- Nested expressions in logic programs
- On the computational cost of disjunctive logic programming: Propositional case
- Preserving strong equivalence while forgetting
- Propositional theories are strongly equivalent to logic programs
- Reasoning under inconsistency: a forgetting-based approach
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Second-order quantifier elimination. Foundations, computational aspects and applications
- 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
- Sound and complete inference rules for SE-consequence
- Stable inference as intuitionistic validity
- Strongly equivalent logic programs
- The DLV system for knowledge representation and reasoning
- The logical difference for the lightweight description logic \(\mathcal {EL}\)
- The rise and fall of semantic rule updates based on SE-models
- The well-founded semantics for general logic programs
- 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
Cited in
(22)- A bird's-eye view of forgetting in answer-set programming
- When you must forget: Beyond strong persistence when forgetting in answer set programming
- Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions
- Forgetting under the well-founded semantics
- Component properties of forgetting and progression in the situation calculus
- A polynomial reduction of forks into logic programs
- Forgetting in answer set programming -- a survey
- Knowledge Forgetting in Answer Set Programming
- Forgetting in ASP: the forgotten properties
- Knowledge forgetting in propositional \(\mu\)-calculus
- Preserving strong equivalence while forgetting
- Syntactic ASP forgetting with forks
- 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
- Common equivalence and size of forgetting from Horn formulae
- Syntactic ASP forgetting with forks
- Semantic forgetting in answer set programming
- Rough forgetting
This page was built for publication: On the limits of forgetting in answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2211850)
