Computing Utility from Weighted Description Logic Preference Formulas

Declarative Agent Languages and Technologies VII - -2009

Authors

Ragone Azzurra, Di Noia Tommaso, Di Sciascio Eugenio, Donini Francesco M., Wellman Michael

Abstract

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.

Download: Ragone_et_al_DALT_2009.pdf

DOI

https://doi.org/10.1007/978-3-642-11355-0_10

BibTex references

@InCollection{RDDDW09,
  author       = "Ragone, Azzurra and Di Noia, Tommaso and Di Sciascio, Eugenio and Donini, Francesco M. and Wellman, Michael",
  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          = "http://sisinflab.poliba.it/Publications/2009/RDDDW09"

}