---
title: "Negotiation Using Logic Programming with Consistency Restoring Rules"
authors:
  - "Tran Cao Son"
  - "Chiaki Sakama"
doi: ""
url: "https://ijcai.org/proceedings/2009/158"
pdf: "https://ijcai.org/proceedings/2009/0158.pdf"
venue: "Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence"
year: 2009
pages: "930-934"
track: ""
keywords:
---

# Negotiation Using Logic Programming with Consistency Restoring Rules

Tran Cao Son, Chiaki Sakama

*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