Abstract
In this paper, we present mfd2, a deductive database for mathematical formulas. The database itself is a stand-alone program which can run as a server in a client/server environment and it has been designed to be a powerful assistant for computer algebra systems as well as for other applications. For example, mfd2 could be used in an electronic handbook of mathematical relations or as a lemma database for a theorem prover. The information stored in the database is accessed through a specialized query language. At the heart of mfd2 is a deduction engine based on an algorithm for associate-commutative unification that takes care of the conditions associated with the formulas.
Preview
Unable to display preview. Download preview PDF.
References
The draft OpenMath home page on the World Wide Web. http://www.can.nl/∼abbott/OpenMath/index.html.
Milton Abramowitz and Irene A. Stegun. Handbook of Mathematical Functions. Dover, 1970.
Alexandre Boudet, Jean-Pierre Jouannaud, and Manfred Schmidt-Schauss. Unification in boolean rings and abelian groups. Journal of Symbolic Computation, 8:449–477, 1989.
Jim Christian. Flatterms, discrimination nets and fast term rewriting. Journal of Automated Reasoning, 10:95–113, 1993.
Jim Christian and Patrick Lincoln. Adventures in associative-commutative unification. Journal of Symbolic Computation, 8:217–240, 1989.
E.M. Clarke and X. Zhao. Analytica — a theorem prover for mathematica. The Mathematica Journal, 3(1):56–71, 1993.
Richard J. Fateman and T. H. Einwohner. Searching techniques for integral tables. submitted to ISSAC'95, 1995.
Claus Hintermeier, Claude Kirchner, and Hélène Kirchner. Dynamically-typed computations for order-sorted equational presentations. Research Report 2208, INRIA, 1994.
Richard D. Jenks. A pattern compiler. In Proceeding of the 1976 Symposium on Symbolic and Algebraic Manipulation, pages 60–65. ACM Press, August 1976.
Jean-Pierre Jouannaud and Claude Kirchner. Computational logic: essays in honnor of Alan Robinson, chapter Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification. The MIT press, 1991.
Hélène Kirchner. Some extensions of rewriting. In Term Rewriting, French Spring School of Theoretical Computer Science, volume 909, pages 54–73. Springer-Verlag, LNCS, 1993.
William McCune. Experiments with discrimination-tree indexing and path indexing for term retrieval. Journal of Automated Reasoning, 9:147–167, 1992.
Peter Norvig. Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp, pages 472–483. Morgan Kaufmann, 1992.
William Y. Sit. An algorithm for solving parametric linear systems. Journal of Symbolic Computation, 13:353–394, 1992.
Laurent Vigneron. Déduction Automatique avec Contraintes Symboliques dans les Théories Équationnelles. PhD thesis, Université de Nancy 1, 1994.
Trudy Weibel and Gaston H. Gonnet. An assume facility for cas, with a sample implementation for maple. In Design and Implementation of Symbolic Computation Systems, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dalmas, S., Gaëtano, M., Huchet, C. (1996). A deductive database for mathematical formulas. In: Calmet, J., Limongelli, C. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1996. Lecture Notes in Computer Science, vol 1128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61697-7_30
Download citation
DOI: https://doi.org/10.1007/3-540-61697-7_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61697-9
Online ISBN: 978-3-540-70635-9
eBook Packages: Springer Book Archive