Name
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.
|
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-04125-9_60 | ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems |
Keywords | Field | DocType |
theorem proving,computational creativity,short description,recursion constructive proof,systematic methodology,asset generation methodology,good sense,Theorem Proofs,basic tool,Computational Creativity,asset generator,precise illustration | Constructive proof,Domain knowledge,Computer science,Sequence,Automated theorem proving,Mathematical proof,Artificial intelligence,Creativity,Machine learning,Calculus,Recursion,Computational creativity | Conference |
Volume | ISSN | Citations |
5722 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marta Franová | 1 | 22 | 5.53 |
| Yves Kodratoff | 2 | 581 | 172.25 |