{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:37Z","timestamp":1761597037662},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429357"},{"type":"electronic","value":"9783540456353"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45635-x_20","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T21:27:34Z","timestamp":1181165254000},"page":"181-196","source":"Crossref","is-referenced-by-count":24,"title":["A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives"],"prefix":"10.1007","author":[{"given":"Hai-Feng","family":"Guo","sequence":"first","affiliation":[]},{"given":"Gopal","family":"Gupta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,13]]},"reference":[{"key":"20_CR1","unstructured":"K. Bowen, C. Houpt, et al. ALS Prolog System. http:\/\/www.als.com ."},{"issue":"1","key":"20_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. JACM, 43(1):20\u201374, January 1996.","journal-title":"JACM"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"W. Chen, T. Swift, and D. Warren. Efficient top-down computation of queries under the well-founded semantics. J. Logic Programming, 24(3):161\u2013199.","DOI":"10.1016\/0743-1066(94)00028-5"},{"key":"20_CR4","unstructured":"S. Das. Deductive Databases and Logic Programming. Addison Wesley. 1992."},{"key":"20_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/3-540-49201-1_8","volume-title":"PADL\u2019 99","author":"B. Demoen","year":"1998","unstructured":"B. Demoen and K. Sagonas. CHAT: the Copy-Hybrid Approach to Tabling. PADL\u2019 99, Springer Verlag LNCS 1551, pages106\u2013121."},{"key":"20_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BFb0026817","volume-title":"PLILP","author":"J. Freire","year":"1995","unstructured":"J. Freire, R. Hu, T. Swift, D. Warren. Exploiting Parallelism in Tabled Evaluations. PLILP 1995: 115\u2013132. LNCS 982."},{"key":"20_CR7","unstructured":"J. Freire, T. Swift, D. S. Warren. Beyond Depth-First Strategies: Improving Tabled Logic Programs through Alternative Scheduling. JFLP 1998(3). MIT Press."},{"key":"20_CR8","unstructured":"G. Gupta, E. Pontelli. Stack-splitting: A Simple Technique for Implementing Orparallelism in Logic Programming Systems. In Proc.ICLP, 1999. pp. 290\u2013305."},{"key":"20_CR9","unstructured":"Hai-Feng Guo. High Performance Logic Programming. New Mexico State University. Ph.D. thesis. Oct. 2000."},{"key":"20_CR10","unstructured":"H-F Guo, G. Gupta. A Simple Scheme for Implementing Tabled LP Systems. UT Dallas Tech. Rep 02-01. 2001."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"20_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BFb0020454","volume-title":"EuroPar\u2019 95","author":"E. Pontelli","year":"1995","unstructured":"E. Pontelli, G. Gupta. On the Duality between Or-parallelism and And-parallelism. In EuroPar\u2019 95, Springer LNCS 966, pp. 43\u201354."},{"key":"20_CR13","unstructured":"C. R. Ramakrishnan, S. Dawson, and D. Warren. Practical Program Analysis Using General Purpose Logic Programming Systems. In Proc.A CM PLDI. 1996."},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0743-1066(98)10013-4","volume":"38","author":"P. Rao","year":"1999","unstructured":"P. Rao, I. V. Ramakrishnan, et al. Efficient table access mechanisms for logic programs. Journal of Logic Programming, 38(1):31\u201354, Jan. 1999.","journal-title":"Journal of Logic Programming"},{"key":"20_CR15","series-title":"Lect Notes Comput Sci","first-page":"137","volume-title":"PADL","author":"R. Rocha","year":"1999","unstructured":"Ricardo Rocha, Fernando M. A. Silva, V\u00edtor Santos Costa. Or-Parallelism within Tabling. PADL 1999: 137\u2013151. Springer LNCS 1551."},{"issue":"3","key":"20_CR16","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1145\/291889.291897","volume":"20","author":"K. Sagonasand","year":"1998","unstructured":"K. Sagonasand 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":"20_CR17","doi-asserted-by":"crossref","unstructured":"Hisao Tamaki, T. Sato. OLD Resolution with Tabulation. In ICLP 1986. pp. 84\u201398.","DOI":"10.1007\/3-540-16492-8_66"},{"key":"20_CR18","unstructured":"T. Swift and David S. Warren. An Abstract Machine for SLG Resolution: Definite Programs. SLP 1994: 633\u2013652."},{"key":"20_CR19","unstructured":"K. Villaverde, H-F. Guo, E. Pontelli, G. Gupta. Incremental Stack Splitting and Scheduling in the Or-parallel PALS System. Int\u2019l Conf. on Par. Proc. 2001."},{"key":"20_CR20","series-title":"Lect Notes Comput Sci","volume-title":"PADL","author":"N.-F. Zhou","year":"2000","unstructured":"Neng-Fa Zhou, et al. Implementation of a Linear Tabling Mechanism. PADL 2000: 109\u2013123. Springer LNCS 1753."},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"V. Santos Costa et al. Andorra-I: A Parallel Prolog system that transparently exploitsb oth And-and Or-Parallelism. Proc.A CM PPoPP, Apr.\u2019 91, pp. 83\u201393.","DOI":"10.1145\/109626.109635"},{"key":"20_CR22","unstructured":"D. S. Warren. The XWAM: A machine that integratesProlog and deductive database query evaluation. TR 89\/25, SUNY at Stony Brook, 1989."}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45635-X_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:41:32Z","timestamp":1556466092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45635-X_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429357","9783540456353"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45635-x_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}