Forgetting in answer set programming -- a survey
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5914356 (Why is no real title available?)
- scientific article; zbMATH DE number 5838699 (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 922620 (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
- Abstraction for non-ground answer set programs
- Abstraction for non-ground answer set programs
- An abductive framework for computing knowledge base updates
- Die formalen Regeln der intuitionistischen Logik. I, II, III.
- Disjunctive logic programs with inheritance
- Dynamic updates of non-monotonic knowledge bases
- Extending and implementing the stable model semantics
- Forgetting Literals with Varying Propositional Symbols
- Forgetting auxiliary atoms in forks
- Forgetting for knowledge bases in DL-lite
- Forgetting in ASP: the forgotten properties
- Forgetting under the well-founded semantics
- How to progress a database
- Interpolable formulas in equilibrium logic and answer set programming
- Knowledge Forgetting in Answer Set Programming
- Knowledge forgetting: properties and applications
- Knowledge updates: Semantics and complexity issues
- Lazy narrowing: strong completeness and eager variable elimination
- Logic Programming
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Minimal Logic Programs
- Model-theoretic inseparability and modularity of description logic ontologies
- Modularity aspects of disjunctive stable models
- Nested expressions in logic programs
- Omission-based abstraction for answer set programs
- On properties of update sequences based on causal rejection
- On syntactic forgetting under uniform equivalence
- On the limits of forgetting in answer set programming
- 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
- Strong equivalence made easy: nested expressions and weight constraints
- Strongly equivalent logic programs
- The ASP system DLV2
- 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
(3)
This page was built for publication: Forgetting in answer set programming -- a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027225)
