Annals of Mathematics and Artificial Intelligence

, Volume 50, Issue 3, pp 273–304

Comparing action descriptions based on semantic preferences

Authors

    • Institute of Information SystemsVienna University of Technology
  • Esra Erdem
    • Faculty of Engineering and Natural SciencesSabancı University
  • Michael Fink
    • Institute of Information SystemsVienna University of Technology
  • Ján Senko
    • Institute of Information SystemsVienna University of Technology
Article

DOI: 10.1007/s10472-007-9077-y

Cite this article as:
Eiter, T., Erdem, E., Fink, M. et al. Ann Math Artif Intell (2007) 50: 273. doi:10.1007/s10472-007-9077-y

Abstract

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.

Keywords

Action domain descriptionsSemantic preferencesTransition diagrams

Mathematics Subject Classifications (2000)

68T3068T27
Download to read the full article text

Copyright information

© Springer Science+Business Media B.V. 2007