Computational techniques for a simple theory of conditional preferences

Nic Wilson

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)1053-1091
Number of pages39
JournalArtificial Intelligence
Volume175
Issue number7-8
DOIs
Publication statusPublished - May 2011

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Computational techniques for a simple theory of conditional preferences'. Together they form a unique fingerprint.

Cite this