Comparing action descriptions based on semantic preferences. Eiter, T., Erdem, E., Fink, M., & Senko, J. Annals of Mathematics and Artificial Intelligence, 50(3-4):273-304, 2007. Link abstract bibtex 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.
@article{DBLP:journals/amai/EiterEFS07,
author = {Thomas Eiter and
Esra Erdem and
Michael Fink and
J{\'a}n Senko},
title = {Comparing action descriptions based on semantic preferences},
journal = {Annals of Mathematics and Artificial Intelligence},
volume = {50},
number = {3-4},
year = {2007},
pages = {273-304},
ee = {http://dx.doi.org/10.1007/s10472-007-9077-y},
bibsource = {DBLP, http://dblp.uni-trier.de},
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.
},
}
Downloads: 0
{"_id":{"_str":"53424e050e946d920a000669"},"__v":10,"authorIDs":["5456f0758b01c81930000081","5457257c2abc8e9f370000e3","546a3dcdbc7d6a460d001844","5df0b7a08367c8de010000ce","5df87bbedb7d9ddf01000044","5e4957a916841dde01000031","u493trvfaXuB4g9PZ"],"author_short":["Eiter, T.","Erdem, E.","Fink, M.","Senko, J."],"bibbaseid":"eiter-erdem-fink-senko-comparingactiondescriptionsbasedonsemanticpreferences-2007","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Thomas"],"propositions":[],"lastnames":["Eiter"],"suffixes":[]},{"firstnames":["Esra"],"propositions":[],"lastnames":["Erdem"],"suffixes":[]},{"firstnames":["Michael"],"propositions":[],"lastnames":["Fink"],"suffixes":[]},{"firstnames":["Ján"],"propositions":[],"lastnames":["Senko"],"suffixes":[]}],"title":"Comparing action descriptions based on semantic preferences","journal":"Annals of Mathematics and Artificial Intelligence","volume":"50","number":"3-4","year":"2007","pages":"273-304","ee":"http://dx.doi.org/10.1007/s10472-007-9077-y","bibsource":"DBLP, http://dblp.uni-trier.de","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. ","bibtex":"@article{DBLP:journals/amai/EiterEFS07,\n author = {Thomas Eiter and\n Esra Erdem and\n Michael Fink and\n J{\\'a}n Senko},\n title = {Comparing action descriptions based on semantic preferences},\n journal = {Annals of Mathematics and Artificial Intelligence},\n volume = {50},\n number = {3-4},\n year = {2007},\n pages = {273-304},\n ee = {http://dx.doi.org/10.1007/s10472-007-9077-y},\n bibsource = {DBLP, http://dblp.uni-trier.de},\n abstract = {The focus of this paper is on action domain descriptions whose meaning can be \nrepresented by transition diagrams. We introduce several semantic measures to \ncompare such action descriptions, based on preferences over possible states of \nthe world and preferences over some given conditions (observations, assertions, \netc.) about the domain, as well as the probabilities of possible transitions. \nThis preference information is used to assemble a weight which is assigned to an \naction description. As applications of this approach, we study updating action \ndescriptions and identifying elaboration tolerant action descriptions, with \nrespect to some given conditions. With a semantic approach based on preferences, \nnot only, for some problems, we get more plausible solutions, but also, for some \nproblems without any solutions due to too strong conditions, we can identify \nwhich conditions to relax to obtain a solution. We further study computational \nissues, and give a characterization of the computational complexity of computing \nthe semantic measures.\n},\n \n}\n\n","author_short":["Eiter, T.","Erdem, E.","Fink, M.","Senko, J."],"key":"DBLP:journals/amai/EiterEFS07","id":"DBLP:journals/amai/EiterEFS07","bibbaseid":"eiter-erdem-fink-senko-comparingactiondescriptionsbasedonsemanticpreferences-2007","role":"author","urls":{"Link":"http://dx.doi.org/10.1007/s10472-007-9077-y"},"downloads":0,"html":""},"bibtype":"article","biburl":"http://193.255.135.175/papers/krrpublications.bib","downloads":0,"keywords":[],"search_terms":["comparing","action","descriptions","based","semantic","preferences","eiter","erdem","fink","senko"],"title":"Comparing action descriptions based on semantic preferences","year":2007,"dataSources":["WeBGfagwiP89ve7hM"]}