QG/GA: a stochastic search for Progol

DOI10.1007/S10994-007-5029-3zbMath1470.68217OpenAlexW2018206481MaRDI QIDQ1009231

Alireza Tamaddoni-Nezhad, Stephen H. Muggleton

Publication date: 31 March 2009

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-007-5029-3

zbMATH Keywords

genetic algorithmsrefinementstochastic search

Mathematics Subject Classification ID

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

Related Items (2)

On the use of stochastic local search techniques to revise first-order logic theories from examples ⋮ MetaBayes: Bayesian Meta-Interpretative Learning Using Higher-Order Stochastic Refinement

Uses Software

• GOLEM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension
• Resource-bounded relational reasoning: Induction and deduction through stochastic matching
• 10.1162/153244304773936009
• 10.1162/153244304773936018
• ILP Through Propositionalization and Stochastic k-Term DNF Learning
• Inductive Logic Programming
• Inductive Logic Programming

This page was built for publication: QG/GA: a stochastic search for Progol