%0 Journal Article %1 Muggleton1991 %A Muggleton, Stephen %D 1991 %J New Generation Computing %K ILP %N 4 %P 295--318 %T Inductive logic programming %U http://dx.doi.org/10.1007/BF03037089 %V 8 %X Abstract  A new research area, Inductive Logic Programming, is presently emerging. While inheriting various positive characteristics of the parent subjects of Logic Programming and Machine Learning, it is hoped that the new area will overcome many of thelimitations of its forebears. The background to present developments within this area is discussed and various goals and aspirationsfor the increasing body of researchers are identified. Inductive Logic Programming needs to be based on sound principles fromboth Logic and Statistics. On the side of statistical justification of hypotheses we discuss the possible relationship betweenAlgorithmic Complexity theory and Probably-Approximately-Correct (PAC) Learning. In terms of logic we provide a unifying frameworkfor Muggleton and Buntine’s Inverse Resolution (IR) and Plotkin’s Relative Least General Generalisation (RLGG) by rederivingRLGG in terms of IR. This leads to a discussion of the feasibility of extending the RLGG framework to allow for the inventionof new predicates, previously discussed only within the context of IR.

@article{Muggleton1991, abstract = {Abstract  A new research area, Inductive Logic Programming, is presently emerging. While inheriting various positive characteristics of the parent subjects of Logic Programming and Machine Learning, it is hoped that the new area will overcome many of thelimitations of its forebears. The background to present developments within this area is discussed and various goals and aspirationsfor the increasing body of researchers are identified. Inductive Logic Programming needs to be based on sound principles fromboth Logic and Statistics. On the side of statistical justification of hypotheses we discuss the possible relationship betweenAlgorithmic Complexity theory and Probably-Approximately-Correct (PAC) Learning. In terms of logic we provide a unifying frameworkfor Muggleton and Buntine’s Inverse Resolution (IR) and Plotkin’s Relative Least General Generalisation (RLGG) by rederivingRLGG in terms of IR. This leads to a discussion of the feasibility of extending the RLGG framework to allow for the inventionof new predicates, previously discussed only within the context of IR.}, added-at = {2009-11-28T13:19:44.000+0100}, author = {Muggleton, Stephen}, biburl = {https://www.bibsonomy.org/bibtex/288b165b16cda5e10d8b4ea9e8fd4a4a1/nicole_koenderink}, description = {fulltext.pdf (application/pdf-object)}, interhash = {7a14bae5fb456f0e93bdacdfb5043245}, intrahash = {88b165b16cda5e10d8b4ea9e8fd4a4a1}, journal = {New Generation Computing}, keywords = {ILP}, month = {#feb#}, number = 4, pages = {295--318}, timestamp = {2009-11-28T13:19:44.000+0100}, title = {Inductive logic programming}, url = {http://dx.doi.org/10.1007/BF03037089}, volume = 8, year = 1991 }