Negotiation by induction

ABSTRACT

This paper presents a logical framework for automated negotiation. An agent accepts a proposal if it is proved by its knowledge base. If this is not the case, an agent seeks conditions to accept a proposal or may give up some of its current belief to reach an agreement. These attitudes of agents are characterized using induction and default reasoning.

REFERENCES

• 1: K. Inoue and C. Sakama. Abductive framework for nonmonotonic theory change. In: Proc. IJCAI-95, pp. 204--210, Morgan Kaufmann, 1995.
• 2: A. C. Kakas, R. A. Kowalski, and F. Toni. The role of abduction in logic programming. In: Handbook of Logic in AI and Logic Programming, D. M. Gabbay, et al. (eds), vol. 5, pp. 235--324, Oxford University Press, 1998.
• 3: Answer set programming and plan generation, Artificial Intelligence, v.138 n.1-2, p.39-54, June 2002 [doi>10.1016/S0004-3702(02)00186-8]
• 4: Shan-Hwei Nienhuys-Cheng , Ronald de Wolf , J. Siekmann , J. G. Carbonell, Foundations of Inductive Logic Programming, Springer-Verlag New York, Inc., Secaucus, NJ, 1997
• 5: R. Reiter. A logic for default reasoning. Artificial Intelligence 13:81--132, 1980.
• 6: Chiaki Sakama , Katsumi Inoue, Negotiation by abduction and relaxation, Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, May 14-18, 2007, Honolulu, Hawaii [doi>10.1145/1329125.1329418]
• 7: C. Sakama. Inductive negotiation in answer set programming. Submitted for publication, 2008.

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic

Additional Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
        I.2.11 Distributed Artificial Intelligence

General Terms:
Theory

Keywords:
default logic, induction, negotiation