Computational techniques for a simple theory of conditional preferences

Authors:
Nic Wilson
Affiliations:
Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Cork, Ireland
Venue:
Artificial Intelligence
Year:
2011

Citing 19
Cited 3

Efficient utility functions for ceteris paribus preferences

Eighteenth national conference on Artificial intelligence
Logical Preference Representation and Combinatorial Vote

Annals of Mathematics and Artificial Intelligence
Qualitative decision making in adaptive presentation of structured information

ACM Transactions on Information Systems (TOIS)
Hard and soft constraints for reasoning about qualitative conditional preferences

Journal of Heuristics
Graphically structured value-function compilation

Artificial Intelligence
Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities

ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
An Efficient Upper Approximation for Conditional Preference

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Extending CP-nets with stronger conditional preference statements

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Voting on multiattribute domains with cyclic preferential dependencies

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research
On graphical modeling of preference and importance

Journal of Artificial Intelligence Research
The computational complexity of dominance and consistency in CP-Nets

Journal of Artificial Intelligence Research
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The computational complexity of dominance and consistency in CP-nets

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Efficient inference for expressive comparative preference languages

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Lexicographically-ordered constraint satisfaction problems

Constraints
Reasoning with conditional ceteris paribus preference statements

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Introducing variable importance tradeoffs into CP-nets

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
UCP-networks: a directed graphical representation of conditional utilities

UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence

Pruning rules for constrained optimisation for conditional preferences

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
A stratified framework for handling conditional preferences: An extension of the analytic hierarchy process

Expert Systems with Applications: An International Journal
Conditional preference nets and possibilistic logic

ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Quantified Score

Hi-index	0.00

Visualization

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.