Research partially supported by MURST: “Calcolo Algebrico, Sistemi di Manipolazione Algebrica”; CNR: “Matematica Computazionale”, Progetto Finalizzato “Sistemi Informatici e Calcolo Parallelo”; Olivetti System and Networks.
References
W. BIBEL: Automated theorem proving. Friedr. Vieweg & Sohn, Braunschweig, (1982).
W.M. BARTOL et al: Report on the Programming Language LOGLAN 82, Polish Scient. Publ. Warsaw (1984).
K. ESHGHI, R.A. KOWALSKI: Abduction Compared with Negation By Failure, Proc. 6th ICLP, G.Levi & M.Martelli Eds. MIT Press, (1989).
G. FORCELLESE, M.TEMPERINI: A System for Automated Deduction Based on the Connection Method, R.268 IASI-CNR, Roma.
G. MIRKOWSKA, A. SALWICKI: Algorithmic Logic, Polish Scient. Publ. Warsaw (1987).
M.S. PATERSON, M.N. WEGMAN: Linear unification. JCSS 16, (1978).
F.J. PELLETIER: Seventy-Five Problems for Testing Automatic Theorem Provers, JAR 16 (1986).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Forcellese, G., Temperini, M. (1990). Towards a logic language: An object-oriented implementation of the connection method. In: Miola, A. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1990. Lecture Notes in Computer Science, vol 429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52531-9_155
Download citation
DOI: https://doi.org/10.1007/3-540-52531-9_155
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52531-8
Online ISBN: 978-3-540-47014-4
eBook Packages: Springer Book Archive