{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:50:07Z","timestamp":1725511807837},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540696087"},{"type":"electronic","value":"9783540696117"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/978-3-540-69611-7_10","type":"book-chapter","created":{"date-parts":[[2007,4,26]],"date-time":"2007-04-26T05:40:18Z","timestamp":1177566018000},"page":"155-169","source":"Crossref","is-referenced-by-count":3,"title":["On Improving the Efficiency and Robustness of Table Storage Mechanisms for Tabled Evaluation"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Rocha","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.: OLDT Resolution with Tabulation. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol.\u00a0225, pp. 84\u201398. Springer, Heidelberg (1986)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/227595.227597","volume":"43","author":"W. Chen","year":"1996","unstructured":"Chen, W., Warren, D.S.: Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM\u00a043, 20\u201374 (1996)","journal-title":"Journal of the ACM"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1145\/291889.291897","volume":"20","author":"K. Sagonas","year":"1998","unstructured":"Sagonas, K., Swift, T.: An Abstract Machine for Tabled Execution of Fixed-Order Stratified Logic Programs. ACM Transactions on Programming Languages and Systems\u00a020, 586\u2013634 (1998)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR4","unstructured":"Rocha, R., Silva, F., Santos Costa, V.: YapTab: A Tabling Engine Designed to Support Parallelism. In: Conference on Tabulation in Parsing and Deduction, pp. 77\u201387 (2000)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/S0167-739X(99)00092-8","volume":"16","author":"B. Demoen","year":"2000","unstructured":"Demoen, B., Sagonas, K.: CHAT: The Copy-Hybrid Approach to Tabling. Future Generation Computer Systems\u00a016, 809\u2013830 (2000)","journal-title":"Future Generation Computer Systems"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-45635-X_20","volume-title":"Logic Programming","author":"H.F. Guo","year":"2001","unstructured":"Guo, H.F., Gupta, G.: A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 181\u2013196. Springer, Heidelberg (2001)"},{"key":"10_CR7","unstructured":"Zhou, N.F., Shen, Y.D., Yuan, L.Y., You, J.H.: Implementation of a Linear Tabling Mechanism. Journal of Functional and Logic Programming 2001\u00a0(2001)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/11603023_11","volume-title":"Practical Aspects of Declarative Languages","author":"Z. Somogyi","year":"2006","unstructured":"Somogyi, Z., Sagonas, K.: Tabling in Mercury: Design and Implementation. In: Van Hentenryck, P. (ed.) PADL 2006. LNCS, vol.\u00a03819, pp. 150\u2013167. Springer, Heidelberg (2006)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1013963.1013975","volume-title":"ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming","author":"K. Sagonas","year":"2004","unstructured":"Sagonas, K., Stuckey, P.: Just Enough Tabling. In: ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pp. 78\u201389. ACM Press, New York (2004)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11562931_19","volume-title":"Logic Programming","author":"D. Saha","year":"2005","unstructured":"Saha, D., Ramakrishnan, C.R.: Incremental Evaluation of Tabled Logic Programs. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 235\u2013249. Springer, Heidelberg (2005)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/11562931_20","volume-title":"Logic Programming","author":"R. Rocha","year":"2005","unstructured":"Rocha, R., Silva, F., Santos Costa, V.: Dynamic Mixed-Strategy Evaluation of Tabled Logic Programs. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 250\u2013264. Springer, Heidelberg (2005)"},{"key":"10_CR12","unstructured":"Muggleton, S.: Inductive Logic Programming. In: Conference on Algorithmic Learning Theory, Ohmsma, pp. 43\u201362 (1990)"},{"key":"10_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/11564096_72","volume-title":"Machine Learning: ECML 2005","author":"R. Rocha","year":"2005","unstructured":"Rocha, R., Fonseca, N., Santos Costa, V.: On Applying Tabling to Inductive Logic Programming. In: Gama, J., et al. (eds.) ECML 2005. LNCS (LNAI), vol.\u00a03720, pp. 707\u2013714. Springer, Heidelberg (2005)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S1471068404002030","volume":"5","author":"R. Rocha","year":"2005","unstructured":"Rocha, R., Silva, F., Santos Costa, V.: On applying or-parallelism and tabling to logic programs. Journal of Theory and Practice of Logic Programming\u00a05, 161\u2013205 (2005)","journal-title":"Journal of Theory and Practice of Logic Programming"},{"key":"10_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/11853886_42","volume-title":"Logics in Artificial Intelligence","author":"N.A. Fonseca","year":"2006","unstructured":"Fonseca, N.A., Silva, F., Camacho, R.: An Inductive Logic Programming System. In: Fisher, M., et al. (eds.) JELIA 2006. LNCS (LNAI), vol.\u00a04160, pp. 481\u2013484. Springer, Heidelberg (2006)"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0743-1066(94)00028-5","volume":"24","author":"W. Chen","year":"1995","unstructured":"Chen, W., Swift, T., Warren, D.S.: Efficient Top-Down Computation of Queries under the Well-Founded Semantics. Journal of Logic Programming\u00a024, 161\u2013199 (1995)","journal-title":"Journal of Logic Programming"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0743-1066(98)10013-4","volume":"38","author":"I.V. Ramakrishnan","year":"1999","unstructured":"Ramakrishnan, I.V., Rao, P., Sagonas, K., Swift, T., Warren, D.S.: Efficient Access Mechanisms for Tabled Logic Programs. Journal of Logic Programming\u00a038, 31\u201354 (1999)","journal-title":"Journal of Logic Programming"},{"key":"10_CR18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1613\/jair.924","volume":"16","author":"H. Blockeel","year":"2002","unstructured":"Blockeel, H., Dehaspe, L., Demoen, B., Janssens, G., Ramon, J., Vandecasteele, H.: Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs. Journal of Artificial Intelligence Research\u00a016, 135\u2013166 (2002)","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69611-7_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:44:07Z","timestamp":1620002647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69611-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540696087","9783540696117"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69611-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}