Planning with Preferences using Logic Programming
Tran Cao Son, Enrico Pontelli
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.
Create a lesson
Related papers
BEAKER: An Expert-Curated Benchmark for Embodied Brains in Self-Driving Chemical Laboratories
Fei Lin, Tengchao Zhang, Ziyang Gong et al.
FrontierPhysics: Evaluating Agents for End-to-End Physics Research
Bingran You, Wenjun Ke, Ria Rosenauer et al.
Dull, Dirty, Dangerous? Working Conditions and the Limits of Occupational AI Exposure
Siyi Yu
Learning to Decode Linear Codes with Generalized Belief Propagation Network
Samira Malek
On Turn-Level Best-of-N Sampling for Scaling LLM Agents
Jalaj Bhandari, Dhawal Gupta, Hongli Zhan et al.
CompressionBench: How can your coding agents compress LLMs?
Xinrui Zhong, Zhifeng Li, Zhiming Wang et al.