Characterising simple negotiation as distributed agent-based theorem-proving-a preliminary report
Author:
- 7 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 24, 127-134
Abstract
Negotiation is a key technique for dynamically organising activity in multi-agent systems, yet the negotiation process itself can often be difficult to reason about. We introduce a framework in which negotiation can be characterised as a form of distributed, multi-agent theorem-proving. Thus, in this preliminary analysis, we show that certain simple forms of negotiation will be successful if, and only if a corresponding theorem can be proved by agents acting as theorem-proving components. We extend this approach further to represent situations where the agent has a choice of possible responses, given a proposal received. In such cases, an ordering strategy is used to select the order in which replies are provided; this corresponds to a common use of ordering within classical theorem-proving.Keywords
This publication has 7 references indexed in Scilit:
- Representing Abstract Agent Architectures1999
- Ordered chaining calculi for first-order theories of transitive relationsJournal of the ACM, 1998
- Reaching agreements through argumentation: a logical model and implementationArtificial Intelligence, 1998
- Agents that reason and negotiate by arguingJournal of Logic and Computation, 1998
- Distributed problem-solving as concurrent theorem provingLecture Notes in Computer Science, 1997
- THE CLAUSE-DIFFUSION METHODOLOGY FOR DISTRIBUTED DEDUCTIONFundamenta Informaticae, 1995
- Actors1986