Searching the subsumption lattice by a genetic algorithm

DOI10.1007/3-540-44960-4_15MaRDI QIDQ4537977zbMATH OpenFDO

Authors Alireza Tamaddoni-Nezhad, Stephen Muggleton

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44960-4_15

Mathematics Subject Classification ID

Logic programming (68N17) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A genetic algorithms approach to ILP
• Inductive Logic Programming
• QG/GA: a stochastic search for Progol
• GeLog -- a system combining genetic algorithm with inductive logic programming
• Facts and fallacies in using genetic algorithms for learning clauses in first-order logic

Cited in

(8)

• QG/GA: a stochastic search for Progol
• The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause
• On the use of stochastic local search techniques to revise first-order logic theories from examples
• Improving inductive logic programming by using simulated annealing
• A genetic algorithms approach to ILP
• Facts and fallacies in using genetic algorithms for learning clauses in first-order logic
• GeLog -- a system combining genetic algorithm with inductive logic programming
• A genetic algorithm for propositionalization

This page was built for publication: Searching the subsumption lattice by a genetic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537977)