%0 Conference Paper %1 bienvenu06preferences %A Bienvenu, M. %A Fritz, C. %A McIlraith, S. %B International Conference on Principles of Knowledge Representation and Reasoning (KR06) %C Lake District, UK %D 2006 %K 2006 preference qualitative reasoning temporal todo %P 134-144 %T Planning with Qualitative Temporal Preferences %U http://www.cs.toronto.edu/~sheila/publications/papers/200603101347_KR06BienvenuM.pdf %X In this paper, we address the problem of specifying and generating preferred plans using rich, qualitative user preferences. We propose a logical language for specifying non-Markovian preferences over the evolution of states and actions associated with a plan. The semantics for our first-order preference language is defined in the situation calculus. Unlike other recent temporal preference languages, our preferences are qualitative rather than just ordinal, affording greater expressivity and less incomparability. We propose an approach to computing preferred plans via bounded best-first search in a forwardchaining planner. Key components of our approach are the exploitation of progression to efficiently evaluate levels of preference satisfaction over partial plans, and development of an admissible evaluation function that establishes the optimality of best-first search. We have implemented our planner PPLAN and evaluated it experimentally. Our preference language and planning approach is amenable to integration with several existing planners, and beyond planning, can be used to support arbitrary dynamical reasoning tasks involving preferences.

@inproceedings{bienvenu06preferences, abstract = {In this paper, we address the problem of specifying and generating preferred plans using rich, qualitative user preferences. We propose a logical language for specifying non-Markovian preferences over the evolution of states and actions associated with a plan. The semantics for our first-order preference language is defined in the situation calculus. Unlike other recent temporal preference languages, our preferences are qualitative rather than just ordinal, affording greater expressivity and less incomparability. We propose an approach to computing preferred plans via bounded best-first search in a forwardchaining planner. Key components of our approach are the exploitation of progression to efficiently evaluate levels of preference satisfaction over partial plans, and development of an admissible evaluation function that establishes the optimality of best-first search. We have implemented our planner PPLAN and evaluated it experimentally. Our preference language and planning approach is amenable to integration with several existing planners, and beyond planning, can be used to support arbitrary dynamical reasoning tasks involving preferences.}, added-at = {2007-07-20T16:59:33.000+0200}, address = {Lake District, UK}, author = {Bienvenu, M. and Fritz, C. and McIlraith, S.}, biburl = {https://www.bibsonomy.org/bibtex/275965d69c223c563e74b087579730b21/zeno}, booktitle = {International Conference on Principles of Knowledge Representation and Reasoning (KR06)}, interhash = {dfa0029643647de3973bde37646c554a}, intrahash = {75965d69c223c563e74b087579730b21}, keywords = {2006 preference qualitative reasoning temporal todo}, month = {June}, pages = {134-144}, timestamp = {2007-07-20T16:59:33.000+0200}, title = {Planning with Qualitative Temporal Preferences}, url = {http://www.cs.toronto.edu/~sheila/publications/papers/200603101347_KR06BienvenuM.pdf}, year = 2006 }