{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:54:23Z","timestamp":1725486863944},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430926"},{"type":"electronic","value":"9783540455875"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45587-6_21","type":"book-chapter","created":{"date-parts":[[2007,6,24]],"date-time":"2007-06-24T21:19:19Z","timestamp":1182719959000},"page":"332-349","source":"Crossref","is-referenced-by-count":4,"title":["Suspending and Resuming Computations in Engines for SLG Evaluation"],"prefix":"10.1007","author":[{"given":"Lu\u00eds F.","family":"Castro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Terrance","family":"Swift","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David S.","family":"Warren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,20]]},"reference":[{"key":"21_CR1","unstructured":"J. J. Alferes, F. Azevedo, P. Barahona, C. Dam\u00e1sio, and T. Swift. Logic programming techniques for solving circuit diagnosis. Technical report, Universidade Nova de Lisboa, 2001."},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/227595.227597","volume":"43","author":"W. Chen","year":"1996","unstructured":"W. Chen and D. S. Warren. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1):20\u201374, January 1996.","journal-title":"Journal of the ACM"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"B. Demoen and K. Sagonas. CAT: A copying approach to tabling. In PLILP, pages 21\u201335, 1998.","DOI":"10.1007\/BFb0056605"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"B. Demoen and K. Sagonas. Chat is \u0398(slg-wam). In Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning, pages 337\u2013357, 1999.","DOI":"10.1007\/3-540-48242-3_21"},{"key":"21_CR5","unstructured":"B. Demoen and K. Sagonas. CHAT: the Copy-Hybrid Approach to Tabling. In Practical Aspects of Declarative Languages: First International Workshop, 1999."},{"key":"21_CR6","unstructured":"J. Freire, T. Swift, and D. S. Warren. Beyond depth-first: Improving tabled logic programs through alternative scheduling strategies. Journal of Functional and Logic Programming, 1998(3), 1998."},{"key":"21_CR7","unstructured":"Haifeng Guo and Gopal Gupta. A new tabling scheme with dynamic reordering of alternatives. In Workshop on Parallelism and Implementation Technology for (Constraint) Logic Languages, July 2000."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. Smolka, T. Swift, and D. S. Warren. Efficient model checking using tabled resolution. In Proceedings on the Conference on Automated Verification, pages 143\u2013154, 1997.","DOI":"10.1007\/3-540-63166-6_16"},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0743-1066(98)10013-4","volume":"38","author":"I. V. Ramakrishnan","year":"1999","unstructured":"I. V. Ramakrishnan, P. Rao, K. Sagonas, T. Swift, and D. S. Warren. Efficient access mechanisms for tabled logic programs. Journal of Logic Programming, 38(1):31\u201355, January 1999.","journal-title":"Journal of Logic Programming"},{"key":"21_CR10","unstructured":"R. Rocha. On applying Or-parallelism and tabling to logic programs. PhD thesis, Universidade do Porto, 2001."},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1145\/291889.291897","volume":"20","author":"K. Sagonas","year":"1998","unstructured":"K. Sagonas and T. Swift. An abstract machine for tabled execution of fixed-order stratified logic programs. ACM TOPLAS, 20(3):586\u2013635, May 1998.","journal-title":"ACM TOPLAS"},{"key":"21_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/10704567_16","volume-title":"Optimising bytecode emulation for prolog","author":"V. Santos Costa","year":"1999","unstructured":"V\u00edtor Santos Costa. Optimising bytecode emulation for prolog. In LNCS 1702, Proceedings of PPDP\u201999, pages 261\u2013267. Springer-Verlag, September 1999."},{"issue":"1","key":"21_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1017\/S1471068400001010","volume":"1","author":"Y.-D. Shen","year":"2001","unstructured":"Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You, and Neng-Fa Zhou. Linear tabulated resolution based on Prolog control strategy. Journal of Theory and Practice of Logic Programming, 1(1):71\u2013122, 2001.","journal-title":"Journal of Theory and Practice of Logic Programming"},{"issue":"3\u20134","key":"21_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1018990308362","volume":"25","author":"T. Swift","year":"1999","unstructured":"T. Swift. Tabling for non-monotonic programming. Annals of Mathematics and Artificial Intelligence, 25(3\u20134):201\u2013240, 1999.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder van","year":"1991","unstructured":"A. van Gelder, K. A. Ross, and J. S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. Journal of the ACM, 38(3):620\u2013650, 1991.","journal-title":"Journal of the ACM"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"D. S. Warren. Efficient Prolog memory management for flexible control. In ILPS, pages 198\u2013202, 1984.","DOI":"10.1007\/BF03037327"},{"key":"21_CR17","unstructured":"D. H. D. Warren. An abstract Prolog instruction set. Technical Report 309, SRI, 1983."},{"key":"21_CR18","unstructured":"G. Yang and M. Kifer. Flora: Implementing an efficient DOOD system using a tabling logic engine. In DOOD\u20192000: 6th International Conference on Rules and Objects in Databases, 2000."},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, and Jia-Huai You. Implementation of a linear tabling mechanism. In Proceedings of PADL 2000, pages 109\u2013123, 2000.","DOI":"10.1007\/3-540-46584-7_8"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45587-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T09:35:37Z","timestamp":1556530537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45587-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12,20]]},"ISBN":["9783540430926","9783540455875"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45587-6_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001,12,20]]}}}