Nonmonotonic logic and temporal projection
Artificial Intelligence
Gap-definable counting classes
Journal of Computer and System Sciences
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
The complexity of logic-based abduction
Journal of the ACM (JACM)
Closure properties and witness reduction
Journal of Computer and System Sciences
Integration of weighted knowledge bases
Artificial Intelligence
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
Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
Solving weighted CSP by maintaining arc consistency
Artificial Intelligence
MaxSolver: an efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
Optimal status sets of heterogeneous agent programs
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
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
Updating action domain descriptions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
From logic programs updates to action description updates
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
Updating action domain descriptions
Artificial Intelligence
Journal of Computer and System Sciences
Hi-index | 0.00 |
The focus of this paper is on action domain descriptions whose meaning can be represented by transition diagrams. We introduce several semantic measures to compare such action descriptions, based on preferences over possible states of the world and preferences over some given conditions (observations, assertions, etc.) about the domain, as well as the probabilities of possible transitions. This preference information is used to assemble a weight which is assigned to an action description. As applications of this approach, we study updating action descriptions and identifying elaboration tolerant action descriptions, with respect to some given conditions. With a semantic approach based on preferences, not only, for some problems, we get more plausible solutions, but also, for some problems without any solutions due to too strong conditions, we can identify which conditions to relax to obtain a solution. We further study computational issues, and give a characterization of the computational complexity of computing the semantic measures.