Negotiation Using Logic Programming with Consistency Restoring Rules
Abstract
We formalize negotiations using logic programming with consistency restoring rules (or CRProlog) [Balduccini and Gelfond, 2003]. Our formulation deals with incomplete information, preferences, and changing goals. We assume that each agent is equipped with a knowledge base for negotiation which consists of a CR-program, a set of possible assumptions, and a set of ordered goals. We use the notion of an answer set as a means to formalize the basic notions of negotiation such as proposal, response, negotiation, negotiation tree (protocol), etc. and discuss their properties. Tran Cao Son, Chiaki Sakama
Cite
Text
Son and Sakama. "Negotiation Using Logic Programming with Consistency Restoring Rules." International Joint Conference on Artificial Intelligence, 2009.Markdown
[Son and Sakama. "Negotiation Using Logic Programming with Consistency Restoring Rules." International Joint Conference on Artificial Intelligence, 2009.](https://mlanthology.org/ijcai/2009/son2009ijcai-negotiation/)BibTeX
@inproceedings{son2009ijcai-negotiation,
title = {{Negotiation Using Logic Programming with Consistency Restoring Rules}},
author = {Son, Tran Cao and Sakama, Chiaki},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2009},
pages = {930-935},
url = {https://mlanthology.org/ijcai/2009/son2009ijcai-negotiation/}
}