Experiments with a Heuristic Compiler
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Automatic Theorem Proving With Renamable and Semantic Resolution
Journal of the ACM (JACM)
Experiments with a deductive question-answering program
Communications of the ACM
The use of theorem-proving techniques in question-answering systems
ACM '68 Proceedings of the 1968 23rd ACM national conference
LISP 1.5 Programmer's Manual
Speeding up the Synthesis of Programs from Traces
IEEE Transactions on Computers
A Hole in Goal Trees: Some Guidance from Resolution Theory
IEEE Transactions on Computers
Challenge to artificial intelligence: programming problems to be solved
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Automatic program synthesis from example problems
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Knowledge and reasoning in program synthesis
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Towards an Operational Semantics for Alloy
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Finding resolution proofs and using duplicate goals in and/or trees
Information Sciences: an International Journal
The deductive synthesis of imperative LISP programs
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
The deductive synthesis of imperative LISP programs
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
| Hi-index | 0.01 |
This paper Describes a program, called "PROW", which writes programs PROW accepts the specification of the program in the language of predicate calculus, decides the algorithm for the program and then produces a LISP program which is an implementation of the algorithm. Since the construction of the algorithm is obtained by formal theorem-proving techniques, the programs that PROW writes are free from logical errors and do not have to be debugged The user of PROW can make PROW write programs in languages other than LISP by modifying the part of PROW that translates an algorithm to a LISP program. Thus PROW can be modified to write programs in any language In the end of this paper, it is shown that PROW can also be used as a question-answering program