Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-10T21:29:05.407Z Has data issue: false hasContentIssue false
  • English
  • Français

Planning with preferences using logic programming

Published online by Cambridge University Press:  02 August 2006

TRAN CAO SON  and
ENRICO PONTELLI
TRAN CAO SON
Affiliation:
Knowledge Representation, Logic, and Advanced Programming Laboratory, Computer Science Department, New Mexico State University, Las Cruces, NM, USA (e-mail: tson@cs.nmsu.edu, epontell@cs.nmsu.edu)
ENRICO PONTELLI
Affiliation:
Knowledge Representation, Logic, and Advanced Programming Laboratory, Computer Science Department, New Mexico State University, Las Cruces, NM, USA (e-mail: tson@cs.nmsu.edu, epontell@cs.nmsu.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

We present a declarative language, ${\cal PP}$, for the high-level specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allows users to elegantly express non-trivial, multi-dimensional preferences and priorities over such preferences. The semantics of ${\cal PP}$ allows the identification of most preferred trajectories for a given goal. We also provide an answer set programming implementation of planning problems with ${\cal PP}$ preferences.

Keywords

planning with preferencespreference languagepreference representationanswer set planning
Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 6 , Issue 5 , September 2006 , pp. 559 - 607
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This paper is an extended version of a paper that appeared in the Proceedings of the 7th International Conference on Logic Programming and Non-Monotonic Reasoning, 2004.