A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Arc Consistency for Constrained Lexicographic Preference Trees
2020
IEEE Access
Many AI applications such as recommendation systems and personalized planning require handling both constraints and preferences. In such applications, constraints can be viewed as restrictions to the solution space where preferences are the medium to identify preferred solutions. We consider here the problem of constrained Lexicographic Preference Tree (LP-tree) where a set of constraints co-exist with the preference information represented as LP-tree. The goal is to return the most preferred
doi:10.1109/access.2020.2983283
fatcat:5ymtye4vmvdkzpu3tsxa4owifu