<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet href="client.xsl" type="text/xsl"?>
<article article-type="other">
<front>
<journal-meta>
<journal-id/>
<issn/>
<banner>
<!--<href>banner.jpg</href>-->
<size width="100%"/>
</banner>
</journal-meta>
<article-meta>
<title-group>
<article-title>Negotiation by Abduction and Relaxation</article-title>
</title-group>

<author><a href="mailto:sakama@sys.wakayama-u.ac.jp"><name>Chiaki Sakama</name></a></author>
<aff>Dept. Computer and Communication Sciences<br/> Wakayama University Sakaedani, Wakayama 640 8510, Japan</aff>

<author><a href="mailto:ki@nii.ac.jp"><name>Katsumi Inoue</name></a></author>
<aff>National Institute of Informatics <br/>2-1-2 Hitotsubashi, Chiyoda-ku Tokyo 101 8430, Japan</aff>
</article-meta></front>
<body>
<abstract>
<title>ABSTRACT</title>
<p>This paper studies a logical framework for automated negotiation between two agents. We suppose an agent who has
a knowledge base represented by a logic program. Then,
we introduce methods of constructing counter-proposals in
response to proposals made by an agent. To this end, we
combine the techniques of <italic>extended abduction</italic> in artificial intelligence and <italic>relaxation</italic> in cooperative query answering
for databases. These techniques are respectively used for
producing <italic>conditional proposals</italic> and <italic>neighborhood proposals</italic>
in the process of negotiation. We provide a negotiation protocol based on the exchange of these proposals and develop
procedures for computing new proposals.</p>
</abstract>
<fpdf>
<href>pdflogo.jpg</href>
<hpdf>AAMAS07_0120_1a85fe73bbb347ad4322c090c6f713dc</hpdf>
</fpdf>
</body>
</article>

