Handling Qualitative Preferences Using Normal Form Functions

Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented. This logic adds to classical propositional logic a new connective, called ordered disjunction symbolized by ×. That new connective is used to express preferences between alternatives. QCL was not designed to handle conditional preferences, even if it is possible to express an implication with a preference on the left hand side, for instance “(Air France × Virgin) ⇒ Hotel Package”. However, using QCL semantics, there is no difference between such material implication “(Virgin × Air France) ⇒ Hotel Package” and the purely propositional formula “(Air France ∨ Virgin) ⇒ Hotel Package ”. Indeed, the negation in QCL gets rid of nested ordered disjunctions. Furthermore, the negation in QCL misses some desirable properties from propositional calculus. In this paper, we present a new semantics...

• Type: Conference
• Year: 2007
• Where: FLAIRS
• Authors: Salem Benferhat, Daniel Le Berre, Karima Sedki
• Keywords: Air France, Artificial Intelligence, FLAIRS 2007, Hotel Package, Propositional