References
L. Bachmair, T. Chen, and IN. Ramakrishnan. Associative-commutative discrimination nets. In Proceedings TAPSOFT '93, LNCS 668, pages 61–74. Springer, 1993.
R. Butler, E. Lusk, W. McCune, and R. Overbeek. Paths to high-performance automated theorem proving. In 8th Conference on Automated Deduction, pages 588–597. Springer LNCS 230, 1994.
R. Boyer and E. McCreight. Organization and Maintenance of Large Ordered Indexes. Acta Informatica, 1:3, February 1972.
R. Butler and R. Overbeek. Formula databases for high-performance resolution/paramodulation systems. Journal of Automated Reasoning, 12:139–156, 1994.
J. Corbin and M. Bidoit. A rehabilitation of Robinsons unification algorithm. Information Processing Letters, 1983.
J. Christian. Flatterms, discrimination nets, and fast term rewriting. Journal of Automated Reasoning, 10(1):95–113, February 1993.
P. Graf. Extended path-indexing. In 12th Conference on Automated Deduction, pages 514–528. Springer LNAI 814, 1994.
P. Graf. Substitution tree indexing. In 6th International Conference on Rewriting Techniques and Applications RTA-95, pages 117–131. Springer LNCS 914, 1995.
P. Graf. Term Indexing. Springer Lecture Notes in Artificial Intelligence, Vol. 1053, 1996.
L.J. Henschen and S.A. Naqvi. An improved filter for literal indexing in resolution systems. In Proceedings of the 6th International Joint Conference on Artificial Intelligence, pages 528–529, 1981.
E. Lusk and R. Overbeek. Data structures and control architectures for the implementation of theorem proving programs. In 5th International Conference on Automated Deduction, pages 232–249. Springer, 1980.
W. McCune. An indexing method for finding more general formulas. Association for Automated Reasoning Newsletter, 1(9):7–8, January 1988.
W. McCune. Experiments with discrimination-tree indexing and path-indexing for term retrieval.Journal of Automated Reasoning, 9(2):147–167, October 1992.
H.J. Ohlbach. Abstraction tree indexing for terms. In Proceedings of the 9th European Conference on Artificial Intelligence, pages 479–484. Pitman Publishing, London, August 1990.
H.J. Ohlbach. Compilation of recursive two-literal clauses into unification algorithms. In Proc. of AIMSA 1990. Bulgaria, 1990.
M. S. Paterson and M. N. Wegman. Linear Unification. In Journal of Computer and System Sciences, Vol. 16:2, 1978, pages 158–167.
R. Ramesh, I.V. Ramakrishnan, and R.C Sekar. Adaptive pattern matching. In Proceedings of ICALP'92, pages 247–260. Springer, LNCS 623, 1992.
R. Ramesh, I.V. Ramakrishnan, and R.C Sekar. Automata-driven efficient subterm unification. In Proceedings of LICS-94. Springer, LNCS, 1994.
K. Ramamohanarao and J. Shepherd. A superimposed codeword indexing scheme for very large Prolog databases. In Proceedings of the 3rd International Conference on Logic Programming. London, England, 1986.
M. Stickel. The path-indexing method for indexing terms. Technical Note 473, Artificial Intelligence Center, SRI International, Menlo Park, CA, October 1989.
A. Voronkov. The anatomy of vampire: Implementing bottom-up procedures with code trees. Journal of Automated Reasoning, 15(2):237–265, 1995.
L. Wos. Note on McCune's article on discrimination trees. Journal of Automated Reasoning, 9(2):145–146, 1992.
M. Wise and D. Powers. Indexing prolog clauses via superimposed codewords and field encoded words. In Proceedings of the IEEE Conference on Logic Programming, pages 203–210, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ohlbach, H.J. (1997). Efficient data structures for deduction systems. In: Bry, F., Ramakrishnan, R., Ramamohanarao, K. (eds) Deductive and Object-Oriented Databases. DOOD 1997. Lecture Notes in Computer Science, vol 1341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63792-3_1
Download citation
DOI: https://doi.org/10.1007/3-540-63792-3_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63792-9
Online ISBN: 978-3-540-69647-6
eBook Packages: Springer Book Archive