Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
KRIS: Knowledge Representation and Inference System
ACM SIGART Bulletin - Special issue on implemented knowledge representation and reasoning systems
The Description Logic Handbook
The Description Logic Handbook
A logic-based framework to compute Pareto agreements in one-shot bilateral negotiation
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Description logics for multi-issue bilateral negotiation with incomplete information
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
CUI networks: a graphical representation for conditional utility independence
Journal of Artificial Intelligence Research
Propositional non-monotonic reasoning and inconsistency in symmetric neural networks
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Alternating-offers protocol for multi-issue bilateral negotiation in semantic-enabled marketplaces
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Graphical models for preference and utility
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Weighted Description Logics Preference Formulas for Multiattribute Negotiation
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Compactly representing utility functions using weighted goals and the max aggregator
Artificial Intelligence
Using sums-of-products for non-standard reasoning
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Semantic matchmaking and ranking: beyond deduction in retrieval scenarios
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
| Hi-index | 0.00 |
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.