Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities

DOI10.1007/978-3-540-75256-1_58zbMATH Open1148.68521OpenAlexW1832871424MaRDI QIDQ3524976FDOQ3524976

Henri Prade, Souhila Kaci

Publication date: 16 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75256-1_58

Recommendations

• Conditional preference nets and possibilistic logic
• scientific article; zbMATH DE number 2243357
• CP-nets, \( \pi \)-pref nets, and Pareto dominance
• Possibilistic preference networks
• Expressivity of possibilistic preference networks with constraints

zbMATH Keywords

partial orderconditional preferencespriorityreasoning about preferenceslogical representation

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic in artificial intelligence (68T27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logical preference representation and combinatorial vote
• Hard and soft constraints for reasoning about qualitative conditional preferences
• Reasoning with partially ordered information in a possibilistic logic framework

Cited In (5)

• Database preference queries -- a possibilistic logic approach with symbolic priorities
• On graphical modeling of preference and importance
• Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities
• Title not available (Why is that?)
• Computational techniques for a simple theory of conditional preferences

Uses Software

• CP-nets

This page was built for publication: Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities

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