Planning with preferences using logic programming

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.

Reasoning and Planning with Cooperative Actions for Multiagents Using Answer Set Programming

“…Our immediate goal for the future is to investigate the scalability and efficiency of the proposed method. The use of answer set programming allows us to easily incorporate preferences or domain knowledge in the generation of the joint plans [22,23]. Additionally, we would like to explore the use of more expressive languages (e.g., action languages with constraints and sensing actions) in representing and reasoning about joint-plans of multiagents by addressing various questions mentioned in [2].…”

Implementing Preferences with asprin

“…Son and Pontelli [7] propose a language for specifying preferences in planning that distinguishes three types of preferences: basic, atomic, and general preferences. A basic preference is originally expressed by a propositional formula using Boolean as well as temporal connectives.…”

“…#minimize statements or weak constraints [2,3]). On the other hand, such quantitative ways of optimization are often insufficient for applications and in stark contrast to the vast literature on qualitative and hybrid means of optimization [4][5][6][7][8]8].…”

“…The primary contribution of this paper is to substantiate this claim by showing how easily selected approaches from the literature can be realized with asprin. In particular, we detail how answer set optimization [5], minimization directives [2], strict partially ordered set [8], and the non-temporal part of the preference language in [7] can be implemented with asprin. Moreover, we sketch how the implementations of ordered disjunctions [4] and penalty-based answer set optimization [6] are obtained.…”

Preferences over Objects, Sets and Sequences

“…Such formalism allows to specify, to reason and to generated preferred plans. This approach generalizes the one proposed in (Son & Pontelli, 2006), which also uses temporal logic for expressing preferences over executing plans with an implementation using answer-set programming. At the best of our knowledge, there are no work treating qualitative conditional preferences elicitation and reasoning over sequence of attributed objects in the lines of the CP-Net formalism.…”