Computational techniques for a simple theory of conditional preferences

DOI10.1016/J.ARTINT.2010.11.018MaRDI QIDQ646519zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 2243357
• Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities
• Possibilistic conditional preference networks
• Representing and Reasoning with Qualitative Preferences: Tools and Applications
• Conditional preference nets and possibilistic logic

Cites work

• scientific article; zbMATH DE number 1852917 (Why is no real title available?)
• scientific article; zbMATH DE number 2243357 (Why is no real title available?)
• Everything else being equal: a modal logic for ceteris paribus preferences
• Graphically structured value-function compilation
• Hard and soft constraints for reasoning about qualitative conditional preferences
• Lexicographically-ordered constraint satisfaction problems
• Logical preference representation and combinatorial vote
• On graphical modeling of preference and importance
• Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities
• The computational complexity of dominance and consistency in CP-nets
• The logic of preference reconsidered
• The structure of values and norms
• What is ceteris paribus preference?

Cited in

(13)

• Hard and soft constraints for reasoning about qualitative conditional preferences
• Possibilistic preference networks
• Computing simple mechanisms: Lift-and-round over marginal reduced forms
• Incremental evaluation of continuous preference queries
• Modeling ceteris paribus preferences in formal concept analysis
• Revisiting conditional preferences: from defaults to graphical representations
• The computational complexity of dominance and consistency in CP-nets
• Conditional lexicographic orders in constraint satisfaction problems
• A behavioral choice model when computational ability matters
• Explaining robust additive utility models by sequences of preference swaps
• Expressive efficiency of two kinds of specific CP-nets
• Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics
• An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages

Describes a project that uses

Uses Software

• CP-nets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646519)