On the efficiency of query-subquery nets with right/tail-recursion elimination in evaluating queries to Horn knowledge bases

DOI10.1007/978-3-319-17996-4_22MaRDI QIDQ2808079zbMATH OpenOpenAlexFDO

Authors Son Thanh Cao

Publication date 26 May 2016

Published in Advanced Computational Methods for Knowledge Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-17996-4_22

zbMATH Keywords

optimization methodsquery processingdeductive databasesHorn knowledge basesQSQQSQNQSQN-rTREQSQN-TRE

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Database theory (68P15)

Recommendations

• An improved depth-first control strategy for query-subquery nets in evaluating queries to Horn knowledge bases
• A generalized QSQR evaluation method for Horn knowledge bases
• scientific article; zbMATH DE number 4049156
• A generalization of the differential approach to recursive query evaluation
• Efficient evaluation for a subset of recursive queries

Cites work

• scientific article; zbMATH DE number 3982556 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• A generalized QSQR evaluation method for Horn knowledge bases
• An improved depth-first control strategy for query-subquery nets in evaluating queries to Horn knowledge bases
• Recursive query processing: The power of logic

Cited in

(2)

• A generalized QSQR evaluation method for Horn knowledge bases
• An improved depth-first control strategy for query-subquery nets in evaluating queries to Horn knowledge bases

This page was built for publication: On the efficiency of query-subquery nets with right/tail-recursion elimination in evaluating queries to Horn knowledge bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808079)