An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Journal of Logic Programming
Logic, Programming, and PROLOG
Logic, Programming, and PROLOG
Multiple SIP Strategies and Bottom-Up Adorning in Logic Query Optimization
ICDT '90 Proceedings of the Third International Conference on Database Theory
OpenRuleBench: an analysis of the performance of rule engines
Proceedings of the 18th international conference on World wide web
Efficient description logic reasoning in prolog: The dlog system
Theory and Practice of Logic Programming
Data complexity of reasoning in very expressive description logics
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Usage of the Jess Engine, Rules and Ontology to Query a Relational Database
RuleML '09 Proceedings of the 2009 International Symposium on Rule Interchange and Applications
Journal on data semantics X
Application of an ontology-based model to a selected fraudulent disbursement economic crime
AICOL-I/IVR-XXIV'09 Proceedings of the 2009 international conference on AI approaches to the complexity of legal systems: complex systems, the semantic web, ontologies, argumentation, and dialogue
Ontological modeling of a class of linked economic crimes
Transactions on Computational Collective Intelligence IX
Hi-index | 0.00 |
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.