{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:36:25Z","timestamp":1725791785896},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319065687"},{"type":"electronic","value":"9783319065694"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06569-4_21","type":"book-chapter","created":{"date-parts":[[2014,4,11]],"date-time":"2014-04-11T20:16:15Z","timestamp":1397247375000},"page":"281-295","source":"Crossref","is-referenced-by-count":3,"title":["An Improved Depth-First Control Strategy for Query-Subquery Nets in Evaluating Queries to Horn Knowledge Bases"],"prefix":"10.1007","author":[{"given":"Son Thanh","family":"Cao","sequence":"first","affiliation":[]},{"given":"Linh Anh","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley (1995)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J.D.: Magic sets and other strange ways to implement logic programs. In: Proceedings of PODS 1986, pp. 1\u201315. ACM (1986)","DOI":"10.1145\/6012.15399"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0743-1066(91)90038-Q","volume":"10","author":"C. Beeri","year":"1991","unstructured":"Beeri, C., Ramakrishnan, R.: On the power of magic. J. Log. Program.\u00a010, 255\u2013299 (1991)","journal-title":"J. Log. Program."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Cao, S.T.: On the efficiency of Query-Subquery Nets: an experimental point of view. In: Proceedings of SoICT 2013, pp. 148\u2013157. ACM (2013)","DOI":"10.1145\/2542050.2542085"},{"key":"21_CR5","unstructured":"Cao, S.T.: An implementation of the QSQN evaluation method using the DFS and IDFS control strategies (2014), http:\/\/mimuw.edu.pl\/~sonct\/QSQN14.zip"},{"key":"21_CR6","first-page":"152","volume":"13","author":"S.T. Cao","year":"2014","unstructured":"Cao, S.T., Nguyen, L.A., Szalas, A.: The Web Ontology Rule Language OWL\u00a02 RL+ and Its Extensions. T. Computational Collective Intelligence\u00a013, 152\u2013175 (2014)","journal-title":"T. Computational Collective Intelligence"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s40595-013-0009-y","volume":"1","author":"S.T. Cao","year":"2014","unstructured":"Cao, S.T., Nguyen, L.A., Szalas, A.: WORL: a nonmonotonic rule language for the Semantic Web. Vietnam J. Computer Science\u00a01(1), 57\u201369 (2014)","journal-title":"Vietnam J. Computer Science"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Freire, J., Swift, T., Warren, D.S.: Taking I\/O seriously: Resolution reconsidered for disk. In: Naish, L. (ed.) Proc. of ICLP 1997, pp. 198\u2013212. MIT Press (1997)","DOI":"10.7551\/mitpress\/4299.003.0020"},{"issue":"4","key":"21_CR9","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/2362355.2362360","volume":"13","author":"E. Madali\u0144ska-Bugaj","year":"2012","unstructured":"Madali\u0144ska-Bugaj, E., Nguyen, L.A.: A generalized QSQR evaluation method for Horn knowledge bases. ACM Trans. on Computational Logic\u00a013(4), 32 (2012)","journal-title":"ACM Trans. on Computational Logic"},{"key":"21_CR10","unstructured":"Nejdl, W.: Recursive strategies for answering recursive queries - the RQA\/FQI strategy. In: Stocker, P.M., Kent, W., Hammersley, P. (eds.) Proceedings of VLDB 1987, pp. 43\u201350. Morgan Kaufmann (1987)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-34630-9_25","volume-title":"Computational Collective Intelligence. Technologies and Applications","author":"L.A. Nguyen","year":"2012","unstructured":"Nguyen, L.A., Cao, S.T.: Query-Subquery Nets. In: Nguyen, N.-T., Hoang, K., J\u0119drzejowicz, P. (eds.) ICCCI 2012, Part I. LNCS, vol.\u00a07653, pp. 239\u2013248. Springer, Heidelberg (2012)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Nguyen, L.A., Cao, S.T.: Query-Subquery Nets. CoRR, abs\/1201.2564 (2012)","DOI":"10.1007\/978-3-642-34630-9_25"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, R., Srivastava, D., Sudarshan, S.: Efficient bottom-up evaluation of logic programs. In: Vandewalle, J. (ed.) The State of the Art in Computer Systems and Software Engineering. Kluwer Academic Publishers (1992)","DOI":"10.1007\/978-1-4615-3506-5_11"},{"issue":"3","key":"21_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF03037407","volume":"4","author":"J. Rohmer","year":"1986","unstructured":"Rohmer, J., Lescouer, R., Kerisit, J.-M.: The Alexander method \u2013 a technique for the processing of recursive axioms in deductive databases. New Generation Computing\u00a04(3), 273\u2013285 (1986)","journal-title":"New Generation Computing"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-16492-8_66","volume-title":"Third International Conference on Logic Programming","author":"H. Tamaki","year":"1986","unstructured":"Tamaki, H., Sato, T.: OLD resolution with tabulation. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol.\u00a0225, pp. 84\u201398. Springer, Heidelberg (1986)"},{"key":"21_CR16","unstructured":"Vieille, L.: Recursive axioms in deductive databases: The query\/subquery approach. In: Proceedings of Expert Database Conf., pp. 253\u2013267 (1986)"},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(89)90088-1","volume":"69","author":"L. Vieille","year":"1989","unstructured":"Vieille, L.: Recursive query processing: The power of logic. Theor. Comput. Sci.\u00a069(1), 1\u201353 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Zhou, N.-F., Sato, T.: Efficient fixpoint computation in linear tabling. In: Proceedings of PPDP 2003, pp. 275\u2013283. ACM (2003)","DOI":"10.1145\/888251.888277"}],"container-title":["Advances in Intelligent Systems and Computing","Advanced Computational Methods for Knowledge Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06569-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T21:11:57Z","timestamp":1716671517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06569-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319065687","9783319065694"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06569-4_21","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}