Computational techniques for a simple theory of conditional preferences

DOI10.1016/J.ARTINT.2010.11.018zbMATH Open1225.68250OpenAlexW1991456128MaRDI QIDQ646519FDOQ646519

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

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

zbMATH Keywords

conditional preferenceslexicographic preferencesconstrained optimisationCP-netsCeteris Paribus preferencescomparative preferencesTCP-nets

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

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

Cited In (13)

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

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)