%0 Conference Paper %1 InuzukaKaIs97 %A Inuzuka, Nobuhiro %A Kamo, Masakage %A Ishii, Naohiro %A Seki, Hirohisa %A Itoh, Hidenori %B Proceedings of the 6th International Workshop on Inductive Logic Programming (ILP'96) %D 1997 %I Springer-Verlag %K FOIL-I ilp inductive_programming ip-system program_synthesis recursion %P 265--282 %T Top-down Induction of Logic Programs from Incomplete Samples %U http://dx.doi.org/10.1007/3-540-63494-0_60 %V 1314 %X We propose an ILP system FOIL-I, which induces logic programs by a top-down method from incomplete samples. An incomplete sample is constituted by some of positive examples and negative examples on a finite domain. FOIL-I has an evaluation function to estimate candidate definitions, the function which is composition of an information-based function and an encoding complexity measure. FOILI uses a best-first search using the evaluation function to make use of suspicious but necessary candidates. Other particular points include a treatment for recursive definitions and removal of redundant clauses. Randomly selected incomplete samples are tested with FOIL-I, QuinIan's FOIL and Muggleton's Progol. Compared with others FOIL-I can induce target relations in many cases from small incomplete samples.

@inproceedings{InuzukaKaIs97, abstract = {We propose an ILP system FOIL-I, which induces logic programs by a top-down method from incomplete samples. An incomplete sample is constituted by some of positive examples and negative examples on a finite domain. FOIL-I has an evaluation function to estimate candidate definitions, the function which is composition of an information-based function and an encoding complexity measure. FOILI uses a best-first search using the evaluation function to make use of suspicious but necessary candidates. Other particular points include a treatment for recursive definitions and removal of redundant clauses. Randomly selected incomplete samples are tested with FOIL-I, QuinIan's FOIL and Muggleton's Progol. Compared with others FOIL-I can induce target relations in many cases from small incomplete samples.}, added-at = {2008-12-30T22:51:47.000+0100}, author = {Inuzuka, Nobuhiro and Kamo, Masakage and Ishii, Naohiro and Seki, Hirohisa and Itoh, Hidenori}, biburl = {https://www.bibsonomy.org/bibtex/268b07e0e7bec4af2d6c2ed6bba75a223/emanuel}, booktitle = {Proceedings of the 6th International Workshop on Inductive Logic Programming ({ILP'96})}, interhash = {8ce709453ad449a376e8749f6e590ef7}, intrahash = {68b07e0e7bec4af2d6c2ed6bba75a223}, keywords = {FOIL-I ilp inductive_programming ip-system program_synthesis recursion}, pages = {265--282}, publisher = {Springer-Verlag}, series = {LNCS}, timestamp = {2008-12-30T22:51:48.000+0100}, title = {Top-down Induction of Logic Programs from Incomplete Samples}, url = {http://dx.doi.org/10.1007/3-540-63494-0_60}, volume = 1314, year = 1997 }