Computing Utility from Weighted Description Logic Preference Formulas

Declarative Agent Languages and Technologies VII, springer-verlag - 2009
Download the publication : Ragone_et_al_DALT_2009.pdf [204Ko]  
We propose a framework to compute the utility of a proposal \wrt 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. Specifically, we refer to expressive Description Logics (DL) endowed with disjunction. 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.

BibTex references

author = {Azzurra Ragone and Tommaso {Di Noia} and Eugenio {Di Sciascio} and Francesco M. Donini and Michael Wellman},
title = "Computing Utility from Weighted Description Logic
Preference Formulas",
booktitle = "Declarative Agent Languages and Technologies VII",
series = "Lecture Notes in Computer Science",
year = "2009",
publisher = "springer-verlag",
url = "

Other publications in the database

SisInf Lab - Information Systems Laboratory

Research group of Politecnico di Bari
Edoardo Orabona St, 4 Bari, Italy