Sciweavers

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

15

KR
2004
Springer

favoriteEmaildiscussreport

136views Automated Reasoning» more KR 2004»

Condensed Representations for Inductive Logic Programming

13 years 9 months ago

Condensed Representations for Inductive Logic Programming

Download dtai.cs.kuleuven.be

When mining frequent Datalog queries, many queries will be equivalent in the light of an implicit or explicit background knowledge. To alleviate the problem, we introduce various types of condensed representations: clauses that are semantically free or closed w.r.t. a user speciﬁed background theory, as well as δ-free and closed clauses. A novel algorithm that employs these representations is also presented and experimentally evaluated.

Luc De Raedt, Jan Ramon

Real-time Traffic

Artificial Intelligence | Closed Clauses | Explicit Background Knowledge | Frequent Datalog Queries | KR 2004 |

claim paper

Related Content

» Probabilistic Inductive Logic Programming

» Generalized Version Space Trees

» Neurosymbolic Representation of Logic Programs Defining Infinite Sets

» The Parallelization of a Knowledge Discovery System with Hypergraph Representation

» Reasoning with OWLDL in Inductive Logic Programming

» MacroOperators Revisited in Inductive Logic Programming

» Facts and Fallacies in Using Genetic Algorithms for Learning Clauses in FirstOrder Logic

» Inductive Logic Programming for Symbol Recognition

» A discriminative method for familybased protein remote homology detection that combines in...

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	KR
Authors	Luc De Raedt, Jan Ramon

Comments (0)