This HTML5 document contains 40 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n9http://localhost/temp/predkladatel/
n13http://linked.opendata.cz/resource/domain/vavai/projekt/
n12http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/ontology/domain/vavai/
n16http://linked.opendata.cz/resource/domain/vavai/zamer/
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F10%3A10052053%21RIV11-GA0-11320___/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F10%3A10052053%21RIV11-GA0-11320___
rdf:type
skos:Concept n15:Vysledek
dcterms:description
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 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
dcterms:title
Constraint Models for Reasoning on Unification in Inductive Logic Programming Constraint Models for Reasoning on Unification in Inductive Logic Programming
skos:prefLabel
Constraint Models for Reasoning on Unification in Inductive Logic Programming Constraint Models for Reasoning on Unification in Inductive Logic Programming
skos:notation
RIV/00216208:11320/10:10052053!RIV11-GA0-11320___
n3:aktivita
n4:P n4:Z
n3:aktivity
P(1M0545), P(GA201/08/0509), Z(MSM0021620838)
n3:cisloPeriodika
6304
n3:dodaniDat
n10:2011
n3:domaciTvurceVysledku
n12:8318573
n3:druhVysledku
n19:J
n3:duvernostUdaju
n17:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
251893
n3:idVysledku
RIV/00216208:11320/10:10052053
n3:jazykVysledku
n7:eng
n3:klicovaSlova
Inductive Logic Programming; Unification; Constraint Models
n3:klicoveSlovo
n6:Inductive%20Logic%20Programming n6:Constraint%20Models n6:Unification
n3:kodStatuVydavatele
DE - Spolková republika Německo
n3:kontrolniKodProRIV
[62B9866CE442]
n3:nazevZdroje
Lecture Notes in Computer Science
n3:obor
n18:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n13:1M0545 n13:GA201%2F08%2F0509
n3:rokUplatneniVysledku
n10:2010
n3:svazekPeriodika
2010
n3:tvurceVysledku
Barták, Roman
n3:zamer
n16:MSM0021620838
s:issn
0302-9743
s:numberOfPages
10
n9:organizacniJednotka
11320