Abstract
Clause subsumption is of fundamental importance for reducing the search space in theorem proving systems. Since the subsumption problem is NP-complete, the design of efficient heuristics is of significant interest. The core of all subsumption algorithms is the search for suitable substitutions for the variables in a given clause, which in all previously known algorithms is implicitly embedded in the control structure of the algorithm. In this paper we adopt a more abstract view of subsumption and introduce the concept of a subsumption search tree to separate the search control from other computational tasks, such as computing substitutions and verifying their consistency. We study key algorithmic aspects of search trees and of heuristics for constructing them. For instance, the complexity of a search-tree based algorithm depends on the height of the search tree. We show that the problem of constructing minimal-height search trees is NP-complete. We also derive improved upper bounds on the height of search trees constructed according to an analysis based on variable dependencies, as proposed by Gottlob and Leitsch; and show that the bound is essentially tight in the worst case, by establishing suitable lower bounds for arbitrary search trees. In addition to these theoretical results, we propose further algorithmic improvements based on more sophisticated data structures for computing and representing substitutions. Finally, we have implemented several variants of our proposed algorithm and report on corresponding experiments.
This work was supported in part by NSF grants CCR-9404921, CDA-9303181, CDA-9504275 and INT-9314412.
Preview
Unable to display preview. Download preview PDF.
References
M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, San Francisco, 1979.
G. Gottlob and A. Leitsch. On the efficiency of subsumption algorithms. JACM, 32(2):280–295, April 1987.
W. McCune. Otter 3.0 reference manual and guide. Technical Report ANL-94/6, Argonne National Laboratory, Argonne, Ill., 1994.
Geoff Sutcliffe, Christian Suttner, and Theodor Yemenis. The TPTP problem library. In Proc. 12th Int. Conf. on Automated Deduction, volume 814 of Lecture Notes in Artificial Intelligence, pages 252–266. Springer-Verlag, Berlin, 1994.
R. B. Stillman. The concept of weak substitution in theorem-proving. JACM, 20(4):648–667, 1973.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bachmair, L., Chen, T., Ramakrishnan, C.R., Ramakrishnan, I.V. (1996). Subsumption algorithms based on search trees. In: Kirchner, H. (eds) Trees in Algebra and Programming — CAAP '96. CAAP 1996. Lecture Notes in Computer Science, vol 1059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61064-2_34
Download citation
DOI: https://doi.org/10.1007/3-540-61064-2_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61064-9
Online ISBN: 978-3-540-49944-2
eBook Packages: Springer Book Archive