Computing Publications

Publications Home » Searching the Subsumption Lattice...

Searching the Subsumption Lattice by a Genetic Algorithm

Alireza Tamaddoni Nezhad, Stephen Muggleton

Conference or Workshop Paper
10th International Conference on Inductive Logic Programming
pp.243–252
2000
DOI 10.1007/3-540-44960-4_15
Abstract

A framework for combining Genetic Algorithms with ILP methods is introduced and a novel binary representation and relevant genetic operators are discussed. It is shown that the proposed representation encodes a subsumption lattice in a complete and compact way. It is also shown that the proposed genetic operators are meaningful and can be interpreted in ILP terms such as lgg(least general generalization) and mgi(most general instance). These operators can be used to explore a subsumption lattice efficiently by doing binary operations (e.g. and/or). An implementation of the proposed framework is used to combine Inverse Entailment of CProgol with a genetic search.

BibTEX file for the publication
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.