Abstract
An inductive database allows one to query not only the data but also the patterns of interest. A novel framework, called RDM, for inductive databases is presented. It is grounded in constraint logic programming. RDM provides a small but powerful set of built-in constraints to query patterns. It is also embedded in the programming language Prolog. In this paper, the semantics of RDM is defined and a solver is presented. The resulting query language allows us to declaratively specify the patterns of interest, the solver then takes care of the procedural aspects. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
De Raedt, L. (2002). Data mining as constraint logic programming. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2408(PART2), 526–547. https://doi.org/10.1007/3-540-45632-5_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
