SLDMagic - The Real Magic (With Applications to Web Queries)
CL '00 Proceedings of the First International Conference on Computational Logic
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
From SPARQL to rules (and back)
Proceedings of the 16th international conference on World Wide Web
The Expressive Power of SPARQL
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
A general datalog-based framework for tractable query answering over ontologies
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Datalog relaunched: simulation unification and value invention
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
How (well) do datalog, SPARQL and RIF interplay?
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Order in datalog with applications to declarative output
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
| Hi-index | 0.00 |
We present an algorithm for query evaluation given a logic program consisting of function-free Datalog rules. The algorithm is based on Earley Deduction [7,10], but uses explicit states to eliminate rules which are no longer needed, and partial evaluation to minimize the work at runtime. At least in certain cases, the new method is more efficient than our SLDMagic-method [2], and also beats the standard Magic set method. It is also theoretically interesting, because it consumes one EDB fact in each step. Because of its origin, it is especially well suited for parsing applications, e.g. for extracting data from web pages. However, it has the potential to speed up basic Datalog reasoning for many semantic web applications.