Updating Action Domain Descriptions. Eiter, T., Erdem, E., Fink, M., & Senko, J. In IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30-August 5, 2005, pages 418-423, 2005.
Updating Action Domain Descriptions [pdf]Link  abstract   bibtex   
How can an intelligent agent update her knowledge base about an action domain, relative to some conditions (possibly obtained from earlier observations)? We study this question in a formal framework for reasoning about actions and change, in which the meaning of an action domain description can be represented by a directed graph whose nodes correspond to states and whose edges correspond to action occurrences. We define the update of an action domain description in this framework, and show among other results that a solution to this problem can be obtained by a divide-and-conquer approach in some cases. We also introduce methods to compute a solution and an approximate solution to this problem, and analyze the computational complexity of these problems. Finally, we discuss techniques to improve the quality of solutions.
@inproceedings{DBLP:conf/ijcai/EiterEFS05,
  author    = {Thomas Eiter and
               Esra Erdem and
               Michael Fink and
               J{\'a}n Senko},
  title     = {Updating Action Domain Descriptions},
  booktitle = {IJCAI-05, Proceedings of the Nineteenth International Joint
               Conference on Artificial Intelligence, Edinburgh, Scotland,
               UK, July 30-August 5, 2005},
  year      = {2005},
  pages     = {418-423},
  ee        = {http://www.ijcai.org/papers/1167.pdf},
  abstract  = {How can an intelligent agent update her knowledge base about an action domain,
relative to some conditions (possibly obtained from earlier observations)? We
study this question in a formal framework for reasoning about actions and
change, in which the meaning of an action domain description can be represented
by a directed graph whose nodes correspond to states and whose edges correspond
to action occurrences. We define the update of an action domain description in
this framework, and show among other results that a solution to this problem can
be obtained by a divide-and-conquer approach in some cases. We also introduce
methods to compute a solution and an approximate solution to this problem, and
analyze the computational complexity of these problems. Finally, we discuss
techniques to improve the quality of solutions.},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
Downloads: 0