838 search results - page 153 / 168 » From Natural Language to Formal Proof Goal |
COMPSAC
2000
IEEE
13 years 11 months ago
2000
IEEE
Genetic programming tackles the issue of how to automatically create a working computer program for a given problem from some initial problem statement. The goal is accomplished i...
AISC
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. We present a personal view and strategy for algorithm-supported mathematical theory exploration and draw some conclusions for the desirable functionality of future mathem...
ICALP
2004
Springer
14 years 23 days ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
ALT
2004
Springer
14 years 4 months ago
2004
Springer
Different formal learning models address different aspects of learning. Below we compare learning via queries—interpreting learning as a one-shot process in which the learner i...
WWW
2003
ACM
14 years 8 months ago
2003
ACM
The binary form of an image does not tell what the image is about. It is possible to retrieve images from a database using pattern matching techniques, but usually textual descript...