{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:39:47Z","timestamp":1725493187768},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008866"},{"type":"electronic","value":"9783540365754"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36575-3_6","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T17:52:15Z","timestamp":1193507535000},"page":"69-83","source":"Crossref","is-referenced-by-count":2,"title":["Approximate Pruning in Tabled Logic Programming"],"prefix":"10.1007","author":[{"given":"Lu\u00eds F.","family":"Castro","sequence":"first","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":[[2003,2,28]]},"reference":[{"key":"6_CR1","unstructured":"K. A. M. Ali. A method for implementing cut in parallel execution of Prolog. In ICSLP\u201987."},{"issue":"1","key":"6_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":"6_CR3","doi-asserted-by":"crossref","unstructured":"B. Demoen and K. Sagonas. CHAT: the Copy-Hybrid Approach to Tabling. In PADL\u201999, 1999.","DOI":"10.1007\/3-540-49201-1_8"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"H.-F. Guo and G. Gupta. A simple scheme for implementing tabled logic programming systems based on dynamic reordering of alternatives. In ICLP\u201901, pages 181\u2013196, 2001.","DOI":"10.1007\/3-540-45635-X_20"},{"key":"6_CR5","unstructured":"H.-F. Guo and G. Gupta. Cuts in tabled logic programming. In B. Demoen, editor, CICLOPS\u201902, 2002."},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0743-1066(95)00092-5","volume":"27","author":"G. Gupta","year":"1996","unstructured":"G. Gupta and V. Santos Costa. Cuts and side-effects in and-or parallel prolog. Journal of Logic Programming, 27(1):45\u201371, 1996.","journal-title":"Journal of Logic Programming"},{"key":"6_CR7","unstructured":"R. O'Keefe. The Craft of Prolog. MIT, 1990."},{"issue":"3","key":"6_CR8","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. TOPLAS, 20(3):586\u2013635, May 1998.","journal-title":"TOPLAS"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"T. Swift. A new formulation of tabled resolution with delay. In Recent Advances in Artificial Intelligence.","DOI":"10.1007\/3-540-48159-1_12"},{"key":"6_CR10","unstructured":"T. Swift. Efficient Evaluation of Normal Logic Programs. PhD thesis, SUNY at Stony Brook, 1994."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"T. Swift. A new formulation of tabled resolution with delay. In EPIA\u201999, 1999.","DOI":"10.1007\/3-540-48159-1_12"},{"key":"6_CR12","unstructured":"T. Swift and D. S. Warren. An abstract machine for SLG resolution: definite programs. In SLP\u201994, pages 633\u2013654, 1994."},{"key":"6_CR13","unstructured":"D. S. Warren. Programming in tabled prolog-DRAFT. Available from http:\/\/www.cs.stonybrook.edu\/~warren"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"D. S. Warren. Efficient Prolog memory management for flexible control. In ILPS\u201984, pages 198\u2013202, 1984.","DOI":"10.1007\/BF03037327"},{"key":"6_CR15","unstructured":"D.H.D. Warren. An abstract Prolog instruction set. Technical Report 309, SRI, 1983."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36575-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:17:41Z","timestamp":1556921861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36575-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008866","9783540365754"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-36575-3_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}