Paper Info
Title
Logic programming and program synthesis
Abstract
Well-known theoretical arguments proving that logic programming does not eliminate the problem of transforming a specification into an executable program are presented and illustrated. PS (program synthesis) is therefore still a real problem to be faced by AI (artificial intelligence) research since complete automation of a PS tool is still far off, especially for long, complicated specifications such as those usually met in practice. It is shown how it is quite possible to write down specifications in Prolog. Nevertheless, it is pointed out that well-known theoretical reasons limit this possibility, and a detailed analysis of the practical reasons why a formal specification may be hard to program in Prolog is provided. The present work contributes to the clarification of the exact role of PS in AI and in software engineering and its possible application to software certification
Year
DOI
Venue
1990
10.1109/ICSI.1990.138700
Morristown, NJ
Keywords
Field
DocType
artificial intelligence,formal specification,logic programming,program verification,Prolog,artificial intelligence,executable program,formal specification,logic programming,program synthesis,software certification,software engineering
Programming language,Software engineering,Program synthesis,Computer science,Formal specification,Automation,Prolog,Logic programming,Application software,Certification,Executable
Conference
ISBN
Citations 
PageRank 
0-8186-9027-5
0
0.34
References 
Authors
6
3
Name
Order
Citations
PageRank
Yves Kodratoff1581172.25
Marta Fraňová2101.47
Derek Partridge393.85