Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

SOFSEM
2010
Springer

favoriteEmaildiscussreport

115views Theoretical Computer Science» more SOFSEM 2010»

Taming the Complexity of Inductive Logic Programming

14 years 1 months ago

Taming the Complexity of Inductive Logic Programming

Download www.sofsem.cz

Filip Zelezný, Ondrej Kuzelka

Real-time Traffic

SOFSEM 2010 | Theoretical Computer Science |

claim paper

Related Content

» Low SizeComplexity Inductive Logic Programming The EastWest Challenge Considered as a Prob...

» Taming the Infinite Chase Query Answering under Expressive Relational Constraints

» Programming by Demonstration An Inductive Learning Formulation

» A Marriage of RelyGuarantee and Separation Logic

» Incremental Identification of Qualitative Models of Biological Systems using Inductive Log...

» Inductive Logic Programming for Symbol Recognition

» Learning Optimal Dialogue Management Rules by Using Reinforcement Learning and Inductive L...

» The Boundary Between Decidability and Undecidability for TransitiveClosure Logics

» Realizability models and implicit complexity

Post Info
More Details (n/a)

Added	17 Mar 2010
Updated	17 Mar 2010
Type	Conference
Year	2010
Where	SOFSEM
Authors	Filip Zelezný, Ondrej Kuzelka

Comments (0)