Computational techniques for a simple theory of conditional preferences
A simple logic of conditional preferences is defined, with a language that allows the compact representation of certain kinds of conditional preference statements, a semantics and a proof theory. CP-nets and TCP-nets can be mapped into this logic, and the semantics and proof theory generalise those of CP-nets and TCP-nets. The system can also express preferences of a lexicographic kind. The paper derives various sufficient conditions for a set of conditional preferences to be consistent, along with algorithmic techniques for checking such conditions and hence confirming consistency. These techniques can also be used for totally ordering outcomes in a way that is consistent with the set of preferences, and they are further developed to give an approach to the problem of constrained optimisation for conditional preferences.
Conditional preferences , Comparative preferences , Ceteris paribus preferences , Lexicographic preferences , Constrained optimisation , TCP-nets , CP-nets
WILSON, N. 2011. Computational techniques for a simple theory of conditional preferences. Artificial Intelligence, 175 (7-8), 1053-1091. doi: http://dx.doi.org/10.1016/j.artint.2010.11.018
Copyright © 2011, Elsevier. NOTICE: this is the author’s version of a work that was accepted for publication in Artificial Intelligence. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Artificial Intelligence [Volume 175, Issues 7–8, May 2011, Pages 1053–1091] http://dx.doi.org/10.1016/j.artint.2010.11.018