This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Adi and C. Kirchner. AC-unification race: the system solving approach. In Proceedings of DISCO'90, Capri (Italy), 1990.
L. Bachmair. Proof methods for equational theories. PhD thesis, University of Illinois, Urbana-Champaign, 1987. Revised version, August 1988.
J. Bentley. Programming pearls: literate programming. Communications of the Association for Computing Machinery, 29(5):364–369, 1986.
S.C. Chou, W.F. Schelter, and J.G. Yang. Characteristics sets and Gröbner bases in geometry theorem proving. In H. Aït-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, pages 33–91, Academic Press, INC, New York, 1989.
A. Habacha Hamada. Implantation d'un algorithme de complétion conditionnelle basé sur le raisonnement par cas. Rapport interne, Centre de Recherche en Informatique de Nancy, Vandœuvre-lès-Nancy, 1990.
D. E. Knuth. Literate programming. The Computer Journal, 27(2):97–111, 1984.
P. Lescanne. Completion procedures as transition rules + control. In M. Diaz and F. Orejas, editors, TAPSOFT'89, pages 28–41, Springer-Verlag, Lecture Notes in Computer Science, 1989. Vol. 351.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lescanne, P. (1990). Implementation of completion by transition rules + control: ORME . In: Kirchner, H., Wechler, W. (eds) Algebraic and Logic Programming. ALP 1990. Lecture Notes in Computer Science, vol 463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53162-9_44
Download citation
DOI: https://doi.org/10.1007/3-540-53162-9_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53162-3
Online ISBN: 978-3-540-46738-0
eBook Packages: Springer Book Archive