A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
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
Polynomial-Length Planning Spans the Polynomial Hierarchy
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
An abductive framework for computing knowledge base updates
Theory and Practice of Logic Programming
A unified framework for representing logic program updates
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Causal theories of action: a computational core
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Updating action domain descriptions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Solving logic program conflict through strong and weak forgettings
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A Kripkean semantics for dynamic logic programming
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Comparing action descriptions based on semantic preferences
Annals of Mathematics and Artificial Intelligence
Error classification in action descriptions: a heuristic approach
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Updating action domain descriptions
Artificial Intelligence
A tool for answering queries on action descriptions
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Hi-index | 0.01 |
We study resolving conflicts between an action description and a set of conditions (possibly obtained from observations), in the context of action languages. In this formal framework, the meaning of an action description can be represented by a transition diagram---a directed graph whose nodes correspond to states and whose edges correspond to transitions describing action occurrences. This allows us to characterize conflicts by means of states and transitions of the given action description that violate some given conditions. We introduce a basic method to resolve such conflicts by modifying the action description, and discuss how the user can be supported in obtaining more preferred solutions. For that, we identify helpful questions the user may ask (e.g., which specific parts of the action description cause a conflict with some given condition), and we provide answers to them using properties of action descriptions and transition diagrams. Finally, we discuss the computational complexity of these questions in terms of related decision problems.