Constraints

, Volume 18, Issue 2, pp 144–165

Formulating the template ILP consistency problem as a constraint satisfaction problem

  • Roman Barták
  • Radomír Černoch
  • Ondřej Kuželka
  • Filip Železný
Article

DOI: 10.1007/s10601-013-9141-7

Cite this article as:
Barták, R., Černoch, R., Kuželka, O. et al. Constraints (2013) 18: 144. doi:10.1007/s10601-013-9141-7
  • 149 Downloads

Abstract

Inductive Logic Programming (ILP) deals with the problem of finding a hypothesis covering positive examples and excluding negative examples, where both hypotheses and examples are expressed in first-order logic. In this paper we employ constraint satisfaction techniques to model and solve a problem known as template ILP consistency, which assumes that the structure of a hypothesis is known and the task is to find unification of the contained variables. In particular, we present a constraint model with index variables accompanied by a Boolean model to strengthen inference and hence improve efficiency. The efficiency of models is demonstrated experimentally.

Keywords

Constraint modeling Inductive logic programming Meta-reasoning 

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Roman Barták
    • 1
  • Radomír Černoch
    • 2
  • Ondřej Kuželka
    • 2
  • Filip Železný
    • 2
  1. 1.Faculty of Mathematics and PhysicsCharles University in PraguePraha 1Czech Republic
  2. 2.Faculty of Electrical EngineeringCzech Technical University in PraguePraha 1Czech Republic

Personalised recommendations