Advertisement

A lattice-theoretic analysis of ATMS problem solving

  • Teow-Hin Ngair
  • Gregory Provan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 747)

Abstract

This paper presents a lattice-theoretic formalization of the ATMS which allows us to define the semantics of the ATMS, the ATMS labeling operation, as well as focusing algorithms for the ATMS. These focusing algorithms are integrated cleanly within the proposed framework by assigning a real-valued cost to the lattice boundary sets, and allow performance improvements even for cases where there is little domain-dependent knowledge. The resulting bf-atms algorithm explores a search space of size polynomial in the number of assumptions, even for problems which are proven to have labels of size exponential in the number of assumptions. Empirical testing indicates significant speedups over the standard ATMS for such problems, while retaining the multiple-context capability of an ATMS, the important properties of consistency, minimality, soundness, as well as the property of bounded completeness.

Keywords

Cost Function Propositional Atom Consequence Node Label Representation Correct Environment 
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.
    D. Benanev, A.L. Brown, and D.E. Gaucas. An Algebraic Foundation for Truth Maintenance. In Proc. IJCAI, pages 973–980, 1987.Google Scholar
  2. 2.
    R.M. Bodington, G.D. Sullivan, and K.D. Baker. Experiments on the Use of the ATMS to Label Features for Object Recognition. In Proc. of ECCV-90, pages 542–551, 1990.Google Scholar
  3. 3.
    John W. Collins and Dennis DeCoste. CATMS: An ATMS Which Avoids Label Explosions. In Proc. of AAAI-91, pages 281–287, 1991.Google Scholar
  4. 4.
    Johan de Kleer. An assumption-based TMS. Artificial Intelligence, 28:127–162, 1986.Google Scholar
  5. 5.
    Johan de Kleer. Focusing on probable diagnoses. Proc. of AAAI-91, pages 842–848, 1991.Google Scholar
  6. 6.
    Johan de Kleer. Optimizing Focusing Model-Based Diagnoses. Proc. of Third Diagnosis Workshop, pages 26–29, 1992.Google Scholar
  7. 7.
    Johan de Kleer, Alan K. Mackworth, and Raymond Reiter. Characterizing diagnoses. Proc. of AAAI-90, pages 324–330, 1990.Google Scholar
  8. 8.
    Johan de Kleer and Brian C. Williams. Back to backtracking: Controlling the ATMS. Proc. of AAAI-87, pages 910–917, 1987.Google Scholar
  9. 9.
    Johan de Kleer and Brian C. Williams. Diagnosing multiple faults. Artificial Intelligence, 32:97–130, 1987.Google Scholar
  10. 10.
    Jon Doyle. A truth maintenance system. Artificial Intelligence, 12:231–272, 1979.Google Scholar
  11. 11.
    O. Dressler and A. Farquar. Putting the Problem Solver Back in the Driver's Seat: Contextual Control of the ATMS. In Second AAAI Workshop on Model-Based Reasoning, pages 106–112, 1990.Google Scholar
  12. 12.
    Kenneth D. Forbus. The qualitative process engine. In Daniel S. Weld and Johan de Kleer, editors, Readings in Qualitative Reasoning About Physical Systems, pages 220–235. Morgan Kaufmann, 1990.Google Scholar
  13. 13.
    Kenneth D. Forbus and Johan de Kleer. Focusing the ATMS. Proc. of AAAI-88, pages 193–198, 1988.Google Scholar
  14. 14.
    M. Ginsberg. Multivalued Logics: A Uniform Approach to Reasoning in Artificial Intelligence. Computational Intelligence, pages 265–316, 1988.Google Scholar
  15. 15.
    Carl A. Gunter, Teow-Hin Ngair, Prakash Panangaden, and Devika Subramanian. The common order-theoretic structure of version spaces and ATMS's. Technical Report MS-CIS-90-86, University of Pennsylvania, 1990.Google Scholar
  16. 16.
    D. McAllester. A Widely Used Truth Maintenance System. Unpublished, 1985.Google Scholar
  17. 17.
    Teow-Hin Ngair. Convex spaces: An order-theoretic structure for problem solving. Technical Report MIS-CS-92-60, CIS Department, University of Pennsylvania, 1992.Google Scholar
  18. 18.
    Teow-Hin Ngair and Gregory Provan. Focusing ATMS for Problem-Solving: A Formal Approach. Technical Report MS-CIS-92-61, University of Pennsylvania, 1992.Google Scholar
  19. 19.
    J. Pearl. Heuristics. Addison-Wesley, Reading, Mass., 1984.Google Scholar
  20. 20.
    G. Provan. Complexity Analysis of Truth Maintenance Systems, with Application to High Level Vision. PhD thesis, Faculty of Mathematics, University of Oxford, 1990.Google Scholar
  21. 21.
    G. Provan. The Computational Complexity of Multiple-Context Truth Maintenance Systems. In Proc. of ECAI-90, pages 522–527, 1990.Google Scholar
  22. 22.
    R. Reiter and J. de Kleer. Foundations of Assumption-based Truth Maintenance Systems: Preliminary Report. In Proc. of AAAI-87, pages 183–188, 1987.Google Scholar
  23. 23.
    B. Selman and H. Levesque. Abductive and Default Reasoning: A Computational Core. In Proc. AAAI, pages 343–348, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Teow-Hin Ngair
    • 1
  • Gregory Provan
    • 2
  1. 1.Institute of Systems ScienceNational University of SingaporeKent RidgeRepublic of Singapore
  2. 2.Computer and Information Science DepartmentUniversity of PennsylvaniaPhiladelphiaUSA

Personalised recommendations