Planning with preferences using logic programming

  • Authors:
  • Tran Cao Son;Enrico Pontelli

  • Affiliations:
  • 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);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)

  • Venue:
  • Theory and Practice of Logic Programming
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.