A knowledge-based system for computer algebra

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A knowledge-based system for computer algebra

Full text

Pdf (653 KB)

Source

ACM SIGSAM Bulletin archive
Volume 21 , Issue 1 (February 1987) table of contents

Pages: 7 - 13

Year of Publication: 1987

ISSN:0163-5824

Authors

Jacques Calmet
Denis Lugiez

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 12, Citation Count: 1

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/24559.24560 What is a DOI?

ABSTRACT

This paper reports on a work in progress aiming at designing and implementing a system for representing and manipulating mathematical knowledge. Its kernel is a computer algebra system but it shows several of the features of the so-called knowledge-based systems. The main issues considered here are the software engineering aspects of the project, the definition of a new language to support the system and the use of AI techniques in a field where algebraic algorithms are the building stones of systems. This defines an environment which enables not only to have data-bases of knowledge but also to implement an expert use of this knowledge.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	S. K. Abdali , Guy W. Cherry , Neil Soiffer, An object-oriented approach to algebra system design, Proceedings of the fifth ACM symposium on Symbolic and algebraic computation, p.24-30, July 21-23, 1986, Waterloo, Ontario, Canada [doi>10.1145/32439.32444]
	2	Friedrich L. Bauer, Software Engineering, Software Engineering, An Advanced Course, Reprint of the First Edition [February 21 - March 3, 1972], p.522-545, January 1975
	3	(Ber83) Bert D. 1983, <i>Refinement of Generic Specifications with Algebraic Tools</i>, Proc. IFIP 83, R. E. Mason Ed.
	4	Didier Bert , Rachid Echahed, Design and Implementation of a Generic, Logic and Functional Programming Language, Proceedings of the European Symposium on Programming, p.119-132, March 17-19, 1986
	5	G. Bittencourt, Integration of graphical tools in a computer algebra system, Proceedings of the 4th International Conference, AAECC-4 on Applicable algebra, error-correcting codes, combinatorics and computer algebra, p.13-24, June 1988, Karlsruhe, Germany
	6	B. Buchberger , George E. Collins , Rudiger Loos , Rudolf Albrecht, Computer algebra: symbolic and algebraic computation (2nd ed.), Springer-Verlag New York, Inc., New York, NY, 1983
	7	(BDH 86) Bachmair L., Dershowitz, N., Hsiang J., 1986 <i>Ordering for equational proofs</i> IEEE Symposium on Logic in Computer Science.
	8	Jacques Calmet , Marc Bergman, Some design principles for a mathematical knowledge representation system: a new approach to scientific calculation, Proceedings of the 2nd International Conference on Applied Algebra, Algorithms and Error-Correcting Codes, p.253-265, October 01-05, 1984
	9	Luca Cardelli, A semantics of multiple inheritance., Proc. of the international symposium on Semantics of data types, p.51-67, July 1984, Sophia-Antipolis, France
	10	(Com85) Comon H., <i>Généricité en Calcul Formel: Théorie et Application</i>, Rapport de D. E. A., INPG, 1985.
	11	Hubert Comon, Sufficient Completness, Term Rewriting Systems and "Anti-Unification", Proceedings of the 8th International Conference on Automated Deduction, p.128-140, July 27-August 01, 1986
	12	(CoLu87) Comon H., Lugiez D., <i>Type Inference in Computer Algebra using Term Rewriting Systems and Sub-typing relation</i>, submitted, LIFIA Report.
	13	Brian P. McCune , Richard M. Tong , Jeffrey S. Dean , Daniel G. Shapiro, RUBRIC: a system for rule-based information retrieval, IEEE Transactions on Software Engineering, v.11 n.9, p.939-945, Sept. 1985 [doi>10.1109/TSE.1985.232827]
	14	(DeMy86) Delgrande J. P., Mylopoulos J., <i>Knowledge Representation: Features of Knowledge</i>, Fundamentals in Man-Machine Communication: Speech, Vision and Natural Language, Jean Paul Haton (Ed.) 1986.
	15	(Dit 85) Dittemberger, K., 1985, <i>Hensel Codes</i>, Diplomarbeit, University of Linz, Austria.
	16	Jon Doyle, Expert systems and the “myth” of symbolic reasoning, IEEE Transactions on Software Engineering, v.11 n.11, p.1386-1390, Nov. 1985 [doi>10.1109/TSE.1985.231886]
	17	Kokichi Futatsugi , Joseph A. Goguen , Jean-Pierre Jouannaud , José Meseguer, Principles of OBJ2, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.52-66, January 14-16, 1985, New Orleans, Louisiana, United States [doi>10.1145/318593.318610]
	18	Narain Gehani , Andrew D. McGettrick, Software Specification Techniques (International Computer Science Series), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1985
	19	F. R.A. Hopgood , D. A. Duce , J. R. Gallop , D. C. Sutcliffe, Introduction to the Graphical Kernel System (GKS) (2nd ed. revised for international standard), Academic Press Ltd., London, UK, 1986
	20	(HuHu82) Huet G., Hullot J. M. <i>Proof by Induction in Equational Theory with Constructors</i>, JCSS 25, 2, 1982.
	21	Richard D. Jenks, A Primer: 11 Keys to New Scratchpad, Proceedings of the International Symposium on Symbolic and Algebraic Computation, p.123-147, July 09-11, 1984
	22	Richard D. Jenks , Barry M. Trager, A language for computational algebra, Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, p.6-13, August 05-07, 1981, Snowbird, Utah, United States [doi>10.1145/800206.806363]
	23	(JoKo86) Jouannaud J. P., Kounalis E., <i>Proof by induction in Equational theory Without Constructors</i>, Proc of IEEE Conf on Logic in Computer Science, Cambridge MA, 1986.
	24	R T. Gregory , E V. Krishnamurthy, Methods and applications of error-free computation, Springer-Verlag New York, Inc., New York, NY, 1984
	25	Douglas B. Lenat , John Seely Brown, Why AM an EUISKO appear to work., Artificial Intelligence, v.23 n.3, p.269-294, August 1984 [doi>10.1016/0004-3702(84)90016-X]
	26	Rüdiger G. K. Loos, The algorithm description language ALDES (report), ACM SIGSAM Bulletin, v.10 n.1, p.14-38, February 1976 [doi>10.1145/1093390.1093395]
	27	(Mil78) Milner R. <i>A theory of Type Polymorphism in Programming</i>, JCSS 17 pp348--375 1978.
	28	(MaLe84) Michalski R. S., Carbonell J. G., Mitchell T. M., <i>Machine Learning</i> Springer Verlag Editor 1984.
	29	(ML85) <i>The ML Handbook</i>, version 6.1, INRIA report 1985.
	30	David R. Musser, On proving inductive properties of abstract data types, Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.154-162, January 28-30, 1980, Las Vegas, Nevada [doi>10.1145/567446.567461]
	31	D. L. Parnas, On the criteria to be used in decomposing systems into modules, Communications of the ACM, v.15 n.12, p.1053-1058, Dec. 1972 [doi>10.1145/361598.361623]
	32	(Pet85) Petschenik N. H., 1985, <i>Practical Priority in System Testing</i>, IEEE Software, sept 85, Vol 2 n5, p18--23.
	33	(Sch83) Schooman, M. L., 1983, <i>Software Engineering</i>, Mac Graw Hill, Computer Sciences Series, New York.