Updating logical databases
Handbook of theoretical computer science (vol. B)
Reasoning about knowledge
Theoretical Computer Science - Special issue: database theory
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Model checking
Computational complexity of planning and approximate planning in the presence of incompleteness
Artificial Intelligence
Handbook of defeasible reasoning and uncertainty management systems: Volume 4 abductive reasoning and learning
Revision Specifications by Means of Programs
JELIA '94 Proceedings of the European Workshop on Logics in Artificial Intelligence
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The Computational Complexity of Agent Design Problems
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
A framework for declarative update specifications in logic programs
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Complexity of Multi-agent Systems Behavior
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
| Hi-index | 0.00 |
Recently, several approaches to updating knowledge bases modeled as extended logic programs (ELPs) have been introduced, ranging from basic methods to incorporate (sequences of) sets of rules into a logic program, to more elaborate methods which use an update policy for specifying how updates must be incorporated. In this paper, we introduce a framework for reasoning about evolving knowledge bases, which are represented as ELPs and maintained by an update policy. We describe a formal model which captures various update approaches, and define a logical language for expressing properties of evolving knowledge bases. We further investigate the semantical properties of knowledge states with respect to reasoning. In particular, we describe finitary characterizations of the evolution, and derive complexity results for our framework.