Inductive synthesis of recursive logic programs: achievements and prospects

Flener, Pierre; Yıilmaz, Serap

doi:10.1016/s0743-1066(99)00028-x

Cited by 35 publications

(36 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our approach to the abduction of inductive definitions is close in spirit, if not so much in execution, to inductive recursion synthesis in AI (for a survey see [16]). The main novelties of our approach, compared to this technique, are: (a) that we abduce Hoare-style preconditions for imperative programs in separation logic, rather than inputs to functional programs in first-order logic; and (b) that we employ a cyclic proof search to abduce induction schemas.…”

Section: Related Workmentioning

confidence: 99%

Cyclic Abduction of Inductively Defined Safety and Termination Preconditions

Brotherston

Gorogiannis

2014

Static Analysis

View full text Add to dashboard Cite

Abstract. We introduce cyclic abduction: a new method for automatically inferring safety and termination preconditions of heap-manipulating while programs, expressed as inductive definitions in separation logic. Cyclic abduction essentially works by searching for a cyclic proof of the desired property, abducing definitional clauses of the precondition as necessary in order to advance the proof search process. We provide an implementation, Caber, of our cyclic abduction method, based on a suite of heuristically guided tactics. It is often able to automatically infer preconditions describing lists, trees, cyclic and composite structures which, in other tools, previously had to be supplied by hand.

show abstract

Section: Related Workmentioning

confidence: 99%

Cyclic Abduction of Inductively Defined Safety and Termination Preconditions

Brotherston

Gorogiannis

2014

Static Analysis

View full text Add to dashboard Cite

show abstract

“…Target programs are typically declarative -mostly functional (Kitzelmann, 2009;Olsson, 1995), sometimes logical (Quinlan and CameronJones, 1995;Flener and Yilmaz, 1999). Specifications are typically given in the form of input/output examples for the desired behavior of the target program.…”

Section: Introductionmentioning

confidence: 99%

Evolutionary Programming Guided by Analytically Generated Seeds

Crossley¹,

Kitzelmann²,

Hofmann³

et al. 2009

Proceedings of the International Joint Conference on Computational Intelligence

View full text Add to dashboard Cite

Abstract:Evolutionary programming is the most powerful method for inducing recursive functional programs from input/output examples while taking into account efficiency and complexity constraints for the target program. However, synthesis time can be considerably high. A strategy which is complementary to the generate-and -test based approaches of evolutionary programming is inductive analytical programming where program construction is example-driven, that is, target programs are constructed as minimal generalization over the given input/output examples. Synthesis with analytical approaches is fast, but the scope of synthesizable programs is restricted. We propose to combine both approaches in such a way that the power of evolutionary programming is preserved and synthesis becomes more efficient. We use the analytical system IGOR2 to generate seeds in form of program skeletons to guide the evolutionary system ADATE when searching for target programs. In an evaluations with several examples we can show that using such seeds indeed can speed up evolutionary programming considerably.

show abstract

“…Finally, Mofizur and Numao [23] adopt a top-down approach to learning recursive programs with only one recursive clause. A thorough overview of achievements in the inductive synthesis of recursive logic programs can be found in [15].…”

Section: Introductionmentioning

confidence: 99%

Induction of Recursive Theories in the Normal ILP Setting: Issues and Solutions

Esposito

Malerba

Lisi

2000

Inductive Logic Programming

View full text Add to dashboard Cite

Abstract. Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solutions to some relevant issues raised by the multiple predicate learning problem. A separate-and-parallel-conquer search strategy is adopted to interleave the learning of clauses supplying predicates with mutually recursive definitions. A novel generality order to be imposed to the search space of clauses is investigated in order to cope with recursion in a more suitable way. The consistency recovery is performed by reformulating the current theory and by applying a layering technique based on the collapsed dependency graph. The proposed approach has been implemented in the ILP system ATRE and tested in the specific context of the document understanding problem within the WISDOM project. Experimental results are discussed and future directions are drawn.

show abstract

Inductive synthesis of recursive logic programs: achievements and prospects

Cited by 35 publications

References 53 publications

Cyclic Abduction of Inductively Defined Safety and Termination Preconditions

Cyclic Abduction of Inductively Defined Safety and Termination Preconditions

Evolutionary Programming Guided by Analytically Generated Seeds

Induction of Recursive Theories in the Normal ILP Setting: Issues and Solutions

Contact Info

Product

Resources

About