Mining first-order knowledge bases for association rules

Data mining from relational databases has recently become a popular way of discovering hidden knowledge. Methods such as association rules, chi square rules, ratio rules, implication rules, etc. that have been proposed in several contexts offer complimentary choices in rule induction in this model. Other than inductive and abductive logic programming, research into data mining from knowledge bases has been almost non-existent, because contemporary methods involve inherent procedurality which is difficult to cast into the declarativity of knowledge base systems. In this paper, we propose a logic-based technique for association rule mining from declarative knowledge which does not rely on procedural concepts such as candidate generation. This development is significant as this empowers the users with the capability to explore knowledge bases by mining association rules in a declarative and ad hoc fashion