Subsumption algorithms based on search trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1059, Issue , 1996, Pages 135-148

  Bachmair, Leo ^a   Chen, Ta ^a   Ramakrishnan, C R ^a   Ramakrishnan, I V ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

ALGORITHMIC ASPECTS; COMPUTATIONAL TASK; CONTROL STRUCTURE; LOWER BOUNDS; SEARCH CONTROL; SEARCH SPACES; THEOREM PROVING SYSTEMS; VARIABLE DEPENDENCIES;

TREES (MATHEMATICS);

EID: 84947925434     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61064-2_34     Document Type: Conference Paper

References (6)

1. M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, San Francisco, 1979.
2. G. Gottlob and A. Leitseh. On the efficiency of subsumption algorithms. JACM, 32(2):280-295, April 1987.
3. W. McCune. Otter 3.0 reference manual and guide. Technical Report ANL-94/6, Argonne NationM Laboratory, Argonne, Ill., 1994.
4. Geoff Sutcliffe, Christian Suttner, and Theodor Yemenls. The TPTP problem library. In Proc. 12th Int. Con/. on Automated Deduction, volume 814 of Lecture Notes in Artificial Intelligence, pages 252-266. Springer-Verlag, Berlin, 1994.
5. R. B. Stillman. The concept of weak substitution in theorem-proving. JA CM, 20(4):648-667, 1973.
6. L. Wos, R. Overbeek, and E. Lusk. Subsumption, a sometimes undervalued procedure. In J.-L. Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, pages 3-40. MIT Press, 1991.