Updating logical databases
An action language based on causal explanation: preliminary report
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Consistency of Action Descriptions
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
An abductive framework for computing knowledge base updates
Theory and Practice of Logic Programming
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
What is believed is what is explained (sometimes)
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Comparing action descriptions based on semantic preferences
Annals of Mathematics and Artificial Intelligence
Metatheory of actions: Beyond consistency
Artificial Intelligence
Resolving Conflicts in Action Descriptions
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Elaborating domain descriptions
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Forgetting actions in domain descriptions
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Updating action domain descriptions
Artificial Intelligence
Journal of Artificial Intelligence Research
A description logic based situation calculus
Annals of Mathematics and Artificial Intelligence
Journal of Computer and System Sciences
Comparing action descriptions based on semantic preferences
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Propositional Update Operators Based on Formula/Literal Dependence
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
How can an intelligent agent update her knowledge base about an action domain, relative to some conditions (possibly obtained from earlier observations)? We study this question in a formal framework for reasoning about actions and change, in which the meaning of an action domain description can be represented by a directed graph whose nodes correspond to states and whose edges correspond to action occurrences. We define the update of an action domain description in this framework, and show among other results that a solution to this problem can be obtained by a divide-and-conquer approach in some cases. We also introduce methods to compute a solution and an approximate solution to this problem, and analyze the computational complexity of these problems. Finally, we discuss techniques to improve the quality of solutions.