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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F10%3A10052077%21RIV11-GA0-11320___
rdf:type
n5:Vysledek skos:Concept
dcterms: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. 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.
dcterms:title
Formulating Template Consistency in Inductive Logic Programming as a Constraint Satisfaction Problem Formulating Template Consistency in Inductive Logic Programming as a Constraint Satisfaction Problem
skos:prefLabel
Formulating Template Consistency in Inductive Logic Programming as a Constraint Satisfaction Problem Formulating Template Consistency in Inductive Logic Programming as a Constraint Satisfaction Problem
skos:notation
RIV/00216208:11320/10:10052077!RIV11-GA0-11320___
n4:aktivita
n7:Z n7:P
n4:aktivity
P(1M0545), P(GA201/08/0509), Z(MSM0021620838)
n4:dodaniDat
n16:2011
n4:domaciTvurceVysledku
n18:8318573
n4:druhVysledku
n20:D
n4:duvernostUdaju
n10:S
n4:entitaPredkladatele
n15:predkladatel
n4:idSjednocenehoVysledku
259596
n4:idVysledku
RIV/00216208:11320/10:10052077
n4:jazykVysledku
n19:eng
n4:klicovaSlova
Constraint Satisfaction; Inductive Logic Programming; Template Consistency
n4:klicoveSlovo
n13:Constraint%20Satisfaction n13:Inductive%20Logic%20Programming n13:Template%20Consistency
n4:kontrolniKodProRIV
[23664421DDB3]
n4:mistoKonaniAkce
Atlanta
n4:mistoVydani
Menlo Park
n4:nazevZdroje
Papers from the 2010 AAAI Workshop on Abstraction, Reformulation, and Approximation
n4:obor
n11:IN
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
3
n4:projekt
n22:GA201%2F08%2F0509 n22:1M0545
n4:rokUplatneniVysledku
n16:2010
n4:tvurceVysledku
Barták, Roman Kuželka, Ondřej Železný, Filip
n4:typAkce
n21:WRD
n4:zahajeniAkce
2010-07-12+02:00
n4:zamer
n9:MSM0021620838
s:numberOfPages
6
n8:hasPublisher
AAAI
n12:isbn
978-1-57735-474-1
n14:organizacniJednotka
11320