We present an algorithm for query evaluation given a logic program consisting of function-free Datalog rules. It is based on Earley Deduction [4, 6] and uses a partial evaluation similar to the one we devel oped for our SLDMagic method [1]. With this, finite automata modeling the evaluation of given queries are generated. In certain cases, the new method is more efficient than SLDMagic and the standard Magic Set method since it can process several deduction steps as one.
@article{arxiv.1405.5645,
title = {A Variant of Earley Deduction With Partial Evaluation},
author = {Heike Stephan and Stefan Brass},
journal= {arXiv preprint arXiv:1405.5645},
year = {2014}
}