About: Constraint Models for Reasoning on Unification in Inductive Logic Programming     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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 (en)
Title
  • Constraint Models for Reasoning on Unification in Inductive Logic Programming
  • Constraint Models for Reasoning on Unification in Inductive Logic Programming (en)
skos:prefLabel
  • Constraint Models for Reasoning on Unification in Inductive Logic Programming
  • Constraint Models for Reasoning on Unification in Inductive Logic Programming (en)
skos:notation
  • RIV/00216208:11320/10:10052053!RIV11-GA0-11320___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), P(GA201/08/0509), Z(MSM0021620838)
http://linked.open...iv/cisloPeriodika
  • 6304
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 251893
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/10:10052053
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Inductive Logic Programming; Unification; Constraint Models (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV
  • [62B9866CE442]
http://linked.open...i/riv/nazevZdroje
  • Lecture Notes in Computer Science
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 2010
http://linked.open...iv/tvurceVysledku
  • Barták, Roman
http://linked.open...n/vavai/riv/zamer
issn
  • 0302-9743
number of pages
http://localhost/t...ganizacniJednotka
  • 11320
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 9 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software