Exploiting constraints in design synthesis
Exploiting constraints in design synthesis
A knowledge level analysis of belief revision
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Properties of independently axiomatizable bimodal logics
Journal of Symbolic Logic
Journal of Symbolic Logic
First steps in modal logic
Artificial Intelligence
Solving the frame problem: a mathematical investigation of the common sense law of inertia
Solving the frame problem: a mathematical investigation of the common sense law of inertia
Representing action: indeterminacy and ramifications
Artificial Intelligence
Checking regulation consistency by using SOL-resolution
ICAIL '99 Proceedings of the 7th international conference on Artificial intelligence and law
Propositional belief base update and minimal change
Artificial Intelligence
Beliefs, belief revision, and splitting languages
Logic, language and computation, vol. 2
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Dynamic Logic
Consistency of Action Descriptions
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
On the modal logic of theory change
Proceedings of the Workshop on The Logic of Theory Change
PDL-based framework for reasoning about actions
AI*IA '95 Proceedings of the 4th Congress of the Italian Association for Artificial Intelligence on Topics in Artificial Intelligence
Metatheory of actions: Beyond consistency
Artificial Intelligence
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
Defeasible specifications in action theories
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
CTL model update for system modifications
Journal of Artificial Intelligence Research
Epistemological problems of artificial intelligence
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
EPDL: a logic for causal reasoning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Updating action domain descriptions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Cohesion, coupling and the meta-theory of actions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Iterated belief revision, revised
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Next steps in propositional horn contraction
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
What is believed is what is explained (sometimes)
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Artificial Intelligence
A modularity approach for a fragment of ALC
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Preferential Reasoning for Modal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
On the link between partial meet, kernel, and infra contraction and its application to Horn logic
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
As historically acknowledged in the Reasoning about Actions and Change community, intuitiveness of a logical domain description cannot be fully automated. Moreover, like any other logical theory, action theories may also evolve, and thus knowledge engineers need revision methods to help in accommodating new incoming information about the behavior of actions in an adequate manner. The present work is about changing action domain descriptions in multimodal logic. Its contribution is threefold: first we revisit the semantics of action theory contraction proposed in previous work, giving more robust operators that express minimal change based on a notion of distance between Kripke-models. Second we give algorithms for syntactical action theory contraction and establish their correctness with respect to our semantics for those action theories that satisfy a principle of modularity investigated in previous work. Since modularity can be ensured for every action theory and, as we show here, needs to be computed at most once during the evolution of a domain description, it does not represent a limitation at all to the method here studied. Finally we state AGM-like postulates for action theory contraction and assess the behavior of our operators with respect to them. Moreover, we also address the revision counterpart of action theory change, showing that it benefits from our semantics for contraction.