Inductive logic program synthesis with dialogs
Lecture Notes in Computer Science
175 - 198
Item Usage Stats
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27710
DIALOGS (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.
Abductive logic programs
Divide and conquer
Inductive logic programming (ILP)
Showing items related by title, author, creator and subject.
Sabuncu, O.; Alpaslan, F. N.; Akman, V. (Springer, 2004)Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic programs. During the computation of an answer set, systems ...
Uzun, Y.; Cicekli I. (2007)Learning logical relations from examples expressed as first order facts has been studied extensively by the Inductive Logic Programming research. Learning with positive-only data may cause over generalization of examples ...
Büyükyıldız, H.; Flener, P. (Springer, 1998)Schema-based logic program transformation has proven to be an eective technique for the optimisation of programs. This paper results from the research that began by investigating the suggestions in  to construct a more ...