Towards a Possibilistic Logic Handling of Preferences

作者: Salem Benferhat , Didier Dubois , Henri Prade

DOI: 10.1023/A:1011298804831

关键词: Set (psychology)Data miningTheoretical computer scienceComputer sciencePreference (economics)Possibility theoryDecision theoryValue (mathematics)Function (engineering)Expression (mathematics)

摘要: The classical way of encoding preferences in decision theory is by means utility or value functions. However agents are not always able to deliver such a function directly. In this paper, we relate three different ways specifying preferences, namely set particular types constraints on the function, an ordered prioritized goals expressed logical propositions, and subsets possible choices reaching same level satisfaction. These expression modes can be handled weighted setting, here one possibilistic logic. aggregation pertaining criteria then fusing sets goals. Apart from better expressivity, benefits representation put them suitable format for reasoning purposes, modifying them.

参考文章(30)
Régis Sabbadin, Daniel Le Berre, Henri Prade, Didier Dubois, Logical representation and computation of optimal decisions in a qualitative setting national conference on artificial intelligence. pp. 588- 593 ,(1998)
Henri Prade, Jerome Lang, Didier Dubois, Theorem proving under uncertainty: a possibility theory-based approach international joint conference on artificial intelligence. pp. 984- 986 ,(1987)
Michel Grabisch, Hung T Nguyen, Elbert A Walker, Fundamentals of Uncertainty Calculi with Applications to Fuzzy Inference ,(1994)
M. Lacroix, Pierre Lavency, Preferences; Putting More Knowledge into Queries very large data bases. pp. 217- 225 ,(1987)
Craig Boutilier, Toward a Logic for Qualitative Decision Theory principles of knowledge representation and reasoning. pp. 75- 86 ,(1994) , 10.1016/B978-1-4832-1452-8.50104-4
Thomas Schiex, Possibilistic constraint satisfaction problems or How to handle soft constraints uncertainty in artificial intelligence. pp. 268- 275 ,(1992) , 10.1016/B978-1-4832-8287-9.50041-4
Jérôome Lang, Possibilistic logic as a logical framework for min-max discrete optimisation problems and prioritized constraints FAIR '91 Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research. pp. 112- 126 ,(1991) , 10.1007/3-540-54507-7_10
Leendert Van Der Torre, Emil Weydert, Parameters for Utilitarian Desires in a Qualitative Decision Theory Applied Intelligence. ,vol. 14, pp. 285- 301 ,(2001) , 10.1023/A:1011246803923
Holger H. Hoos, Ronen I. Brafman, Craig Boutilier, David Poole, Reasoning with conditional ceteris paribus preference statements uncertainty in artificial intelligence. pp. 71- 80 ,(1999)
Salem Benferhat, Didier Dubois, Henri Prade, Practical Handling of Exception-Tainted Rules and Independence Information in Possibilistic Logic Applied Intelligence. ,vol. 9, pp. 101- 127 ,(1998) , 10.1023/A:1008259801924