Resource-bounded Relational Reasoning: Induction and Deduction Through Stochastic Matching

  • Authors:
  • Michèle Sebag;Céline Rouveirol

  • Affiliations:
  • LMS, CNRS UMR 7649, Ecole Polytechnique, France;LRI, CNRS UMR 8623, Université Paris-Sud, France

  • Venue:
  • Machine Learning - Special issue on multistrategy learning
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

One of the obstacles to widely using first-order logiclanguages is the fact that relational inference is intractable in theworst case. Thispaper presents an any-time relational inferencealgorithm: it proceeds by stochastically sampling theinference search space, after this space has been judiciouslyrestricted using strongly-typed logic-like declarations.We present a relational learner producing programsgeared to stochastic inference, named STILL,to enforce the potentialities of this framework.STILL handles examples described as definite or constrained clauses,and uses sampling-based heuristics again to achieve any-time learning.Controlling both the construction and the exploitation of logic programsyields robust relational reasoning, where deductive biases arecompensated for by inductive biases, and vice versa.