Sciweavers

Share
KR
2004
Springer

Condensed Representations for Inductive Logic Programming

9 years 2 months ago
Condensed Representations for Inductive Logic Programming
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 specified 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
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where KR
Authors Luc De Raedt, Jan Ramon
Comments (0)
books