Computing Utility from Weighted Description Logic Preference Formulas

We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas in a decidable fragment of First Order Logic (FOL). Although here we tailor our approach for Description Logics endowed with disjunction, all the results keep their validity in any decidable fragment of FOL. DLs offer expressivity advantages over propositional representations, and allow us to relax the often unrealistic assumption of additive independence among attributes. We provide suitable definitions of the problem and present algorithms to compute utility in our setting. We also study complexity issues of our approach and demonstrate its usefulness with a running example in a multiattribute negotiation scenario.

[1]  Franz Baader,et al.  KRIS: Knowledge Representation and Inference System , 1991, SGAR.

[2]  U. Endriss,et al.  Expressive Power of Weighted Propositional Formulas for Cardinal Preference Modelling Extended Abstract , 2006 .

[3]  Ralph L. Keeney,et al.  Decisions with multiple objectives: preferences and value tradeoffs , 1976 .

[4]  Franz Baader,et al.  A Scheme for Integrating Concrete Domains into Concept Languages , 1991, IJCAI.

[5]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[6]  Diego Calvanese,et al.  The Description Logic Handbook , 2007 .

[7]  Fahiem Bacchus,et al.  Graphical models for preference and utility , 1995, UAI.

[8]  Francesco M. Donini,et al.  Alternating-Offers Protocol for Multi-issue Bilateral Negotiation in Semantic-Enabled Marketplaces , 2007, ISWC/ASWC.

[9]  R. L. Keeney,et al.  Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[10]  Patrice Perny,et al.  GAI Networks for Utility Elicitation , 2004, KR.

[11]  Jérôme Lang,et al.  Logical representation of preferences for group decision making , 2000, KR.

[12]  Francesco M. Donini,et al.  A Logic-Based Framework to Compute Pareto Agreements in One-Shot Bilateral Negotiation , 2006, ECAI.

[13]  Craig Boutilier,et al.  CP-nets: a tool for represent-ing and reasoning with conditional ceteris paribus state-ments , 2004 .

[14]  Gadi Pinkas,et al.  Propositional Non-Monotonic Reasoning and Inconsistency in Symmetric Neural Networks , 1991, IJCAI.

[15]  Michael P. Wellman,et al.  CUI Networks: A Graphical Representation for Conditional Utility Independence , 2006, AAAI.

[16]  Francesco M. Donini,et al.  Description Logics for Multi-Issue Bilateral Negotiation with Incomplete Information , 2007, AAAI.

[17]  Peter C. Fishburn,et al.  INTERDEPENDENCE AND ADDITIVITY IN MULTIVARIATE, UNIDIMENSIONAL EXPECTED UTILITY TIHEORY* , 1967 .

[18]  Thomas Lukasiewicz,et al.  Variable-Strength Conditional Preferences for Matchmaking in Description Logics , 2006, KR.