An Empirical Approach to Query-Subquery Nets with Tail-Recursion Elimination

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a method called QSQN-TRE for evaluating queries to Horn knowledge bases by integrating Query-Subquery Nets with a form of tail-recursion elimination. The aim is to improve the QSQN method by avoiding materialization of intermediate results during the processing. We illustrate the efficiency of our method by empirical results, especially for tail-recursive cases. © Springer International Publishing Switzerland 2015.

Cite

CITATION STYLE

APA

Cao, S. T., & Nguyen, L. A. (2015). An Empirical Approach to Query-Subquery Nets with Tail-Recursion Elimination. In Advances in Intelligent Systems and Computing (Vol. 312, pp. 109–120). Springer Verlag. https://doi.org/10.1007/978-3-319-10518-5_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free