Negotiation Using Logic Programming With Consistency Restoring Rules

Download Now Free registration required

Executive Summary

The authors formalize negotiations using logic programming with consistency restoring rules (or CR-Prolog) [Balduccini and Gelfond, 2003]. The authors' formulation deals with incomplete information, preferences, and changing goals. They 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. The authors 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.

  • Format: PDF
  • Size: 495.5 KB