Skip to main content

Massively parallel Assumption-based Truth Maintenance

  • Truth Maintenance Systems
  • Conference paper
  • First Online:
Non-Monotonic Reasoning (NMR 1988)

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

Included in the following conference series:

Abstract

De Kleer's Assumption-based Truth Maintenance System (ATMS) is a propositional inference engine designed to simplify the construction of problem solvers that search complex search spaces efficiently. The ATMS has become a key component of many problem solvers, and often the primary consumer of computational resources. Although considerable effort has gone into designing and optimizing the Lisp implementation, it now appears to be approaching the performance limitations of serial architectures. In this paper we show how the combination of a conventional serial machine and a massively parallel processor can dramatically speed up the ATMS algorithms, providing a very powerful general purpose architecture for problem solving.

Supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC) and by a grant from the System Development Foundation.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cook, S., The Complexity of Theorem Proving Procedures. Proceedings of the Third Annual ACM Symposium on Theory of Computing, 1971.

    Google Scholar 

  2. D'Ambrosio, B., A Hybrid Approach to Uncertainty. International Journal of Approximate Reasoning, to appear.

    Google Scholar 

  3. de Kleer, J., An Assumption-based TMS. Artificial Intelligence 28 127–162, 1986.

    Google Scholar 

  4. de Kleer, J., Extending the ATMS. Artificial Intelligence 28 163–196, 1986.

    Google Scholar 

  5. Forbus, K. D., The Qualitative Process Engine. University of Illinois Technical Report UIUCDCS-R-86-1288, 1986.

    Google Scholar 

  6. Hillis, W. Daniel, The Connection Machine. MIT Press, Cambridge, Massachusetts, 1985

    Google Scholar 

  7. Morris, P. H., and Nado, R. A., Representing Actions with an Assumption-based Truth Maintenance System. Proceedings of the National Conference on Artificial Intelligence, Seattle, July 1987.

    Google Scholar 

  8. Stanfill, C., Personal communication.

    Google Scholar 

  9. Zabih, R., and McAllester, D., A Rearrangement Search Strategy for Determining Propositional Satisfiability. Proceedings of the National Conference on Artificial Intelligence, St. Paul, August 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

M. Reinfrank J. de Kleer M. L. Ginsberg E. Sandewall

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dixon, M., de Kleer, J. (1988). Massively parallel Assumption-based Truth Maintenance. In: Reinfrank, M., de Kleer, J., Ginsberg, M.L., Sandewall, E. (eds) Non-Monotonic Reasoning. NMR 1988. Lecture Notes in Computer Science, vol 346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50701-9_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-50701-9_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50701-7

  • Online ISBN: 978-3-540-46073-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics