Predicate calculus and program semantics
Predicate calculus and program semantics
Frames in the space of situations (research note)
Artificial Intelligence
Updating logical databases
On the use of epistemic entrenchment in reasoning about action
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Epistemic aspects of databases
Handbook of logic in artificial intelligence and logic programming (Vol. 4)
Artificial Intelligence
A Discipline of Programming
Computing Circumscription Revisited: A Reduction Algorithm
Journal of Automated Reasoning
Cicumscribing Features and Fluents
ICTL '94 Proceedings of the First International Conference on Temporal Logic
A Conditional Logic for Updating in the Possible Models Approach
KI '94 Proceedings of the 18th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
How to Solve Qualification and Ramification Using Dijkstra's Semantics for Programming Languages
AI*IA '97 Proceedings of the 5th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Minimal change and maximal coherence: a basis for belief revision and reasoning about actions
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Deriving properties of belief update from theories of action (II)
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
A causal theory of ramifications and qualifications
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Embracing causality in specifying the indirect effects of actions
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Computing ramifications by postprocessing
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Embracing causality in specifying the indeterminate effects of actions
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
First-order Generalization of the MPMA Belief Update Operator
Fundamenta Informaticae
Propositional Update Operators Based on Formula/Literal Dependence
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
Recently, a great deal of progress has been made using nonmonotonic temporal logics to formalize reasoning about action and change. In particular, much focus has been placed on the proper representation of non-deterministic actions and the indirect effects of actions. For the latter the use of causal or fluent dependency rule approaches has been dominant. Although much recent effort has also been spent applying the belief revision/update (BR/U) approach to the action and change domain, there has been less progress in dealing with nondeterministic update and indirect effects represented as integrity constraints. We demonstrate that much is to be gained by cross-fertilization between the two paradigms and we show this in the following manner. We first propose a generalization of the PMA, called the modified MPMA which uses intuitions from the TL paradigm to permit representation of nondeterministic update and the use of integrity constraints interpreted as causal or fluent dependency rules. We provide several syntactic characterizations of MPMA, one of which is in terms of a simple temporal logic and provide a representation theorem showing equivalence between the two. In constructing the MPMA, we discovered a syntactic anomaly which we call the {\em redundant atom anomaly} that many TL approaches suffer from. We provide a method for avoiding the problem which is equally applicable across paradigms. We also describe a syntactic characterization of MPMA in terms of Dijkstra semantics. We set up a framework for future generalization of the BR/U approach and conclude with a formal comparison of related approaches.