Planning with Preferences using Logic Programming
Tran Cao Son, Enrico Pontelli

TL;DR
This paper introduces PP, a declarative logic programming language for specifying complex, multi-dimensional preferences in planning problems, enabling the identification of most preferred solutions through answer set programming.
Contribution
The paper presents a novel language, PP, that allows expressive preference modeling in planning, along with its formal semantics and an implementation via answer set programming.
Findings
PP effectively models complex preferences in planning.
The implementation demonstrates practical applicability.
PP identifies most preferred trajectories based on user-defined preferences.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · AI-based Problem Solving and Planning · Multi-Agent Systems and Negotiation
