Abstract
We provide a precise illustration of what can be the idea of “computational creativity”, that is, the whole set of the methods by which a computer may simulate creativity. This paper is centered on the relationship between computational creativity and theorem proving. The basic tool for this kind of computational creativity is what we call an ‘asset generator’ a specification of which is given in section 5, followed by a short description of our methodology for the generation of assets in theorem proving. In a sense, our ‘asset generation methodology’ relies essentially on making explicit the logician’s good sense while performing a recursion constructive proof. Our contribution is making explicit this good sense and making a systematic methodology of it.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arsac, J., Kodratoff, Y.: Some Techniques for Recursion Removal from Recursive Functions. ACM Transactions on Programming Languages and Systems 4(2), 295–322 (1982)
Bundy, A.: The Automation of Proof by Mathematical Induction. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, pp. 845–912. North-Holland, Amsterdam (2001)
Fraňová, M.: A Construction of Several Definitions Recursive over the Variable under the Exponent for the Exponent function. Rapport de Recherche No.1519, L.R.I., Université de Paris-Sud, Orsay, France (June 2009)
Fraňová, M., Kodratoff, Y., Gross, M.: Constructive Matching Methodology: Formally Creative or Intelligent Inductive Theorem Proving? In: Komorowski, J., Raś, Z.W. (eds.) ISMIS 1993. LNCS (LNAI), vol. 689, pp. 476–485. Springer, Heidelberg (1993)
Fraňová, M., Kodratoff, Y.: La “créativité calculatoire” et les heuristiques créatives en synthèse de prédicats multiples. In: Ganascia, J.-G., Gançarski, P. (eds.) Extraction et gestion des connaissances: EGC 2009, Revue des Nouvelles Technologies de l’Information, RNTI-E-15, Cépadues, pp. 151–162 (2009)
Kodratoff, Y.: A class of functions synthesized from a finite number of examples and a LISP program scheme. International J. of Computational and Information Science 8, 489–521 (1979)
Peter, R.: Recursive Functions. Academic Press, New York (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fraňová, M., Kodratoff, Y. (2009). On Computational Creativity, ‘Inventing’ Theorem Proofs. In: Rauch, J., Raś, Z.W., Berka, P., Elomaa, T. (eds) Foundations of Intelligent Systems. ISMIS 2009. Lecture Notes in Computer Science(), vol 5722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04125-9_60
Download citation
DOI: https://doi.org/10.1007/978-3-642-04125-9_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04124-2
Online ISBN: 978-3-642-04125-9
eBook Packages: Computer ScienceComputer Science (R0)