Filters








43,456 Hits in 3.3 sec

Inductive synthesis of recursive logic programs: achievements and prospects

Pierre Flener, Serap Yıilmaz
1999 The Journal of Logic Programming  
The inductive synthesis of recursive logic programs from incomplete information, such as input/output examples, is a challenging sub®eld both of Inductive Logic Programming (ILP) and of the synthesis (  ...  We ®rst overview past and present achievements, focusing on the techniques that were designed specifically for the inductive synthesis of recursive logic programs but also discussing a few general ILP  ...  Acknowledgements The ®rst author thanks some of the ILP L P '96 and LOPSTR O P S T R '96 participants for stimulating discussions on the feasibility, necessity, and future of the inductive synthesis of  ... 
doi:10.1016/s0743-1066(99)00028-x fatcat:fjeye5sk2ngkvgiwhuykzy2z7e

Middle-Out Reasoning for Synthesis and Induction [chapter]

Ina Kraan, David Basin, Alan Bundy
1996 Automated Mathematical Induction  
We propose a novel approach to automating the synthesis of logic programs: Logic programs are synthesized as a by-product of the planning of a veri cation proof.  ...  The approach is a two-level one: At the object level, we prove program veri cation conjectures in a sorted, rst-order theory. The conjectures are of the form 8args ????! : prog(args ????!  ...  Section 2 of this paper discusses related work in program synthesis and selecting induction schemes for synthesis proofs. Section 3 contains a de nition of pure logic programs.  ... 
doi:10.1007/978-94-009-1675-3_4 fatcat:hlrfxol3oreppivyqvd5k7rzyy

Logic program synthesis

Yves Deville, Kung-Kiu Lau
1994 The Journal of Logic Programming  
> This paper presents an overview and a survey of logic program synthesis.  ...  Three main approaches to logic program synthesis by formal methods are described: constructive synthesis, deductive s y n thesis and inductive synthesis.  ...  We also thank Pierre Flener and Geraint Wiggins for reading the draft and for their helpful remarks.  ... 
doi:10.1016/0743-1066(94)90029-9 fatcat:jhxu3lq5yndb7o433tmx4acyqa

Logic Program Synthesis via Proof Planning [chapter]

Ina Kraan, David Basin, Alan Bundy
1993 Logic Program Synthesis and Transformation  
We propose a novel approach to automating the synthesis of logic programs: Logic programs are synthesized as a by-product of the planning of a verification proof.  ...  Clam is currently powerful enough to plan verification proofs for given programs. We show that, if Clam's use of middle-out reasoning is extended, it will also be able to synthesize programs.  ...  Introduction The aim of the work presented here is to automate the synthesis of logic programs.  ... 
doi:10.1007/978-1-4471-3560-9_1 dblp:conf/lopstr/KraanBB92 fatcat:4b3jreifvnfx7elt4jmdypyjdi

On the use of inductive reasoning in program synthesis: Prejudice and prospects [chapter]

Pierre Flener, Lubos Popelínský
1994 Lecture Notes in Computer Science  
In this position paper, we give a critical analysis of the deductive and inductive approaches to program synthesis, and of the current research in these fields.  ...  From the shortcomings of these approaches and works, we identify future research directions for these fields, as well as a need for cooperation and cross-fertilization between them. 1.  ...  The first author also benefitted from the feedback of the students of his Automatic Program Synthesis course at Bilkent University.  ... 
doi:10.1007/3-540-58792-6_5 fatcat:bbpgkfzu7jchbntdh3veq4nkna

Middle-out reasoning for synthesis and induction

Ina Kraan, David Basin, Alan Bundy
1996 Journal of automated reasoning  
We develop two applications of middle-out reasoning in inductive proofs: Logic program synthesis and the selection of induction schemes.  ...  Middle-out reasoning is used for synthesis by planning the veri cation of an unknown logic program: The program body is represented with a metavariable.  ...  Acknowledgements We would like to thank Sophie Renault for her careful reading of this paper. 25  ... 
doi:10.1007/bf00244461 fatcat:ecba53gmabh7zplgxteiy5yu5e

Logic Program Synthesis in a Higher-Order Setting [chapter]

David Lacey, Julian Richardson, Alan Smail
2000 Lecture Notes in Computer Science  
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations.  ...  The generality of the approach is such that its extension to allow synthesis of higher-order logic programs was straightforward. Some illustrative examples are given.  ...  The research was supported by EPSRC grant GR/M45030, and EPSRC funding for David Lacey's MSc in Artificial Intelligence.  ... 
doi:10.1007/3-540-44957-4_6 fatcat:24o64zh5abdero5uagownflvka

Page 2911 of Mathematical Reviews Vol. , Issue 2000d [page]

2000 Mathematical Reviews  
Summary: “The inductive synthesis of recursive logic programs from incomplete information, such as input/output examples, is a challenging subfield both of inductive logic programming (ILP) and of the  ...  (I-CNR-ASI; Rome) Synthesis and transformation of logic programs using unfold/fold proofs.  ... 

Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes [chapter]

Andreas Hamfelt, Jørgen Fischer Nilsson
1999 Lecture Notes in Computer Science  
Keywords: logic program schemata, logical combinators, synthesis by composition and specialization of schemas, inductive synthesis, metalogic program environment. P. Flener (Ed.): LOPSTR'98  ...  Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic programs from examples.  ...  Sect. 4 outlines a methodology and environment for inductive synthesis of logic program using the combinatory form.  ... 
doi:10.1007/3-540-48958-4_8 fatcat:ndvfpzjkb5gkxgzeujadumtr34

Approaches and Applications of Inductive Programming (Dagstuhl Seminar 17382)

Ute Schmid, Stephen H. Muggleton, Rishabh Singh, Marc Herbstritt
2018 Dagstuhl Reports  
This report documents the program and the outcomes of Dagstuhl Seminar 17382 "Approaches and Applications of Inductive Programming".  ...  After a short introduction to the state of the art to inductive programming research, an overview of the introductory tutorials, the talks, program demonstrations, and the outcomes of discussion groups  ...  H-O was visiting the Leverhulme Centre for the Future of Intelligence, generously funded by the Leverhulme Trust.  ... 
doi:10.4230/dagrep.7.9.86 dblp:journals/dagstuhl-reports/SchmidMS17 fatcat:dn76mje45bhqrnevejun4qp3ku

The use of proof plans in formal methods [chapter]

Alan Bundy
1990 Lecture Notes in Computer Science  
Program Synthesis using Theorem Proving We are concerned with the synthesis of logic/functional programs in the Nuprl style, [Constable et al 86] .  ...  We are, therefore, particularly interested in inductive proofs. The program is a logic/functional program in the Type Theory logic.  ... 
doi:10.1007/3-540-52531-9_134 fatcat:nscg74jqg5gb5mr2wr2hh4h4gi

Guest editors' introduction Special Issue: synthesis, transformation and analysis of logic programs 2

Annalisa Bossi, Yves Deville
1999 The Journal of Logic Programming  
The ®rst paper, Inductive synthesis of recursive logic programs: achievements and prospects, by Pierre Flener and Serap Yõlmaz overviews the achievements of inductive synthesis of logic programs from incomplete  ...  This volume contains the second part of the Special Issue on Synthesis, Transformation and Analysis of Logic Programs. The ®rst part on program analysis appeared in Vol 39(1±3).  ...  second paper of this volume Synthesis and transformation of logic programs using unfold/fold proofs by Alberto Pettorossi and Maurizio Proietti.  ... 
doi:10.1016/s0743-1066(99)00027-8 fatcat:tjzp4frx7beozeujr7ndjxa3iu

The Synthesis of Logic Programs from Inductive Proofs [chapter]

Alan Bundy, Alan Smaill, Geraint Wiggins
1990 Computational Logic  
To make the technique work it is necessary to synthesise pure logic programs, without the closed world assumption, and then compile these into Prolog programs.  ...  The program is synthesised as a function in this mode and then run in other modes.  ...  In this paper we discuss how to adapt a technique for synthesising functional programs from logical specifications to the synthesis of logic programs.  ... 
doi:10.1007/978-3-642-76274-1_8 fatcat:ivjrryme2ncvbnx3vhtnf35sbu

Page 93 of University Computing : The Bulletin of the IUCC Vol. 12, Issue 3 [page]

1990 University Computing : The Bulletin of the IUCC  
The ability to construct examples automatically is the intelligent behaviour of an inductive program synthesis system.  ...  Horn clause logic provides an ideal framework for the investigation of logic-based induction. A good deal of previous work can be rephrased in the language.  ... 

Generic system support for deductive program development [chapter]

Abdelwaheb Ayari, David A. Basin
1996 Lecture Notes in Computer Science  
We report on a case study in using logical frameworks to support the formalization of programming calculi and their application to deduction-based program synthesis.  ...  Within a conservative extension of higher-order logic implemented in the Isabelle system, we derived rules for program development that can simulate those of the deductive tableau proposed by Manna and  ...  ,,pg, de the synthesis of functional programs.  ... 
doi:10.1007/3-540-61042-1_52 fatcat:c7xvlbxl6zfybgt2rutkwuedg4
« Previous Showing results 1 — 15 out of 43,456 results