Top-down synthesis of divide-and-conquer algorithms
Artificial Intelligence
Algorithmic debugging with assertions
Meta-programming in logic programming
Monotonic and non-monotonic inductive inference
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Polynomial-time inference of arbitrary pattern languages
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Belief updating from integrity constraints and queries
Artificial Intelligence
Synthesis of composition and discrimination operators for divide-and-conquer logic programs
Constructing logic programs
A Methodology for LISP Program Construction from Examples
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Verification of Prolog Programs Using an Extension of Execution
Proceedings of the Third International Conference on Logic Programming
Logic Program Synthesis in a Higher-Order Setting
CL '00 Proceedings of the First International Conference on Computational Logic
CL '00 Proceedings of the First International Conference on Computational Logic
| Hi-index | 0.00 |
We develop a framework for stepwise synthesis of logic programs from incomplete specifications. After the definition of logic formalisms for specifications and programs, logic program correctness and comparison criteria are proposed. Then we define criteria for upward and downward progression, in order to state strategies for incremental and non-incremental stepwise synthesis. It is shown how these strategies can be applied in practice. Finally, we instantiate the framework on a particular synthesis mechanism that we have developed. Our synthesis system, called SYNAPSe, is non-incremental, both deductive and inductive, and guided by a divide-and-conquer schema. We describe the objectives and methods of the crucial steps, and illustrate them on a sample problem.