Advertisement

Massively parallel Assumption-based Truth Maintenance

  • Michael Dixon
  • Johan de Kleer
Truth Maintenance Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 346)

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.

Keywords

Problem Solver Parallel Processor Host Machine Serial Implementation Active Processor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Cook, S., The Complexity of Theorem Proving Procedures. Proceedings of the Third Annual ACM Symposium on Theory of Computing, 1971.Google Scholar
  2. [2]
    D'Ambrosio, B., A Hybrid Approach to Uncertainty. International Journal of Approximate Reasoning, to appear.Google Scholar
  3. [3]
    de Kleer, J., An Assumption-based TMS. Artificial Intelligence 28 127–162, 1986.Google Scholar
  4. [4]
    de Kleer, J., Extending the ATMS. Artificial Intelligence 28 163–196, 1986.Google Scholar
  5. [5]
    Forbus, K. D., The Qualitative Process Engine. University of Illinois Technical Report UIUCDCS-R-86-1288, 1986.Google Scholar
  6. [6]
    Hillis, W. Daniel, The Connection Machine. MIT Press, Cambridge, Massachusetts, 1985Google Scholar
  7. [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. [8]
    Stanfill, C., Personal communication.Google Scholar
  9. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Michael Dixon
    • 1
    • 2
  • Johan de Kleer
    • 1
  1. 1.Xerox PARCPalo Alto
  2. 2.Computer Science Dept.Stanford UniversityPalo Alto

Personalised recommendations