Sciweavers

Share
ILP
2003
Springer

ILP for Mathematical Discovery

9 years 11 months ago
ILP for Mathematical Discovery
We believe that AI programs written for discovery tasks will need to simultaneously employ a variety of reasoning techniques such as induction, abduction, deduction, calculation and invention. We describe the HR system which performs a novel ILP routine called automated theory formation. This combines inductive and deductive reasoning to form clausal theories consisting of classification rules and association rules. HR generates definitions using a set of production rules, interprets the definitions as classification rules, then uses the success sets of the definitions to induce hypotheses from which it extracts association rules. It uses third party theorem provers and model generators to check whether the association rules are entailed by a set of user supplied axioms. HR has been applied to a range of predictive, descriptive and subgroup discovery tasks in domains of pure mathematics. We describe these applications and how they have led to some interesting mathematical discover...
Simon Colton, Stephen Muggleton
Added 07 Jul 2010
Updated 07 Jul 2010
Type Conference
Year 2003
Where ILP
Authors Simon Colton, Stephen Muggleton
Comments (0)
books