Rule based updates on simple knowledge bases
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Update by Means of Inference Rules
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Well-founded semantics for extended logic programs with dynamic preferences
Journal of Artificial Intelligence Research
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Considerations on Updates of Logic Programs
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Handling defeasibilities in action domains
Theory and Practice of Logic Programming
Using methods of declarative logic programming for intelligent information agents
Theory and Practice of Logic Programming
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
ACM Transactions on Computational Logic (TOCL)
Dynamic evolutions based on ontologies
Knowledge-Based Systems
Semantic forgetting in answer set programming
Artificial Intelligence
A preference-based framework for updating logic programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
A program-level approach to revising logic programs under the answer set semantics
Theory and Practice of Logic Programming
A Model-Theoretic Approach to Belief Change in Answer Set Programming
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Recent work on rule-based updates provided new frameworks for updates in more general knowledge domains [Marek and Truszczriski, 1994; Baral, 1994; Przymusinski and Turner, 1995]. In this paper, we consider a simple generalization of rule-based updates where incomplete knowledge bases are allowed and update rules may contain two types of negations. It turns out that previous methods cannot deal with this generalized rule-based update properly. To overcome the difficulty, we argue that necessary preferences between update rules and inertia rules must be taken into account in update specifications. From this motivation, we propose prioritized logic programs (PLPs) by adding preferences into extended logic programs. [Gelfond and Lifschitz, 1991]. Formal semantics of PLPs is provided in terms of the answer set semantics of extended logic programs. We then show that the procedure of generalized rule-based update can be formalized in the framework of PLPs. The minimal change property of the update is also investigated.