Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities

DOI10.1007/978-3-540-75256-1_58zbMath1148.68521OpenAlexW1832871424MaRDI QIDQ3524976

Souhila Kaci, Henri Prade

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

zbMATH Keywords

partial orderpriorityconditional preferencesreasoning about preferenceslogical representation

Mathematics Subject Classification ID

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

Related Items (3)

Database preference queries -- a possibilistic logic approach with symbolic priorities ⋮ Computational techniques for a simple theory of conditional preferences ⋮ Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities

Uses Software

• CP-nets

Cites Work

• Reasoning with partially ordered information in a possibilistic logic framework
• Logical preference representation and combinatorial vote
• Hard and soft constraints for reasoning about qualitative conditional preferences
• Unnamed Item
• Unnamed Item
• Unnamed Item

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