Formulating the template ILP consistency problem as a constraint satisfaction problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10194756" target="_blank" >RIV/00216208:11320/13:10194756 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21230/13:00213294
Result on the web
<a href="http://dx.doi.org/10.1007/s10601-013-9141-7" target="_blank" >http://dx.doi.org/10.1007/s10601-013-9141-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10601-013-9141-7" target="_blank" >10.1007/s10601-013-9141-7</a>

Result language
angličtina
Original language name
Formulating the template ILP consistency problem as a constraint satisfaction problem
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)