Logic programs with classical negation
Logic programming
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
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)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
A theory of forgetting in logic programming
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
Solving logic program conflict through strong and weak forgettings
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Forgetting in Managing Rules and Ontologies
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Forgetting actions in domain descriptions
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Forgetting in logic programs with ordered disjunction
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Forgetting concepts in DL-lite
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Reasoning under inconsistency: A forgetting-based approach
Artificial Intelligence
Forgetting for knowledge bases in DL-Lite
Annals of Mathematics and Artificial Intelligence
LPForget: a system of forgetting in answer set programming
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
| Hi-index | 0.00 |
We establish a declarative theory of forgetting for disjunctive logic programs. 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 is completely captured by the classical forgetting. A transformation-based algorithm is also developed for computing the result of forgetting. We also provide an analysis of computational complexity. As an application of our approach, a fairly general framework for resolving conflicts in inconsistent knowledge bases represented by disjunctive logic programs is defined. The basic idea of our 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.