论文信息 - An Incompleteness Result for Deductive Synthesis of Logic Programs

An Incompleteness Result for Deductive Synthesis of Logic Programs

We formalise the derivation of logic programs from their speciications by deductive synthesis, and introduce the notion of uniform equivalence between logical systems. This enables us to present an incompleteness result for deductive synthesis of logic programs from rst-order logic speciications.

Kung-Kiu Lau | Mario Ornaghi | Mario Ornaghi | K. Lau

[1] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.

[2] Lars Hallnäs,et al. A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules , 1990, J. Log. Comput..

[3] Alan Bundy,et al. The Synthesis of Logic Programs from Inductive Proofs , 1990 .

[4] Andrei Voronkov. On Completeness of Program Synthesis Systems , 1991, CSL.

[5] Kung-Kiu Lau,et al. Top-down Synthesis of Recursive Logic Procedures from First-order Logic Specifications , 1990, ICLP.

[6] Christopher J. Hogger,et al. Derivation of Logic Programs , 1981, JACM.

[7] Zohar Manna,et al. A Deductive Approach to Program Synthesis , 1979, TOPL.

[8] Sten-Åke Tärnlund,et al. A Natural Programming Calculus , 1979, IJCAI.

[9] Laurent Fribourg,et al. Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction , 1990, ICLP.

[10] Christopher John Hogger,et al. Introduction to logic programming , 1986, A.P.I.C. Studies in data processing.