Formulating the template ILP consistency problem as a constraint satisfaction problem |
| |
Authors: | Roman Barták Radomír ?ernoch Ond?ej Ku?elka Filip ?elezný |
| |
Affiliation: | 1. Faculty of Mathematics and Physics, Charles University in Prague, Praha 1, Czech Republic 2. Faculty of Electrical Engineering, Czech Technical University in Prague, Praha 1, Czech Republic
|
| |
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: | |
本文献已被 SpringerLink 等数据库收录! |
|