2000 character limit reached
A Variant of Earley Deduction With Partial Evaluation
Published 22 May 2014 in cs.LO and cs.DB | (1405.5645v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
