Abstract
The paper presents an overview of the research achievements on issues of common interest for Symbolic Computation and Artificial Intelligence. Common methods and techniques of non-numerical information processing and of automated problem solving are underlined together with specific applications. A qualitative analysis of the symbolic computation systems currently available is presented in view of the design and implementation of a new system. This system allows both formal algebraic and analytical computations and automated deduction to prove properties of the computation.
Research partially supported by MURST projects “Calcolo Algebrico”, “Metodi e strumenti per l'elaborazione non numerica” ; and by CNR project “Sistemi Informatici e Calcolo Parallelo”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bibel, W., Automated theorem proving, II Ed., Fried. Vieweg & Sohn, Braunschweig/Wiesbaden, (1987).
Bonamico, S., Cioni, G., Embedding flexible control strategies into object oriented languages, LNCS 357, Springer Verlag, (1989).
Bonamico, S., Cioni, G., Colagrossi, A., A Gentzen based deduction method for the propositional theory, Rapp. IASI 289, (1990).
Buchberger, B., Collins, G.E., Loos, R.G.K., (eds.), Computer Algebra — Symbolic and Algebraic Computation, 2nd ed., Springer-Verlag, (1983).
Buchberger, B., An Algorithm for Finding a Basis for the Residue Class Ring of a zero-dimensional polynomial Ideal, Ph.D. Thesis, Univ. Innsbruck (Austria), (1965).
Buchberger, B., History of Basic Features of the Critical-Pair/Completion Procedure, J. Symb. Comp., 3:3–38, (1987).
Caviness, B.F., Computer Algebra: Past and Future, J. Symb. Comp., 2:217–236, (1986).
Davenport, J.H., Siret, Y., Tournier, E., Computer Algebra — Systems and Algorithms for Algebraic Computation, Academic Press, (1988).
Deprit, A., et al., Lunar ephemeris: Delunay's theory revised, Science, 168:1569–1570, (1970).
Forcellese, G., Temperini, M., A system for automated deduction based on the Connection Method, Rapp. IASI 268, (1989).
Forcellese, G., Temperini, M., Towards a logic language: an object-oriented implementation of the Connection Method, LNCS 429, Springer Verlag, (1990).
Gallier, J.H., Logic for Computer Science, Harper & Row Publishers, (1986).
Rewriting Rules Techniques and Applications, Special Issue of the J. Symbolic Computation, 1/2, (1987).
Kahrimanian, H.G., Analytic Differentiation by a Digital Computer, M.A. Thesis, Temple Univ., Philadelphia, Pennsylvania, (1953).
Knuth, D.E., bendix, P.B., Simple Word Problems in Universal Algebra, Proc. Conf. on Computational Problems in Abstract Algebra, Pergamon Press, (1970)
Kowalski, R., Logic for Problem Solving, The Computer Science Library, (1983).
Kreczmar, A., et al., LOGLAN '88 — Report on the Programming Language, LNCS 414, Springer Verlag, (1990).
Limongelli, C., et al., Abstract Specification of Mathematical Structures and Methods, LNCS, 429:61–70, Springer Verlag, (1990).
Miola, A., Symbolic Computation Systems, In: Encyclopedia of Computer Science and Technology, (Kent, A., Williams, J.G., eds.), Marcel Dekker, to appear, (1991).
Miola, A., Limongelli, C., The amalgamation of numeric and algebraic computations in a single integrated computing environment, Rapp. DIS 18.88, (1988).
Miola, A., (ed.): Computing tools for scientific problems solving, Academic Press, (1990).
Miola, A., (Ed.): Design and Implementation of Symbolic Computation Systems, LNCS 429, Springer Verlag, (1990).
Mirkowska, G., Salwicki, A., Algorithmic logic, PWN Warszawa & D. Reidel Publishing Company, (1987).
Nolan, J., Analytic Differentiation on a Digital Computer, M.A. Thesis, M.I.T., Math. Dept., Cambridge, Massachusetts, (1953).
Regio, M., Temperini, M., A short review on Object Oriented Programming: Methodology and language implementations, Proc. ACM Sympos. on Personal and Small Computers, (1990).
Risch, R.H., The problem of Integration in Finite Terms, Trans. A.M.S., 139:167–189, (1969).
Robinson, J.A., A machine Oriented Logic Based on resolution Principle, J. ACM, 12/1:23–41, (1965).
Siekmann, J.H., Unification Theory, J. Symb. Comp. 7:207–274, (1989).
Slagle, J.R., A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus, J. ACM, 10:507–520, (1963).
Stroustrup, B., What is Object-Oriented Programming, ECOOP 87, (1987).
Yun, D.Y.Y., Stoutemyer, R.D., Symbolic Mathematical Computation. In: Encyclopedia of Computer Science and Technology, Vol.15, (Belzer, J., Holzman, A.G., Kent, A., eds.), Marcel Dekker, 235–310, (1980).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miola, A. (1991). Symbolic Computation and Artificial Intelligence. In: Jorrand, P., Kelemen, J. (eds) Fundamentals of Artificial Intelligence Research. FAIR 1991. Lecture Notes in Computer Science, vol 535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54507-7_20
Download citation
DOI: https://doi.org/10.1007/3-540-54507-7_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54507-1
Online ISBN: 978-3-540-38420-5
eBook Packages: Springer Book Archive