Taming the Complexity of Inductive Logic Programming (invited talk)
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F10%3A00165074" target="_blank" >RIV/68407700:21230/10:00165074 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Taming the Complexity of Inductive Logic Programming (invited talk)
Original language description
We review our recent research aimed at conquering two sources of complexity of inductive logic programming: the clause subsumption problem and the clause search problem.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
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)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
SOFSEM 2010: Theory and Practice of Computer Science, vol.1
ISBN
978-3-642-11265-2
ISSN
0302-9743
e-ISSN
—
Number of pages
9
Pages from-to
—
Publisher name
Springer
Place of publication
Heidelberg
Event location
Spindleruv Mlýn
Event date
Jan 23, 2010
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
000280086900011