Checking the Consistency of Multidimensional Ceteris-Paribus Preferences: Can Binarized Lexicographical Orders Help?
Author:
- 13 November 2026
- book chapter
- Published by Springer Nature
- p. 438-453
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Checking Consistency of CP-Theory Preferences in Polynomial TimeProceedings of the AAAI Conference on Artificial Intelligence, 2025
- Upside-Down Preference Reversal: How to Override Ceteris-Paribus Preferences?2015
- Computational techniques for a simple theory of conditional preferencesArtificial Intelligence, 2011
- The Computational Complexity of Dominance and Consistency in CP-NetsJournal of Artificial Intelligence Research, 2008
- On Graphical Modeling of Preference and ImportanceJournal of Artificial Intelligence Research, 2006
- CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference StatementsJournal of Artificial Intelligence Research, 2004
- Scheduling with AND/OR Precedence ConstraintsSIAM Journal on Computing, 2004
- Preference programming: Advanced problem solving for configurationArtificial Intelligence for Engineering Design, Analysis and Manufacturing, 2003
- Decisions with Multiple Objectives1993
- Topological sorting of large networksCommunications of the ACM, 1962