Abstract
Our principal aim in this paper is to demonstrate that distributed problem solving may fruitfully be viewed as concurrent theorem proving. We begin by introducing a novel agent-based approach to concurrent theorem proving, and then describe Concurrent MetateM, a multi-agent programming language whose model of computation is closely related to that used within the theorem proving approach. An extended case study is then presented, wherein we demonstrate how a multi-agent planning system can be implemented within the agent-based theorem proving framework. We then show how extensions and refinements of the planning system can easily be accommodated within this framework. We conclude with a detailed discussion of related work, from both the multi-agent systems community and the (concurrent) theorem proving community.
This work was partially supported by EPSRC under grant GR/J48979.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Allen, J. Hendler & A. Tate (eds). Readings in Planning. California: Morgan Kaufmann, 1990.
H. Barringer, M. Fisher, D. Gabbay, G. Gough, & R. Owens. Metatem: An Introduction. Formal Aspects of Computing, 7(5):533–549, 1995.
K. Birman. The Process Group Approach to Reliable Distributed Computing. TR91-1216, Dept. of Computer Science, Cornell University, 1991.
M. Bonacina & J. Hsiang. The Clause-Diffusion Methodology for Distributed Deduction. Fundamenta Informaticae, 24:177–207, 1995.
A. H. Bond & L. Gasser (eds). Readings in Distributed Artificial Intelligence. Morgan-Kaufmann, 1988.
J. Denzinger. Knowledge-Based Distributed Search using Teamwork. In Proceedings of the First International Conference on Multi-Agent Systems (ICMAS), San Francisco, USA, 1995.
R. Englemore & T. Morgan (eds) Blackboard Systems. Addison-Wesley, 1988.
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).
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).
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.
M. Genesereth and N. Nilsson. Logical Foundations of Artificial Intelligence. California: Morgan Kaufmann, 1987.
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.)
F. Kurfe\. Parallelism in Logic. Vieweg, 1991.
V. Lifschitz. On the Semantics of STRIPS. In Reasoning About Actions & Plans, Morgan Kaufmann Publishers: San Mateo, CA, 1986.
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.
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.
D. A. Plaisted and S. A. Greenbaum. A Structure-Preserving Clause Form Translation. Journal of Symbolic Computation, 2(3):293–304, September 1986.
R. Smith & R. Davis. Frameworks for Cooperation in Distributed Problem Solving. IEEE Transactions on Systems, Man and Cybernetics, 11(1):61–70, 1981.
M. Wooldridge & N. Jennings. Intelligent agents: Theory and practice. The Knowledge Engineering Review, 10(2):115–152, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fisher, M., Wooldridge, M. (1997). Distributed problem-solving as concurrent theorem proving. In: Boman, M., Van de Velde, W. (eds) Multi-Agent Rationality. MAAMAW 1997. Lecture Notes in Computer Science, vol 1237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63077-5_30
Download citation
DOI: https://doi.org/10.1007/3-540-63077-5_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63077-7
Online ISBN: 978-3-540-69125-9
eBook Packages: Springer Book Archive