Abstract
Algebraic programming system APS is considered as a tool for integrating computer algebra with artificial intelligence. The system is based on rewriting rule programming and algebraic program in APLAN, the source language of the system, in many cases may be considered as an executable specification of a problem. Two different kinds of solvers are specified in terms of rewriting rules. The first one is a universal solver that extends a pure PROLOG-like solver in different directions. One of the important property of this solver is the possibility for inclusion of special algorithms for solving equations in different algebras. Another solver is directed to solving problems on computational models (some kind of constraint networks). It searches for the solution of a problem in two stages — constructing the plan and solving equations. On the second stage the solver calls the universal one to get the solution of equations. The application of APS and its solvers to the development of system for mathematical education in secondary school is briefly described in the last section of the paper.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
N. Dershovitz, J.-P. Jouannaud, Rewrite systems. In Jan van Leeuwen (Ed.), Handbook of theoretical computer science, v.B Elsevier, 1990.
C. Kirchner (Ed.), Rewriting techniques and Applications. Proceedings, LNCS vol. 690, 488, Springer, 1993.
M. Rusinovich, J.L. Remy (Eds.), Conditional term rewriting systems. Proceedings, 1992, LNCS vol. 656, 501, Springer, 1993.
J. Gogen, C. Kirchner, H. Kirchner, A. Megrelis, and T. Wincler, An introduction to OBJ-3. In Jouannaud and Kaplan (Eds.), Proc. 1st Intern. Workshop on Conditional Term Rewriting Systems, Springer, 1988.
M. J. O'Donnell, Term rewriting implementation of equational logic programming. In P. Lescanne (Ed.), Rewriting Techniques and Applications, volume 256 of LNCS, 1–12, Springer, 1987.
J. A. Bergstra, J. Hearing, and P. Klint (Eds.), Algebraic Specification. ACM Press and Addison-Wesley, 1989.
M. Bidoit and C. Choppy, ASSPEGIQUE: an integrated environement for algebraic specifications. In Proc. Intern. Joint Conf. on Theory and Practice of Software Development, 246–260, Springer, 1985.
G. Rayna, REDUCE. Software for Algebraic Computation. Springer, 1989.
S. Wolfram, Mathematica ℳ. A System for Doing Mathematics by Computer. Addison-Wesley, 1988.
A.A. Letichevsky, J.V. Kapitonova, S.V. Konozenko, Computations in APS, Theoretical Computer Science 119(1993), 145–171, Elsevier, 1993.
A.A. Letichevsky, J.V. Kapitonova, S.V. Konozenko, Algebraic Programs Optimization. In Proc. of the Int. Symp. on Symbolic and Algebraic Computation (ISSAC'91), July 15–17 1991, Bonn, Germany, ACM Press, New York 1991.
M. Fitting, A Kripke-Kleene semantics for logic programs, J.Logic Programming, 4, 295–312, 1985.
J.V. Kapitonova, A.A. Letichevsky, On constructive mathematical descriptions of subject domains, Kibernetica, 4, 1988.
J.M. Hullot, Canonical forms and Unification, In Proc. of 5-th Conference on Automated Deduction, LNCS v. 87, 318–334, Springer, 1980.
Enn Tyugu, Solving problems on computational models. J. Computational Mathematics and Math. Phys., 10:716–33, 1970.
Ugo Montanary, Networks of constraints: Fundamental properties and application to picture processing. Information Sciences, 7(2):95–132, 1974.
J.H. Davenport, B.M. Trager, Scratchpad's View of Algebra I: Basic Commutative Algebra. LNCS 429, 40–55, Springer, 1990.
J.H. Davenport, P. Gianni, B.M. Trager, Scratchpad's View of Algebra II: A Categorial view of factorization. In Proc. of the Int. Symp. on Symbolic and Algebraic Computation (ISSAC'91), July 15–17, 1991, Bonn, Germany, 32–39, ACM, New York 1991.
J. Calmet, I.A. Tjandra, A Unified-Algebra-based Specification Language for symbolic Computing. In Design and Implementation of Symbolic Computation System, 14–27, Springer, 1993.
R.S. Sutor (Ed.), Axiom. User's Guide., The Numerical Algorithm Group Limited, 1991.
M. Clarkson, Praxis: rule-based expert system for Macsyma, LNCS 429, 264–265, Springer, 1990.
H. Ait-Kaci, A. Podelski, An overview of LIFE. LNCS 504, 42–58, Springer, 1991.
G. Butler, J.J. Cannon, Cayley, version 4: the user language, LNCS 358, 456–466, Springer, 1989.
B.J. Bradfort, A.C. Hearn, J.A. Padget, E. Schrufer, Enlarging the REDUCE domain of computation. In SYMSAC 1986, 100–106, ACM, New York, 1986.
M.S. L'vov, A.B. Kuprienko, V.A. Volkov, Applied Computer Algebra System AIST: Computer Support of Mathematical Training, In Proc. Int. Workshop on the Computer Algebra Application, July 9, 1993, Kiev, Ukraine.
B. Silver, Meta-level Inference Elsevier Science, Amsterdam, Netherlands, 1986.
Jacques Cohen, Constraint logic programming languages. Communications of the ACM, 33(7):52–68, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kapitonova, Y.V., Letichevsky, A.A., L'vov, M.S., Volkov, V.A. (1995). Tools for solving problems in the scope of algebraic programming. In: Calmet, J., Campbell, J.A. (eds) Integrating Symbolic Mathematical Computation and Artificial Intelligence. AISMC 1994. Lecture Notes in Computer Science, vol 958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60156-2_4
Download citation
DOI: https://doi.org/10.1007/3-540-60156-2_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60156-2
Online ISBN: 978-3-540-49533-8
eBook Packages: Springer Book Archive