Skip to main content

Parallel cost-based abductive reasoning for distributed memory systems

  • Qualitative Reasoning
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1114))

Abstract

This paper describes efficient parallel first-order cost-based abductive reasoning for distributed memory systems. A search control technique of parallel best-first search is introduced into abductive reasoning mechanism, thereby finding much more efficiently a minimal-cost explanation of a given observation. We propose a PARallel Cost-based Abductive Reasoning system, PARCAR, and give an informal analysis of PARCAR. We also implement PARCAR on an MIMD distributed memory parallel computer, Fujitsu AP1000, and show some performance results.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Khayri A. M. Ali and Roland Karlsson. The Muse Or-Parallel Prolog Model and its Performance. In Proc. of the North American Conf. on Logic Programming, pages 757–776. The MIT Press, 1990.

    Google Scholar 

  2. E. Charniak and S. E. Shimony. Cost-based abduction and MAP explanation. Artificial Intelligence, 66:345–374, 1994.

    Google Scholar 

  3. Vitor S. Costa, David H. D. Warren, and Rong Yang. The Andorra-I Engine: A Parallel Implementation of the Basic Andorra Model. In Proc. of the Eighth Intl. Conf. on Logic Programming, pages 825–839. The MIT Press, 1991.

    Google Scholar 

  4. S. Huang and L. S. Davis. Parallel Iterative A * Search: An Admissible Distributed Heuristic Search Algorithm. In Proc. of the IJCAI-89, pages 23–29, 1989.

    Google Scholar 

  5. S. Kato, H. Seki, and H. Itoh. An Efficient Abductive Reasoning System Based on Program Analysis. In Static Analysis, Proc. of the 3rd Intl. Workshop, LNCS-724, pages 230–241, Padova, 1993. Springer-Verlag.

    Google Scholar 

  6. S. Kato, H. Seki, and H. Itoh. Cost-based Horn Abduction and its Optimal Search. In Proc. of the 3rd Intl. Conf. on Automation, Robotics and Computer Vision, pages 831–835, Singapore, November 1994.

    Google Scholar 

  7. J. W. Lloyd. Foundations of Logic Programming. Springer, 1984. Second, extended edition, 1987.

    Google Scholar 

  8. E. Lusk, David H. D. Warren, S. Haridi, et al. The Aurora or-parallel Prolog system. New Generation Computing, 7(2,3):243–271, 1990.

    Google Scholar 

  9. N. J. Nilsson. Principles of Artificial Intelligence. Tioga, Palo Alto, CA, 1980.

    Google Scholar 

  10. D. Poole. A Logical Framework for Default Reasoning. Artificial Intelligence, 36:27–47, 1988.

    Google Scholar 

  11. D. Poole. Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence, 64:81–129, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Norman Foo Randy Goebel

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kato, S., Seki, H., Itoh, H. (1996). Parallel cost-based abductive reasoning for distributed memory systems. In: Foo, N., Goebel, R. (eds) PRICAI'96: Topics in Artificial Intelligence. PRICAI 1996. Lecture Notes in Computer Science, vol 1114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61532-6_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-61532-6_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61532-3

  • Online ISBN: 978-3-540-68729-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics