7 Hits in 2.0 sec

ProGolem: A System Based on Relative Minimal Generalisation [chapter]

Stephen Muggleton, José Santos, Alireza Tamaddoni-Nezhad
2010 Lecture Notes in Computer Science  
In particular, we explore variants of Plotkin's Relative Least General Generalisation (RLGG) which are based on subsumption relative to a bottom clause.  ...  In this paper we show that with Asymmetric Relative Minimal Generalisations (or ARMGs) relative to a bottom clause, clause length is bounded by the length of the initial bottom clause.  ...  The second author was supported by a Wellcome Trust Ph.D. scholarship. The third author was supported by the BBSRC grant BB/C519670/1.  ... 
doi:10.1007/978-3-642-13840-9_13 fatcat:4bv7lufphzfghepie46xgqqtmy

Stochastic Refinement [chapter]

Alireza Tamaddoni-Nezhad, Stephen Muggleton
2011 Lecture Notes in Computer Science  
This paper also provided some insights to explain the relative advantages of using stochastic lgg-like operators as in the ILP systems Golem and ProGolem.  ...  We also study a special case of stochastic refinement search where refinement operators are defined with respect to subsumption order relative to a bottom clause.  ...  Acknowledgments We would like to thank the anonymous reviewers for their constructive comments and A. Srinivasan for helpful discussions.  ... 
doi:10.1007/978-3-642-21295-6_26 fatcat:fyhieawhyfc2tm7ivsjioqfqym

SML-Bench -- A Benchmarking Framework for Structured Machine Learning

Patrick Westphal, Lorenz Buhmann, Simon Bin, Hajira Jabeen, Jens Lehmann
2018 Zenodo  
These logic-based, inductive learning methods are often conceptually similar, which would allow a comparison among them even if they stem from different research communities.  ...  With SML-Bench, we propose a benchmarking framework to run inductive learning tools from the ILP and semantic web communities on a selection of learning problems.  ...  Besides this, the tools TopLog [23] and ProGolem [22] which are based on Top Directed Hypothesis Derivation and Asymmetric Relative Minimal Generalisations, respectively, are also part of GILPS and  ... 
doi:10.5281/zenodo.3567901 fatcat:lhjpkfz5fnaf3dg67xggrrcm5m

Logic-based machine learning using a bounded hypothesis space: the lattice structure, refinement operators and a genetic algorithm approach

Alireza Tamaddoni Nezhad, Stephen H. Muggleton
Finally, ILP algorithms and implementations which are based on this framework are describ [...]  ...  We also show that ideal refinement operators exist for bounded subsumption and that, by contrast with general subsumption, efficient least and minimal generalisation operators can be designed for bounded  ...  based on Asymmetric Relative Minimal Generalisation (ARMG) which are implemented in ProGolem.  ... 
doi:10.25560/29849 fatcat:kgzoveed45fv7dneirx7ef5dqu

Efficient Learning and Evaluation of Complex Concepts in Inductive Logic Programming

Jose Carlos Almeida Santos Santos, Stephen Muggleton, Michael Sternberg, Wellcome Trust
These developments led to the bottom-up ILP system ProGolem. A challenge that arises with a bottom-up approach is the coverage computation of long, non-determinate, clauses.  ...  However, this flexibility comes at a high computational cost, constraining the applicability of ILP systems.  ...  "ProGolem: a system based on relative minimal generalisation" [MSTN09] presented at the 19th International Conference on Inductive Logic Programming (ILP09).  ... 
doi:10.25560/6409 fatcat:yom47vguibeu3gtqszlspoel7i

Logic Programs as Declarative and Procedural Bias in Inductive Logic Programming

Dianhuan Lin, Stephen Muggleton, Syngenta
We show in this thesis that using a logic program called the top theory as declarative bias leads to a sound and complete multi-clause learning system MC-TopLog.  ...  A higher-order extension on top theories results in meta-interpreters, which allow the introduction of new predicate symbols.  ...  Thus ASP MR does not use iterative deepening on the clause bound like that in Metagol R for finding a global minimal hypothesis.ASP MCF Similar to Metagol CF , the ASP MCF system is based on a variant  ... 
doi:10.25560/24553 fatcat:hx5en3belbbqripxp6zxamk7dq

LIPIcs, Volume 7, ICLP'10, Complete Volume [article]

Manuel Hermenegildo, Torsten Schaub
Open Issues and Expected Achievements Future work includes a comparison between the different ASP solver and systems wrt our encodings.  ...  As stated in [15], the encodings are adequate from a complexity point of view. One major advantage of ASPARTIX is that it is independent from the concrete AF to process.  ...  like other inverse entailment (IE) based systems, abductively derives a lower bound for the search space that is then generalised.  ... 
doi:10.4230/lipics.iclp.2010 fatcat:j7jd7dpsffbs7plm5qa6qi2wem