{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:28:06Z","timestamp":1725542886650},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642115028"},{"type":"electronic","value":"9783642115035"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11503-5_21","type":"book-chapter","created":{"date-parts":[[2010,1,7]],"date-time":"2010-01-07T04:42:16Z","timestamp":1262839336000},"page":"249-263","source":"Crossref","is-referenced-by-count":1,"title":["Compact Lists for Tabled Evaluation"],"prefix":"10.1007","author":[{"given":"Jo\u00e3o","family":"Raimundo","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Rocha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","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(1), 20\u201374 (1996)","journal-title":"Journal of the ACM"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","first-page":"431","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"P. Rao","year":"1997","unstructured":"Rao, P., Sagonas, K., Swift, T., Warren, D.S., Freire, J.: XSB: A System for Efficiently Computing Well-Founded Semantics. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol.\u00a01265, pp. 431\u2013441. Springer, Heidelberg (1997)"},{"issue":"3","key":"21_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(3), 586\u2013634 (1998)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"21_CR4","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(1), 31\u201354 (1999)","journal-title":"Journal of Logic Programming"},{"key":"21_CR5","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7160.001.0001","volume-title":"Warren\u2019s Abstract Machine \u2013 A Tutorial Reconstruction","author":"H. A\u00eft-Kaci","year":"1991","unstructured":"A\u00eft-Kaci, H.: Warren\u2019s Abstract Machine \u2013 A Tutorial Reconstruction. The MIT Press, Cambridge (1991)"},{"issue":"1&2","key":"21_CR6","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. Theory and Practice of Logic Programming\u00a05(1&2), 161\u2013205 (2005)","journal-title":"Theory and Practice of Logic Programming"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-56610-4_56","volume-title":"TAPSOFT \u201993: Theory and Practice of Software Development","author":"L. Bachmair","year":"1993","unstructured":"Bachmair, L., Chen, T., Ramakrishnan, I.V.: Associative Commutative Discrimination Nets. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 61\u201374. Springer, Heidelberg (1993)"},{"issue":"1","key":"21_CR8","first-page":"45","volume":"89","author":"N.A. Fonseca","year":"2008","unstructured":"Fonseca, N.A., Camacho, R., Rocha, R., Costa, V.S.: Compile the hypothesis space: do it once, use it often. Fundamenta Informaticae\u00a089(1), 45\u201367 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-89982-2_22","volume-title":"Logic Programming","author":"A. Kimmig","year":"2008","unstructured":"Kimmig, A., Costa, V.S., Rocha, R., Demoen, B., Raedt, L.D.: On the Efficient Execution of ProbLog Programs. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 175\u2013189. Springer, Heidelberg (2008)"}],"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-642-11503-5_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:41:24Z","timestamp":1606185684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11503-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642115028","9783642115035"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11503-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}