Formulating Template Consistency in Inductive Logic Programming as a Constraint Satisfaction Problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10052077" target="_blank" >RIV/00216208:11320/10:10052077 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Formulating Template Consistency in Inductive Logic Programming 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 a unification of the contained variables such that no negative example is subsumed by the hypothesis and all positive examples are subsumed.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

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

Article name in the collection
Papers from the 2010 AAAI Workshop on Abstraction, Reformulation, and Approximation
ISBN
978-1-57735-474-1
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
—
Publisher name
AAAI
Place of publication
Menlo Park
Event location
Atlanta
Event date
Jul 12, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)