Apr 24, 2019 · We consider hard constraints with LP-trees, and propose a solving algorithm that returns the most preferable feasible outcome. In the algorithm, ...

The CP-net and the LP-tree are two fundamental graphical models for representing user's qualitative preferences. Constrained CP-nets have been studied in ...

The CP-net and the LP-tree are two fundamental graphical models for representing user's qualitative preferences. Constrained CP-nets have been studied in ...

Lexicographic Preference Trees with Hard Constraints. https://doi.org/10.1007/978-3-030-18305-9_31 ·. Journal: Advances in Artificial Intelligence Lecture ...

The CP-net and the LP-tree are two fundamental graphical models for representing user's qualitative preferences. Constrained CP-nets have been studied in ...

In this paper, we extend the LP- tree with a set of hard feasibility constraints, and then we propose a recursive backtrack search algorithm that we call Search ...

We consider here the problem of constrained Lexicographic Preference Tree (LP-tree) where a set of constraints co-exist with the preference information ...

We consider here the problem of constrained Lexicographic Preference Tree (LP-tree) where a set of constraints co-exist with the preference information ...

Feb 7, 2022 · "Lexicographic Preference Trees with Hard Constraints." In Advances in Artificial Intelligence, 366–72. Cham: Springer International ...

Sep 23, 2022 · Lexicographic preference trees have several advantages over other preference representation models. First, this is an ordinal model, which is ...