Constraint models for reasoning on unification in inductive logic programming

Authors:
Roman Barták
Affiliations:
Charles University in Prague, Faculty of Mathematics and Physics, Praha 1, Czech Republic
Venue:
AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
Year:
2010

Citing 6
Cited 3

On the complexity of some inductive logic programming problems

New Generation Computing - Special issue on inductive logic programming 97
Constraint-Based Scheduling

Constraint-Based Scheduling
Beyond NP: Arc-Consistency for Quantified Constraints

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Building Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Constraint Processing

Constraint Processing
Fast Theta-Subsumption with Constraint Satisfaction Algorithms

Machine Learning

On generating templates for hypothesis in inductive logic programming

MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Algorithmic exploration of axiom spaces for efficient similarity search at large scale

SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Formulating the template ILP consistency problem as a constraint satisfaction problem

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inductive Logic Programming (ILP) deals with the problem of finding a hypothesis covering all positive examples and excluding negative examples. One of the sub-problems is specifying the structure of the hypothesis, that is, the choice of atoms and position of variables in the atoms. In this paper we suggest using constraint satisfaction to describe which variables are unified in the hypotheses. This corresponds to finding the position of variables in atoms. 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.