Structural complexity 1
Updating logical databases
Handbook of theoretical computer science (vol. B)
Well founded semantics for logic programs with explicit negation
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Reasoning about knowledge
Efficient checking of temporal integrity constraints using bounded history encoding
ACM Transactions on Database Systems (TODS)
Temporal conditions and integrity constraints in active database systems
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Answer sets for prioritized logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Theoretical Computer Science - Special issue: database theory
Relational transducers for electronic commerce
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Symbolic Model Checking
LUPS---a language for updating logic programs
Artificial Intelligence
Revision Specifications by Means of Programs
JELIA '94 Proceedings of the European Workshop on Logics in Artificial Intelligence
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
Well-founded semantics for extended logic programs with dynamic preferences
Journal of Artificial Intelligence Research
Abductive framework for nonmonotonic theory change
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A framework for declarative update specifications in logic programs
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Solving logic program conflict through strong and weak forgettings
Artificial Intelligence
Evolving Logic Programming Based Agents with Temporal Operators
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
A unified framework for representing logic program updates
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Solving logic program conflict through strong and weak forgettings
Artificial Intelligence
A Logic Programming System for Evolving Programs with Temporal Operators
EPIA '09 Proceedings of the 14th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Evolving logic programs with temporal operators
Logic programming, knowledge representation, and nonmonotonic reasoning
| Hi-index | 0.00 |
Recently, several approaches to updating knowledge bases modeled as extended logic programs 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 article, we introduce a framework for reasoning about evolving knowledge bases, which are represented as extended logic programs and maintained by an update policy. We first describe a formal model which captures various update approaches, and we define a logical language for expressing properties of evolving knowledge bases. We then investigate semantical and computational properties of our framework, where we focus on properties of knowledge states with respect to the canonical reasoning task of whether a given formula holds in a given evolving knowledge base. In particular, we present finitary characterizations of the evolution for certain classes of framework instances, which can be exploited for obtaining decidability results. In more detail, we characterize the complexity of reasoning for some meaningful classes of evolving knowledge bases, ranging from polynomial to double exponential space complexity.