Distributed problem-solving as concurrent theorem proving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1237, Issue , 1997, Pages 128-140

  Fisher, Michael ^a   Wooldridge, Michael ^b  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

^b Agents Systems Group   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTONOMOUS AGENTS; COMPUTATION THEORY; PROBLEM SOLVING; THEOREM PROVING;

AGENT BASED; AGENT-BASED APPROACH; DISTRIBUTED PROBLEM SOLVING; MODEL OF COMPUTATION; MULTI AGENT PLANNING SYSTEMS; MULTI-AGENT PROGRAMMING; PLANNING SYSTEMS; RELATED WORKS;

MULTI AGENT SYSTEMS;

EID: 84958777179     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63077-5_30     Document Type: Conference Paper

References (19)

1. J. Allen, J. Hendler & A. Tate (eds). Readings in Planning. California: Morgan Kaufmann, 1990.
2. H. Barringer, M. Fisher, D. Gabbay, G. Gough, & R. Owens. MetateM: An Introduction. Formal Aspects of Computing, 7(5):533-549, 1995.
3. K. Birman. The Process Group Approach to Reliable Distributed Computing. TR91-1216, Dept. of Computer Science, Cornell University, 1991.
4. M. Bonacina & J. Hsiang. The Clause-Diffusion Methodology for Distributed Deduction. Fundamenta Informaticae, 24:177-207', 1995.
5. A. H. Bond & L. Gasser (eds). Readings in Distributed Artificial Intelligence. Morgan-Kaufmann, 1988.
6. J. Denzinger. Knowledge-Based Distributed Search using Teamwork. In Proceedings of the First International Conference on Multi-Agent Systems (ICMAS), San Francisco, USA, 1995.
7. R. Englemore & T. Morgan (eds) Blackboard Systems. Addison-Wesley, 1988.
8. 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).
9. M. Fisher. A Survey of Concurrent METATEM — The Language and its Applications. In First International Conference on Temporal Logic (ICTL), Bonn, Germany, 1994. (Published in Lecture Notes in Computer Science, vol. 827, Springer-Verlag).
10. M. Fisher. An Alternative Approach to Concurrent Theorem-Proving. In J. Geller, H. Kitano and C. Suttner (eds), Parallel Processing for Artificial Intelligence, 3, Elsevier B.V., 1997.
11. M. Genesereth and N. Nilsson. Logical Foundations of Artificial Intelligence. California: Morgan Kaufmann, 1987.
12. C. Green. Application of Theorem Proving to Problem Solving. In Proceedings of International Joint Conference on AI, 1969. (Also in B. Webber and N. Nilsson (eds), Readings in Artificial Intelligence. Morgan Kaufmann, 1981.)
13. F. Kurfeb. Parallelism in Logic. Vieweg, 1991.
14. V. Lifschitz. On the Semantics of STRIPS. In Reasoning About Actions & Plans, Morgan Kaufmann Publishers: San Mateo, CA, 1986.
15. D. Macintosh, S. Conry, & R. Meyer. Distributed Automated Reasoning: Issues in Coordination, Cooperation, and Performance. IEEE Transactions on Systems, Man and Cybernetics, 21(6):1307-1316, 1991.
16. T. Maruichi, M. Ichikawa, and M. Tokoro. Modelling Autonomous Agents and their Groups. In Y. Demazeau and J. P. Muller, editors, Decentralized AI 2 - Proceedings of the 2nd European Workshop on Modelling Autonomous Agents and Multi-Agent Worlds (MAA-MAW '90). Elsevier/North Holland, 1991.
17. D. A. Plaisted and S. A. Greenbaum. A Structure-Preserving Clause Form Translation. Journal of Symbolic Computation, 2(3):293-304, September 1986.
18. R. Smith & R. Davis. Frameworks for Cooperation in Distributed Problem Solving. IEEE Transactions on Systems, Man and Cybernetics, 1 l(l):61-70, 1981.
19. M. Wooldridge & N. Jennings. Intelligent agents: Theory and practice. The Knowledge Engineering Review, 10(2): 115-152, 1995.