Inductive synthesis of recursive logic programs

Simple item page
buir.supervisorFlener, Pierre
dc.contributor.authorYılmaz, Serap
dc.date.accessioned2016-01-08T20:14:49Z
dc.date.available2016-01-08T20:14:49Z
dc.date.issued1997
dc.descriptionCataloged from PDF version of article.
dc.descriptionAnkara : Department of Computer Engineering and Information Science and the Institute of Engineering and Science of Bilkent University, 1997.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1997.en_US
dc.descriptionIncludes bibliographical references (leaves 69-71).en_US
dc.description.abstractThe learning of recursive logic programs (i.e. the class of logic programs where at least one clause is recursive) from incomplete information, such as input/output examples, is a challenging subfield both of ILP (Inductive Logic Programming) and of the synthesis (in general) of logic programs from formal specifications. This is an extremely important class of logic programs, as the recent work on constructive induction shows that necessarily invented predicates have recursive programs, and it even turns out that their induction is much harder than the one of non-recursive programs. We call this "inductive program synthesis". We introduce a system called DIALOGS-II (Dialogue-based Inductive and Abductive LOgic Program Synthesizer-II) whose ancestor is DIALOGS. It is a schema-guided, interactive, and non-incremental synthesizer of recursive logic programs that takes the initiative and queries a (possibly naive) specifier for evidence in her/his conceptual language. It can be used by any learner (including itself) that detects, or merely conjectures, the necessity of invention of a new predicate. Moreover, due to its powerful codification of "recursion-theory" into program schemata and schematic constraints, it needs very little evidence and is very fast.
dc.description.provenanceMade available in DSpace on 2016-01-08T20:14:49Z (GMT). No. of bitstreams: 1 1.pdf: 78510 bytes, checksum: d85492f20c2362aa2bcf4aad49380397 (MD5)en
dc.description.statementofresponsibilityby Serap Yılmazen_US
dc.format.extentvii, 84 leaves ; 30 cm.en_US
dc.identifier.itemidB038366
dc.identifier.urihttp://hdl.handle.net/11693/17947
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectProgram development
dc.subjectInductive logic programming
dc.subjectAutomatic program synthesis
dc.subjectSchema-guided program synthesis
dc.titleInductive synthesis of recursive logic programsen_US
dc.title.alternativeÖzyineli mantık programlarının tümevarımsal yolla sentezi
dc.typeThesisen_US
thesis.degree.disciplineComputer Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
B038366.pdf
Size:
2.39 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Graduate School of Engineering and Science