Intelligent computer algebra system: Myth, fancy or reality?
To design an intelligent system one may either start the implementation and solve the problems one is faced to, i.e. a development approach, or try to identify the possible problems and to provide a solution for them. We do not claim that any method is best. We have adopted the second one mainly because of practical aand preference motivations. We are aware that this is not the quickest way of "producing a system". But, it is very encouraging to realize that proposed solutions often extend beyon the only field of Computer Algebra. In fact the question whether this type of work belongs to this field is legitimate. The probable answer is: partially.
Coming back to the feasibility of such a system, it appears that adequate techniques can be found although, many problems are still open. It remains unclear whether such a system would induce satisfactory computing times. The answer will only be available when the top interface which identify and manipulate knowledge is completed. But, it is probably obvious that this is not our main motivation.
Unable to display preview. Download preview PDF.
- 1.-J. CALMET and D. LUGIEZ, A Knowledge-Based System for Computer Algebra. SIGSAM Bulletin, 21(1), pp. 7–13, 1987.Google Scholar
- 2.-R.E. GANTENBEIN, Support for Dynamic Binding in Strongly Typed Languages. SIGPLAN Notices, 22(6), pp. 69–75, 1987.Google Scholar
- 3.-H. COMON, Généricité en calcul formel: théorie et réalisation. Rapport de DEA, LIFIA. In French, unpublished, 1985.Google Scholar
- 4.-F.R.A HOPGOOD, D.A. DUCE, J.R. GALLOP and D.C. SUTCLIFFE, Introduction to the Graphical Kernel System (GKS). Academic Press, 1983.Google Scholar
- 5.-G. BITTENCOURT, Integration of Graphical Tools in a Computer Algebra System. To appear in the proceedings of the 1986 AAECC-4 conf. LNCS, Springer-Verlag, 1987.Google Scholar
- 6.-K. DITTENBERGER, Hensel Codes: An Efficient Method to Do Numerical Computation without Rounding Errors. Diplomarbeit, Univ. Linz, Austria, 1985.Google Scholar
- 7.-Y. AHRONOVITZ, Report Univ. of Saint Etienne, to appear.Google Scholar
- 8.-J.S. KOWALIK, ed., Coupling Symbolic and Numerical Computing in Expert Systems. North-Holland, 1986.Google Scholar
- 9.-H. COMON, forthcoming dissertation thesis, in French, November 1987.Google Scholar
- 10.-J. CALMET, H. COMON and D. LUGIEZ, Type Inference Using Unification in Computer Algebra. To appear in the proceedings of the 1986 AAECC-4 conf. LNCS, Springer-Verlag, 1987.Google Scholar
- 11.-H. COMON, D. LUGIEZ and Ph. SCHNOEBELEN, Type Inference in Computer Algebra. To appear in the proceedings of ISSAC-87 conf. LNCS, Springer-Verlag, 1987.Google Scholar
- 12.-H. COMON, About Disequations Simplifications. LIFIA report, 1987.Google Scholar
- 13.-H. COMON, Sufficient Completeness, Term Rewriting System and Anti-Unification. Proc. CADE-8 conf., LNCS 230, pp. 128–140, 1986.Google Scholar
- 14.-H. COMON, D. LUGIEZ and Ph. SCHNOEBELEN, Disunification: A tool for Deductive Knowledge-Bases. Talk given at the 1987 AAECC-5 conf. Menorca, Spain, 1987.Google Scholar
- 15.-J. CALMET, Toward an Expert System for Error Correcting Codes. To appear in the proc. of the 1987 AAECC-5 conf. Menorca, Spain, 1987.Google Scholar
- 16.-D.Y.Y. YUN, Talk at RYMSAC II, Tokyo, 1984. Not in the proceedings.Google Scholar
- 17.-J. SARWA, Une approche de représentation de connaissances dans les systèmes de calcul formel. Rapport de DEA, LIFIA, in French, unpublished, 1987.Google Scholar
- 18.-G. BITTENCOURT, A Graph Formalism for Knowledge Representation. LIFIA report, submitted to a conference, 1987.Google Scholar