Characterising simple negotiation as distributed agent-based theorem-proving - A preliminary report

Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000

Volumn , Issue , 2000, Pages 127-134

  Fisher, M ^a  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

THEOREM PROVING;

CLASSICAL THEOREMS; DISTRIBUTED AGENTS; MULTI AGENT; NEGOTIATION PROCESS; ORDERING STRATEGY; PRELIMINARY ANALYSIS;

MULTI AGENT SYSTEMS;

EID: 84962091524     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMAS.2000.858444     Document Type: Conference Paper

References (15)

1. G. Agha. Actors - A Model for Concurrent Computation in Distributed Systems. MIT Press, 1986.
2. L. Bachmair and H. Ganzinger. Ordered chaining calculi for first-order theories of transitive relations. Journal of the ACM, 45(6):1007-1049, 1998.
3. M. Bonacina & J. Hsiang. The Clause-Diffusion Methodology for Distributed Deduction. Fundamenta Informaticae, 24:177-207, 1995.
4. J. Denzinger. Knowledge-based distributed search using teamwork. In Proceedings of the International Conference on Multi-Agent Systems, 1995.
5. Agent-Based Theorem Proving in Java. Final Year Undergraduate group project, Department of Computing and Mathematics, Manchester Metropolitan University, UK, 2000.
6. M. Fisher. Concurrent METATEM - A Language for Modeling Reactive Systems. In Parallel Architectures and Languages, Europe (PARLE), Munich, Germany, June 1993. (Published in Lecture Notes in Computer Science, volume 694, Springer-Verlag).
7. M. Fisher. An Open Approach to Concurrent Theorem-Proving. In J. Geller, H. Kitano, and C. Suttner, editors, Parallel Processing for Artificial Intelligence, volume 3. Elsevier/North-Holland, 1997.
8. M. Fisher. Representing abstract agent architectures. In J. P. Müller, M. P. Singh, and A. S. Rao, editors, Intelligent Agents V - Proceedings of the Fifth International Workshop on Agent Theories, Architectures, and Languages (ATAL-98), Lecture Notes in Artificial Intelligence. Springer-Verlag, Heidelberg, 1999.
9. M. Fisher and M. Wooldridge. Distributed Problem Solving as Concurrent Theorem-Proving. In Multi-Agent Rationality. Springer-Verlag, 1997. (Lecture Notes in Artificial Intelligence, volume 1237).
10. H. Kampmann. Implementing Multi-Agent Theorem-Proving. MSc Thesis, Department of Computing and Mathematics, Manchester Metropolitan University, 1998.
11. S. Kraus, M. Nirkhe, and K. Sycara. Reaching agreements through argumentation: A logical model. In Proceedings of the Twelfth International Workshop on Distributed Artificial Intelligence (IWDAI-93), pages 233-247, Hidden Valley, PA, May 1993.
12. S. Kraus, K. Sycara and A. Evenchik. Reaching agreements through argumentation: A logical model and implementation. Artificial Intelligence 104(1/2):1-69, 1998.
13. S. Parsons and N. R. Jennings. Negotiation through argumentation - a preliminary report. In Proceedings of the International Conference on Multi Agent Systems, pages 267-274, 1996.
14. S. Parsons, C. Sierra, and N. R. Jennings. Agents that reason and negotiate by arguing. Journal of Logic and Computation, 8(3):261-292, 1998.
15. J. Rosenschein and G. Zlotkin. Rules of Encounter: Designing Conventions for Automated Negotiation among Computers MIT Press, 1994.