Comparing action descriptions based on semantic preferences

Authors:
Thomas Eiter;Esra Erdem;Michael Fink;Ján Senko
Affiliations:
Institute of Information Systems, Vienna University of Technology, Austria;Institute of Information Systems, Vienna University of Technology, Austria;Institute of Information Systems, Vienna University of Technology, Austria;Institute of Information Systems, Vienna University of Technology, Austria
Venue:
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Year:
2006

Citing 7
Cited 0

Gap-definable counting classes

Journal of Computer and System Sciences
Artificial intelligence: a modern approach

Artificial intelligence: a modern approach
Closure properties and witness reduction

Journal of Computer and System Sciences
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
Model checking

Model checking
Nonmonotonic causal theories

Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
Updating action domain descriptions

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider 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 an application of this approach, we study the problem of updating 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 conclude with computational issues, and characterize the complexity of computing the semantic measures.