Abstract
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.
This is a significantly extended and improved version of a paper that appeared in the 26th Workshop on Logic Programming (WLP’12).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Angles, R., Gutierrez, C.: The expressive power of SPARQL. In: Sheth, A., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T., Thirunarayan, K. (eds.) ISWC 2008. LNCS, vol. 5318, pp. 114–129. Springer, Heidelberg (2008), http://www.dcc.uchile.cl/cgutierr/papers/expPowSPARQL.pdf
Brass, S.: SLDMagic — the real magic (With applications to web queries). In: Lloyd, J., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 1063–1077. Springer, Heidelberg (2000), http://link.springer.com/chapter/10.1007%2F3-540-44957-4_71
Brass, S.: Implementation alternatives for bottom-up evaluation. In: Hermenegildo, M., Schaub, T. (eds.) Technical Communications of the 26th International Conference on Logic Programming (ICLP 2010). Leibniz International Proceedings in Informatics (LIPIcs), vol. 7, pp. 44–53. Schloss Dagstuhl (2010), http://drops.dagstuhl.de/opus/volltexte/2010/2582
Brass, S.: Order in datalog with applications to declarative output. In: Barceló, P., Pichler, R. (eds.) Datalog 2.0 2012. LNCS, vol. 7494, pp. 56–67. Springer, Heidelberg (2012), http://users.informatik.uni-halle.de/~brass/order/
Bry, F., Furche, T., Ley, C., Marnette, B., Linse, B., Schaffert, S.: Datalog relaunched: Simulation unification and value invention. In: de Moor, O., Gottlob, G., Furche, T., Sellers, A. (eds.) Datalog 2010. LNCS, vol. 6702, pp. 321–350. Springer, Heidelberg (2011), http://link.springer.com/chapter/10.1007%2F978-3-642-24206-9_19
Calì, A., Gottlob, G., Lukasiewicz, T.: A general Datalog-based framework for tractable query answering over ontologies. In: Proc. of the 28th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2009), pp. 77–86. ACM (2009), http://dx.doi.org/10.1145/1559795.1559809
Pereira, F.C.N., Warren, D.H.D.: Parsing as deduction. In: Proceedings of the 21st Annual Meeting of the Association for Computational Linguistics (ACL), pp. 137–144 (1983), http://www.aclweb.org/anthology/P83-1021
Polleres, A.: From SPARQL to rules (and back). In: Proceedings of the Sixteenth International World Wide Web Conference (WWW 2007), pp. 787–796 (2007), http://wwwconference.org/www2007/papers/paper435.pdf
Polleres, A.: How (well) do Datalog, SPARQL and RIF interplay? In: Barceló, P., Pichler, R. (eds.) Datalog 2.0 2012. LNCS, vol. 7494, pp. 27–30. Springer, Heidelberg (2012), http://link.springer.com/chapter/10.1007/978-3-642-32925-8_4
Porter III, H.H.: Earley deduction (1986), http://web.cecs.pdx.edu/~harry/earley/earley.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brass, S., Stephan, H. (2013). A Variant of Earley Deduction with Partial Evaluation. In: Faber, W., Lembo, D. (eds) Web Reasoning and Rule Systems. RR 2013. Lecture Notes in Computer Science, vol 7994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39666-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-39666-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39665-6
Online ISBN: 978-3-642-39666-3
eBook Packages: Computer ScienceComputer Science (R0)