Genetic improvement of software: a comprehensive survey

J Petke, SO Haraldsson, M Harman… - IEEE Transactions …, 2017 - ieeexplore.ieee.org
Genetic improvement (GI) uses automated search to find improved versions of existing
software. We present a comprehensive survey of this nascent field of research with a focus …

Top-down synthesis of divide-and-conquer algorithms

DR Smith - Artificial Intelligence, 1985 - Elsevier
A top-down method is presented for the derivation of algorithms from a formal specification
of a problem. This method has been implemented in a system called cypress. The synthesis …

[PDF][PDF] Intelligence artificielle: résolution de problèmes par l'homme et la machine

JL Laurière - 1987 - researchgate.net
Une personne ressent un probleme des qu'elle se trouve dans une situation ou elle désire
quelque chose alors qu'elle ne voit pas immédiatement la suite d'actionsa accomplir pour …

[PDF][PDF] Matings in matrices

W Bibel - Communications of the ACM, 1983 - dl.acm.org
This paper gives an overview of the connection method, developed by the author in
Automated Theorem Proving. Its prominent features are illustrated with a number of …

Achievements and prospects of program synthesis

P Flener - Computational Logic: Logic Programming and Beyond …, 2002 - Springer
Program synthesis research aims at developing a program that develops correct programs
from specifications, with as much or as little interaction as the specifier wants. I overview the …

Artificial intelligence and software engineering

D Barstow - Exploring artificial intelligence, 1988 - Elsevier
Publisher Summary This chapter discusses artificial intelligence (AI) and software
engineering. It reviews the attempts to apply AI techniques to software engineering …

From Schütte's formal systems to modern automated deduction

W Bibel, J Otten - The Legacy of Kurt Schütte, 2020 - Springer
The paper traces the development of a family of high-performance proof systems out of
formal first-order logical systems due to Kurt Schütte. In a first step Schütte's basic classical …

[图书][B] Inductive synthesis of functional programs: universal planning, folding of finite programs, and schema abstraction by analogical reasoning

U Schmid - 2003 - books.google.com
Because of its promise to support human programmers in developing correct and efficient
program code and in reasoning about programs, automatic program synthesis has attracted …

A perspective on automatic programming

DR Barstow - Ai Magazine, 1984 - ojs.aaai.org
Most work in automatic programming has focused primarily on the roles of deduction and
programming knowledge. However, the role played by knowledge of the task domain seems …

Probabilistic logic programming and Bayesian networks

L Ngo, P Haddawy - Asian computing science conference, 1995 - Springer
We present a probabilistic logic programming framework that allows the representation of
conditional probabilities. While conditional probabilities are the most commonly used …