Semantical considerations on nonmonotonic logic
Artificial Intelligence
Compiling circumscriptive theories into logic programs
Proceedings of the 2nd international workshop on Non-monotonic reasoning
Logic programs with classical negation
Logic programming
View updates in stratified disjunctive databases
Journal of Automated Reasoning
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Logic program specialisation with deletion of useless clauses
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Proceedings of the eleventh international conference on Logic programming
The complexity of logic-based abduction
Journal of the ACM (JACM)
Lazy narrowing: strong completeness and eager variable elimination
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Theoretical Computer Science - Special issue: database theory
Disjunctive logic programs with inheritance
Proceedings of the 1999 international conference on Logic programming
Conflicting agents: conflict management in multi-agent systems
Conflicting agents: conflict management in multi-agent systems
On strongest neccessary and weakest sufficient conditions
Artificial Intelligence
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Answer set programming and plan generation
Artificial Intelligence
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
Variable Elimination and Chaining in a Resolution-based Prover for Inequalities
Proceedings of the 5th Conference on Automated Deduction
Preprocessing of intractable problems
Information and Computation
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
An abductive framework for computing knowledge base updates
Theory and Practice of Logic Programming
Theory and Practice of Logic Programming
Disjunctive logic programs with inheritance
Theory and Practice of Logic Programming
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Comparisons and computation of well-founded semantics for disjunctive logic programs
ACM Transactions on Computational Logic (TOCL)
Solving logic program conflict through strong and weak forgettings
Artificial Intelligence
ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Semantical characterizations and complexity of equivalences in answer set programming
ACM Transactions on Computational Logic (TOCL)
Forgetting in Managing Rules and Ontologies
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Forgetting Literals with Varying Propositional Symbols
Journal of Logic and Computation
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
A theory of forgetting in logic programming
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Towards generalized rule-based updates
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Solving logic program conflict through strong and weak forgettings
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Mathematical Logic for Life Science Ontologies
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Knowledge forgetting: Properties and applications
Artificial Intelligence
Variable forgetting in reasoning about knowledge
Journal of Artificial Intelligence Research
Forgetting and uniform interpolation in large-scale description logic terminologies
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Concept and Role Forgetting in ${\mathcal {ALC}}$ Ontologies
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Uniform Interpolation for $\mathcal{ALC}$ Revisited
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Reasoning under inconsistency: A forgetting-based approach
Artificial Intelligence
Logic-based ontology comparison and module extraction, with an application to DL-Lite
Artificial Intelligence
Towards closed world reasoning in dynamic open worlds
Theory and Practice of Logic Programming
Tableau-based Forgetting in ALC Ontologies
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Forgetting for knowledge bases in DL-Lite
Annals of Mathematics and Artificial Intelligence
Interpolation theorems for some extended description logics
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part II
Interpolable formulas in equilibrium logic and answer set programming
Journal of Artificial Intelligence Research
Forgetting for defeasible logic
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Model-Theoretic Approach to Belief Change in Answer Set Programming
ACM Transactions on Computational Logic (TOCL)
Forgetting for answer set programs revisited
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
The notion of forgetting, also known as variable elimination, has been investigated extensively in the context of classical logic, but less so in (nonmonotonic) logic programming and nonmonotonic reasoning. The few approaches that exist are based on syntactic modifications of a program at hand. In this paper, we establish a declarative theory of forgetting for disjunctive logic programs under answer set semantics that is fully based on semantic grounds. The suitability of this theory is justified by a number of desirable properties. In particular, one of our results shows that our notion of forgetting can be entirely captured by classical forgetting. We present several algorithms for computing a representation of the result of forgetting, and provide a characterization of the computational complexity of reasoning from a logic program under forgetting. As applications of our approach, we present a fairly general framework for resolving conflicts in inconsistent knowledge bases that are represented by disjunctive logic programs, and we show how the semantics of inheritance logic programs and update logic programs from the literature can be characterized through forgetting. The basic idea of the conflict resolution framework is to weaken the preferences of each agent by forgetting certain knowledge that causes inconsistency. In particular, we show how to use the notion of forgetting to provide an elegant solution for preference elicitation in disjunctive logic programming.