Skip to main content
SpringerLink
Log in

Complexity classification of Truth Maintenance systems

  • Complexity I
  • Conference paper
  • First Online:
STACS 91 (STACS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 480))

Included in the following conference series:

Abstract

Truth Maintenance (TM) has been an active area of AI research in recent years. This paper addresses the computational foundations of TM and presents the classification of the computational complexity of the basic existing types of Truth Maintenance Systems (TMS's). Our results include the proof of Σ p2 -completeness of the Clause Maintenance System's computation task. This is the first problem in artificial intelligence proved to be Σ p2 -complete. It is likely to provide a basis for reductions proving Σ p2 -completeness of other problems in logic and AI. As part of the proof we prove the Σ p2 -completeness of the Generalized Node Deletion Problem, one of the first natural graph problems to be complete for any intermediate slot of the polynomial hierarchy. We also prove the equivalence of Boolean Constraint Propagation-based approaches (LTMS's) and the justification-based approaches (JTMS's) to TM.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cook, S.A., "The Complexity of Theorem-Proving Procedures", Proceedings of the 3rd ACM STOC, 1971, 151–158.

    Google Scholar 

  2. Doyle, J., (1979), "A Truth Maintenance System," Artificial Intelligence 12, 231–272.

    Article  Google Scholar 

  3. de Kleer, J., (1986), "An Assumption-based Truth Maintenance System," Artificial Intelligence, 28: 127–162.

    Article  Google Scholar 

  4. de Kleer, J., (1986), "Problem Solving with the ATMS," Artificial Intelligence 28, 197–224

    Article  Google Scholar 

  5. de Kleer, J., (1986), "Extending the ATMS," Artificial Intelligence 28, 163–196.

    Article  Google Scholar 

  6. de Kleer, J., (1988), "A General Labelling Algorithm for ATMS," Proc. 7th AAAI, St.Paul, MN.

    Google Scholar 

  7. de Kleer, J., Doyle, J., Rich C., Steele, G., Sussman, G.J., [1978] "AMORD: a Deductive Procedure System", MIT Artificial Intelligence Lab Memo 435.

    Google Scholar 

  8. Davis, M. and H. Putnam, "A Computing Procedure for Quantification Theory," Journal of ACM 7, 1960, 201–215.

    Article  Google Scholar 

  9. Garey, M. R. and D. S. Johnson, "Computers and Intractability. A Guide to the Theory of NP-Completeness", Freeman, San Francisco, 1979.

    Google Scholar 

  10. Garey, M., D. Johnson, L. J. Stockmeyer. "Some Simplified NP-Complete Graph Problems", Theor. Computer Sci. (1976)

    Google Scholar 

  11. Hastad, J., (1986), "Computational Limitations for Small Depth Circuits," MIT Press.

    Google Scholar 

  12. Karp, R. M. "Reducibility among Combinatorial Problems", in Complexity of Computer Computations, Plenum, New York, 1972, 85–103.

    Google Scholar 

  13. McAllester, D., (1982), "Reasoning Utility Package User's Manual," MIT Artificial Intelligence Lab Memo 667.

    Google Scholar 

  14. McAllester, D., (1985), "A Widely Used Truth Maintenance System," Unpubl.

    Google Scholar 

  15. McAllester, D., (1988), "Ontic: A Knowledge Representation System for Mathematics," MIT Press.

    Google Scholar 

  16. McDermott, D., (1983), "Contexts and Data Dependencies: a Synthesis," IEEE Transactions on Pattern Analysis and Machine Intelligenc, 5(3).

    Google Scholar 

  17. McAllester, D. and McDermott, D. "AAAI 88 Truth Maintenance Systems", tutorial.

    Google Scholar 

  18. Martins, J.P. and Shapiro, S.C. (1983), "Reasoning in Multiple Belief Systems," Proc. 8th IJCAI, Karlsruhe, FRG.

    Google Scholar 

  19. Provan, G., (1987), "Efficiency Analysis of Multiple-Context TMSs in Scene Representation," Proc. 6th AAAI, Seattle, WA.

    Google Scholar 

  20. Rutenburg, V., (1988), "Complexity of Generalized Graph Coloring Problems," Doctoral Thesis, Stanford University, June '88.

    Google Scholar 

  21. Rutenburg, V., (1988), "Computational Complexity of Truth Maintenance," Rockwell International Science Center, Palo Alto, Ca, November 1988.

    Google Scholar 

  22. Reiter, R. and de Kleer, J. (1987), "Foundations of Assumption-based Truth Maintenance Systems," Proc. 6th AAAI, Seattle.

    Google Scholar 

  23. Williams, C., (1984), "ART the Advanced Reasoning Tool — Conceptual Overview," Inference Corp.

    Google Scholar 

  24. Stallman, R. and Sussman, G.J., (1977), "Forward Reasoning and DDB in a System for Computer-Aided Circuit Analysis," Artificial Intelligence 9, 135–196

    Article  Google Scholar 

  25. Stockmeyer, L. J. "Polynomial-time Hierarchy", Theoretical Computer Science 3 (1977), 1–22.

    Article  Google Scholar 

  26. Zabih, R., [1987], "Another Look at Truth Maintenance", unpublished.

    Google Scholar 

  27. Yao, A.C., "Separating the Polynomial-Time Hierarchy by Oracles", Proceedings of the 26th IEEE FOCS, 1985, 1–10.

    Google Scholar 

  28. Yannakakis, M., "Node-and Edge-Deletion NP-complete Problems", Proceedings of the 10th ACM STOC, 1978, 253–264.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SRI International, 333 Ravenswood Ave., 94025, Menlo Park, CA

    Vladislav Rutenburg

Authors
  1. Vladislav Rutenburg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Choffrut Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rutenburg, V. (1991). Complexity classification of Truth Maintenance systems. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020813

Download citation

  • DOI: https://doi.org/10.1007/BFb0020813

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53709-0

  • Online ISBN: 978-3-540-47002-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation