Flener, Pierre2016-02-082016-02-081996-080302-9743http://hdl.handle.net/11693/27710Date of Conference: 26-28 August, 1996Conference name: International Conference on Inductive Logic Programming 6th International Workshop, ILP-96DIALOGS (Dialogue-based Inductive and Abductive LOGic program Synthesizer) is a schema-guided synthesizer of recursive logic programs; it takes the initiative and queries a (possibly computationally naive) specifier for evidence in her/his conceptual language. The specifier must know the answers to such simple queries, because otherwise s/he wouldn't even feel the need for the synthesized program. DIALOGS call be used by any learner (including itself) that detects, or merely conjectures, the necessity of invention of a new predicate. Due to its foundation on a powerful codification of a “recursion-theory” (by means of the template and constraints of a divide-and-conquer schema), DIALOGS needs very little evidence and is very fast. © Springer-Vertag Berlin Heidelberg 1997.EnglishFormal logicLogic programmingAbductive logic programsDivide and conquerInductive logicLogic programsRecursion theoryInductive logic programming (ILP)Conference Paper10.1007/3-540-63494-0_55