Extended rules in knowledge-based data access

Abstract

We present a method for an efficient knowledge-based access to relational data. Knowledge is represented as a set of rules (basic rules) and describes a source data at concept (ontological) level. Forward chaining in the integrated system is performed with extended rules, which are obtained by a goal- and dependency-directed transformation of the basic rules. The novel feature of our method is generality - every rule is generated so that includes all possible binding of the head predicates, and variable dependencies, while in many implementations of the magic method the succession of bindings depends on a query. We demonstrate a query answering algorithm and our prototypical implementation of the system coupled with the Jess engine. The results of performance evaluation are presented and compared to the results described in our previous works. © 2011 Springer-Verlag.