Planning with Preferences using Logic Programming

2005/08/31 by Tran Cao Son, Enrico Pontelli, Son, Tran Cao +1
Computer Science · #AI-based Problem Solving and Planning #Artificial Intelligence (cs.AI) #F.4.1 #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation

paper · pdf · doi:10.48550/arxiv.cs/0508132

openalex publication_date 2005/08/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We present a declarative language, 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 PP allows the identification of most preferred trajectories for a given goal. We also provide an answer set programming implementation of planning problems with PP preferences.

Citations

• Fast planning through planning graph analysis

Related

• Planning with Partial Preference Models
• Logic Programming for Describing and Solving Planning Problems
• Probabilistic Planning with Prioritized Preferences over Temporal Logic Objectives
• Preference-Guided Planning: An Active Elicitation Approach
• Probabilistic Planning with Preferences over Temporal Goals