Abstract
We propose a framework to compute the utility of an agreement 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 and agreements expressed as a formula. We ground our framework in Description Logics (DL) endowed with disjunction, to be compliant with Semantic Web technologies. A logic based approach to preference representation allows, when a background knowledge base is exploited, 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 validate our approach through an experimental evaluation.
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
Keeney, R.L., Raiffa, H.: Decisions with Multiple Objectives: Preferences and Value Tradeoffs. John Wiley & Sons, Chichester (1976)
Gonzales, C., Perny, P.: GAI networks for utility elicitation. In: KR, pp. 224–234 (2004)
Bacchus, F., Grove, A.: Graphical models for preference and utility. In: UAI, pp. 3–10 (1995)
Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: A tool for representing and reasoning about conditional ceteris paribus preference statements. JAIR 21, 135–191 (2004)
Engel, Y., Wellman, M.P.: CUI networks: A graphical representation for conditional utility independence. JAIR 31, 83–112 (2008)
Ragone, A., Di Noia, T., Di Sciascio, E., Donini, F.M., Wellman, M.: Computing utility from weighted description logic preference formulas. In: Declarative Agent Languages and Technologies VII Workshop Notes (2009), http://www.di.unito.it/~baldoni/DALT-2009/DALT-WorkshopNotes.pdf
Pinkas, G.: Propositional non-monotonic reasoning and inconsistency in symmetric neural networks. In: IJCAI, pp. 525–531 (1991)
Lafage, C., Lang, J.: Logical representation of preferences for group decision making. In: KR, pp. 457–468 (2000)
Chevaleyre, Y., Endriss, U., Lang, J.: Expressive power of weighted propositional formulas for cardinal preference modelling. In: KR, pp. 145–152 (2006)
Ragone, A., Di Noia, T., Di Sciascio, E., Donini, F.: A logic-based framework to compute Pareto agreements in one-shot bilateral negotiation. In: ECAI, pp. 230–234 (2006)
Ragone, A., Di Noia, T., Di Sciascio, E., Donini, F.M.: Description logics for multi-issue bilateral negotiation with incomplete information. In: AAAI, pp. 477–482 (2007)
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook. Cambridge Univ. Press, Cambridge (2002)
Cadoli, M., Donini, F.M.: A survey on knowledge compilation. AI Comm 10(3-4), 137–150 (1997)
Marquis, P., Sadaoui, S.: A new algorithm for computing theory prime implicates compilations. In: AAAI, pp. 504–509 (1996)
Bienvenu, M.: Prime implicate normal form for \(\mathcal{ALC}\) concepts. In: AAAI, pp. 412–417 (2008)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs (1982)
Ngair, T.-H.: A new algorithm for incremental prime implicate generation. In: IJCAI, pp. 46–51 (1993)
Dechter, R., Rish, I.: Directional resolution: The Davis-Putnam procedure, revisited. In: KR, pp. 134–145 (1994)
Fishburn, P.C.: Interdependence and additivity in multivariate, unidimensional expected utility theory. International Economic Review 8, 335–342 (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ragone, A., Di Noia, T., Donini, F.M., Di Sciascio, E., Wellman, M.P. (2009). Weighted Description Logics Preference Formulas for Multiattribute Negotiation. In: Godo, L., Pugliese, A. (eds) Scalable Uncertainty Management. SUM 2009. Lecture Notes in Computer Science(), vol 5785. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04388-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-04388-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04387-1
Online ISBN: 978-3-642-04388-8
eBook Packages: Computer ScienceComputer Science (R0)