Abstract
Qualitative Choice Logic (QCL) is a convenient tool for representing and reasoning with “basic” preferences. However, this logic presents some limitations when dealing with complex preferences that, for instance, involve negated preferences. This paper proposes a new logic that correctly addresses QCL’s limitations. It is particularly appropriate for handling prioritized preferences, which is very useful for aggregating preferences of users having different priority levels. Moreover, we show that any set of preferences, can equivalently be transformed into a set of normal form preferences from which efficient inferences can be applied.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brewka, G., Benferhat, S., Le Berre, D.: Qualitative choice logic. Artif. Intell. 157(1-2), 203–237 (2004)
Brewka, G.: Logic Programming with Ordered Disjunction. In: Proc. AAAI 2002, Edmonton, canada, pp. 100–105 (2002)
Brewka, G., Eiter, T.: Preferred answer sets for extended logic programs. Artif. Intell. 109(1-2), 297–356 (1999)
Benferhat, S., Le Berre, D., Sedki, K.: An Alternative Inference for QualitativeChoice Logic. In: Proc, ECAI 2006, pp. 743–744 (2006)
Minker, J.: Logic-based Artificial Intelligence. Kluwer Academics Publisher, Boston (2000)
Boutilier, C., Brafman, R.I., Hoos, H.H., Poole, D.: Reasoning with conditionalceteris paribus preference statements. In: Proc. UAI 1999, Stockhilm, Sweden, pp. 71–80 (1999)
Boutilier, C.: Towards a Logic for Qualitative Decision Theory. In: Proc. KR 1994, pp. 75–86 (1994)
Domshlak, C., Brafman, R.I.: CP-nets - Reasoning and Consistency Testing. In: Proceedings of KR 2002, pp. 121–132. Morgan Kaufmann, San Francisco (2002)
Lang, J., Der Torre, V., Weydert, E.: Utilitarian Desires. Autonomous Agents and Multi-Agent Systems 5(3), 329–363 (2002)
Dubois, D., Lang, J., Prade, H.: Possibilistic Logic. Handbook of Logic in ArtificialIntelligence and Logic Programming 3, 439–513 (1994)
Wellman, M.P., Doyle, J.: Preferential semantics for goals. In: Proceedings of National Conference on artificial Intelligence, Anaheim, pp. 698–703 (1991)
Tan, S.W., Pearl, J.: Qualitative Decision Theory. In: Proc. AAAI 1994, Seattle, pp. 928–933 (1994)
Tan, S.W., Pearl, J.: Specification and evaluation of preferences under uncertainty. In: KR 1999, bonn, pp. 530–539 (1994)
Delgrande, J.P., Schaub, T., Tompits, H.: Logic programs with compiled preferences. In: Procedings of the European Conference an Artificial Intelligence, pp. 464–468 (2000)
Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsensereasoning. Artif. Intell. 123, 185–222 (2000)
Marquis, S.C., Marquis, P.: On Stratified Belief Base Compilation. Annals of Mathematicsand Artificial Intelligence 42(4), 399–442 (2004)
Wright, V.: The Logic of Preference. Edinburgh University Press, Edinburgh (1963)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benferhat, S., Sedki, K. (2007). A Revised Qualitative Choice Logic for Handling Prioritized Preferences. In: Mellouli, K. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2007. Lecture Notes in Computer Science(), vol 4724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75256-1_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-75256-1_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75255-4
Online ISBN: 978-3-540-75256-1
eBook Packages: Computer ScienceComputer Science (R0)