Computational techniques for a simple theory of conditional preferences

DOI10.1016/j.artint.2010.11.018zbMath1225.68250OpenAlexW1991456128MaRDI QIDQ646519

Nic Wilson

Publication date: 17 November 2011

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2010.11.018

zbMATH Keywords

conditional preferenceslexicographic preferencesconstrained optimisationCP-netsCeteris Paribus preferencescomparative preferencesTCP-nets

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (6)

Explaining robust additive utility models by sequences of preference swaps ⋮ Incremental evaluation of continuous preference queries ⋮ Possibilistic preference networks ⋮ Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics ⋮ Expressive efficiency of two kinds of specific CP-nets ⋮ Modeling Ceteris Paribus Preferences in Formal Concept Analysis

Uses Software

• CP-nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Logical preference representation and combinatorial vote
• Everything else being equal: a modal logic for ceteris paribus preferences
• What is ceteris paribus preference?
• Lexicographically-ordered constraint satisfaction problems
• Graphically structured value-function compilation
• Hard and soft constraints for reasoning about qualitative conditional preferences
• The logic of preference reconsidered
• Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities

This page was built for publication: Computational techniques for a simple theory of conditional preferences