Negotiation Using Logic Programming with Consistency Restoring Rules
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 930-934.
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
@inproceedings{ijcai2009p158,
title = {Negotiation Using Logic Programming with Consistency Restoring Rules},
author = {Son, Tran Cao and Sakama, Chiaki},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {930--934},
year = {2009},
url = {https://ijcai.org/proceedings/2009/158},
}
TY - CPAPER TI - Negotiation Using Logic Programming with Consistency Restoring Rules AU - Son, Tran Cao AU - Sakama, Chiaki T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 930 EP - 934 UR - https://ijcai.org/proceedings/2009/158 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
