{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:43:58Z","timestamp":1725493438922},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664925"},{"type":"electronic","value":"9783540482420"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48242-3_21","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:28:09Z","timestamp":1184603289000},"page":"337-357","source":"Crossref","is-referenced-by-count":5,"title":["CHAT Is \u0398 (SLG-WAM)"],"prefix":"10.1007","author":[{"given":"Baxt","family":"Demoen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Sagonas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"E. B\u00f6rger and D. Rosenzweig. The WAM \u2014 Definition and compiler correctness. In C. Beierle and L. Pl\u00fcmer, editors, Logic Programming: Formal Methods and Practical Applications, pages 20\u201390. Elsevier Science, North-Holland, 1995."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"S. Dawson, C. R. Ramakrishnan, and D. S. Warren. Practical program analysis using general purpose logic programming systems \u2014 A case study. In Proceedings of the ACM SIGPLAN PLDI, pages 117\u2013126, Philadelphia, May 1996. ACM Press.","DOI":"10.1145\/231379.231399"},{"key":"21_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BFb0056605","volume-title":"Principles of Declarative Programming (PLILP\u201998)","author":"B. Demoen","year":"1998","unstructured":"B. Demoen and K. Sagonas. CAT: the Copying Approach to Tabling. In C. Palamidessi, H. Glaser, and K. Meinke, editors, Principles of Declarative Programming (PLILP\u201998), number 1490 in LNCS, pages 21\u201335, Sept. 1998. Springer."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"B. Demoen and K. Sagonas. Memory Management for Prolog with Tabling. In Proceedings of ISMM\u201998: ACM SIGPLAN International Symposium on Memory Management, pages 97\u2013106, Vancouver, B.C., Canada, Oct. 1998. ACM Press.","DOI":"10.1145\/286860.286871"},{"key":"21_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/3-540-49201-1_8","volume-title":"Practical Aspects of Declarative Languages (PADL)","author":"B. Demoen","year":"1999","unstructured":"B. Demoen and K. Sagonas. CHAT: the Copy-Hybrid Approach to Tabling. In G. Gupta, editor, Practical Aspects of Declarative Languages (PADL), number 1551 in LNCS, pages 106\u2013121, San Antonio, Texas, Jan. 1999. Springer."},{"key":"21_CR6","unstructured":"J. Preire, T. Swift, and D. S. Warren. Beyond depth-first strategies: Improving tabled logic programs through alternative scheduling. JFLP, 1998(3), Apr. 1998."},{"issue":"4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1145\/155183.155220","volume":"15","author":"G. Gupta","year":"1993","unstructured":"G. Gupta and B. Jayaraman. Analysis of Or-parallel execution models. ACM Trans. Prog. Lang. Syst., 15(4):659\u2013680, Sept. 1993.","journal-title":"ACM Trans. Prog. Lang. Syst."},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF03037460","volume":"5","author":"P. Kursawe","year":"1987","unstructured":"P. Kursawe. How to invent a Prolog machine. New Gen. Comp., 5(1):97\u2013114, 1987.","journal-title":"New Gen. Comp."},{"key":"21_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-63166-6_16","volume-title":"Proceedings of the 9th CAV","author":"Y. S. Ramakrishna","year":"1997","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 of the 9th CAV, number 1254 in LNCS, pages 143\u2013154, July 1997. Springer."},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0743-1066(92)90054-7","volume":"13","author":"D. M. Russinoff","year":"1992","unstructured":"D. M. Russinoff. A verified Prolog compiler for the Warren Abstract Machine. J. of Logic Program., 13(4):367\u2013412, Aug. 1992.","journal-title":"J. of Logic Program."},{"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 Trans. Prog. Lang. Syst., 20(3):586\u2013634, May 1998.","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"K. Sagonas, T. Swift, and D. S. Warren. XSB as an efficient deductive database engine. In Proceedings of the ACM SIGMOD\u201994, pages 442\u2013453, May 1994. ACM.","DOI":"10.1145\/191839.191927"},{"issue":"20","key":"21_CR13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0743-1066(94)90031-0","volume":"19\/","author":"P. Roy Van","year":"1994","unstructured":"P. Van Roy. 1983\u20131993: The wonder years of sequential Prolog implementation. J. of Logic Program., 19\/20:385\u2013441, May\/July 1994.","journal-title":"J. of Logic Program."},{"key":"21_CR14","series-title":"Technical Report","volume-title":"An abstr5act Prolog instruction set","author":"D. H. D. Warren","year":"1983","unstructured":"D. H. D. Warren. An abstr5act Prolog instruction set. Technical Report 309, SRI International, Menlo Park, U.S.A., Oct. 1983."},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"D. S. Warren. Efficient Prolog memory management for flexible control strategies. In Proceedings of the 1984 Symp. Logic Program., pages 198\u2013202, Feb. 1984. IEEE.","DOI":"10.1007\/BF03037327"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming and Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48242-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T01:50:45Z","timestamp":1550454645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48242-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664925","9783540482420"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48242-3_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}