Semantic forgetting in answer set programming
From MaRDI portal
Publication:2389674
Recommendations
- Knowledge Forgetting in Answer Set Programming
- On the limits of forgetting in answer set programming
- A bird's-eye view of forgetting in answer-set programming
- Semantic forgetting in expressive description logics
- 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
- Forgetting under the well-founded semantics
- FAME: an automated tool for semantic forgetting in expressive description logics
Cites work
- scientific article; zbMATH DE number 1571528 (Why is no real title available?)
- scientific article; zbMATH DE number 4106291 (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 592370 (Why is no real title available?)
- scientific article; zbMATH DE number 1946872 (Why is no real title available?)
- scientific article; zbMATH DE number 1963548 (Why is no real title available?)
- scientific article; zbMATH DE number 2080314 (Why is no real title available?)
- scientific article; zbMATH DE number 1509480 (Why is no real title available?)
- scientific article; zbMATH DE number 1759366 (Why is no real title available?)
- scientific article; zbMATH DE number 2085248 (Why is no real title available?)
- scientific article; zbMATH DE number 2243387 (Why is no real title available?)
- scientific article; zbMATH DE number 3062907 (Why is no real title available?)
- A logic for default reasoning
- ASSAT: computing answer sets of a logic program by SAT solvers
- An abductive framework for computing knowledge base updates
- Answer set programming and plan generation
- Autoepistemic logic
- Characterizations of the disjunctive stable semantics by partial evaluation
- Circumscription - a form of non-monotonic reasoning
- Comparisons and computation of well-founded semantics for disjunctive logic programs
- Computational aspects of monotone dualization: a brief survey
- Disjunctive logic programs with inheritance
- Dynamic updates of non-monotonic knowledge bases
- Forgetting Literals with Varying Propositional Symbols
- Lazy narrowing: strong completeness and eager variable elimination
- Logic Programming
- Logic Programming
- Logic program-based updates
- Negation as failure in the head
- Nested expressions in logic programs
- On properties of update sequences based on causal rejection
- On strongest necessary and weakest sufficient conditions
- On the computational cost of disjunctive logic programming: Propositional case
- Preprocessing of intractable problems
- Propositional semantics for disjunctive logic programs
- Revision programming
- Semantical characterizations and complexity of equivalences in answer set programming
- Semantical considerations on nonmonotonic logic
- Solving logic program conflict through strong and weak forgettings
- Strongly equivalent logic programs
- The DLV system for knowledge representation and reasoning
- The complexity of logic-based abduction
- Tight logic programs
- View updates in stratified disjunctive databases
Cited in
(27)- A logic-algebraic tool for reasoning with knowledge-based systems
- Forgetting for knowledge bases in DL-lite
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- When you must forget: Beyond strong persistence when forgetting in answer set programming
- Mathematical Logic for Life Science Ontologies
- Forgetting under the well-founded semantics
- Forgetting in multi-agent modal logics
- Knowledge Forgetting in Answer Set Programming
- Forgetting in ASP: the forgotten properties
- Semantic forgetting in expressive description logics
- Omission-based abstraction for answer set programs
- Knowledge forgetting in propositional \(\mu\)-calculus
- Towards closed world reasoning in dynamic open worlds
- Preserving strong equivalence while forgetting
- Reasoning under inconsistency: a forgetting-based approach
- 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
- Eliminating concepts and roles from ontologies in expressive descriptive logics
- Forgetting Literals with Varying Propositional Symbols
- Forgetting for defeasible logic
- A model of three-way decisions for knowledge harnessing
- Common equivalence and size of forgetting from Horn formulae
- Knowledge forgetting: properties and applications
- On quantifying literals in Boolean logic and its applications to explainable AI
This page was built for publication: Semantic forgetting in answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389674)
