This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Jim Christian. Flatterms, Discrimination Nets, and Fast Term rewriting. Journal of Automated Reasoning, 10:95–113, 1993.
Peter Graf. Substitution Tree Indexing. In J. Hsiang, editor, 6th RTA, LNCS 914, pages 117–131, Kaiserslautern, Germany, April 4–7, 1995. Springer-Verlag.
William McCune. Experiments with discrimination tree indexing and path indexing for term retrieval. Journal of Automated Reasoning, 9(2):147–167, October 1992.
Robert Nieuwenhuis, José Miguel Rivero, and Miguel Ángel Vallejo. The Barcelona Prover. Journal of Automated Reasoning, 1997. Special issue CADE-13 ATP System Competition. To appear.
Mark Stickel. The path-indexing method for indexing terms. Technical Report 473, Artificial Intelligence Center, SRI International, October 1989.
David H.D. Warren. An Abstract Prolog Instruction Set. Technical Report Technical Note 309, SRI International, Menlo Park, CA, October 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nieuwenhuis, R., Rivero, J.M., Vallejo, M.A. (1997). Dedam: A kernel of data structures and algorithms for automated deduction with equality clauses. In: McCune, W. (eds) Automated Deduction—CADE-14. CADE 1997. Lecture Notes in Computer Science, vol 1249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63104-6_5
Download citation
DOI: https://doi.org/10.1007/3-540-63104-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63104-0
Online ISBN: 978-3-540-69140-2
eBook Packages: Springer Book Archive