{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:09:48Z","timestamp":1794337788840,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540309475","type":"print"},{"value":"9783540316855","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11603023_11","type":"book-chapter","created":{"date-parts":[[2005,12,22]],"date-time":"2005-12-22T08:45:28Z","timestamp":1135241128000},"page":"150-167","source":"Crossref","is-referenced-by-count":9,"title":["Tabling in Mercury: Design and Implementation"],"prefix":"10.1007","author":[{"given":"Zoltan","family":"Somogyi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Konstantinos","family":"Sagonas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"11_CR1","first-page":"20","volume":"43","author":"W. Chen","year":"1996","unstructured":"Chen, W., Warren, D.S.: Tabled evaluation with delaying for general logic programs. J.\u00a0ACM\u00a043(1), 20\u201374 (1996)","journal-title":"J.\u00a0ACM"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Demoen, B., Sagonas, K.: CAT: the Copying Approach to Tabling. J. of Functional and Logic Programming (November 1999)","DOI":"10.1007\/BFb0056605"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-45635-X_20","volume-title":"Logic Programming","author":"H.-F. Guo","year":"2001","unstructured":"Guo, H.-F., Gupta, G.: A simple scheme for implementing tabled logic programming systems based on dynamic reordering of alternatives. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 181\u2013196. Springer, Heidelberg (2001)"},{"issue":"1","key":"11_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. J. of Logic Programming\u00a038(1), 31\u201354 (1999)","journal-title":"J. of Logic Programming"},{"issue":"1&2","key":"11_CR5","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"},{"issue":"3","key":"11_CR6","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 Trans. on Prog. Lang. Syst.\u00a020(3), 586\u2013634 (1998)","journal-title":"ACM Trans. on Prog. Lang. Syst."},{"issue":"1\u20133","key":"11_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"26","author":"Z. Somogyi","year":"1996","unstructured":"Somogyi, Z., Henderson, F., Conway, T.: The execution algorithm of Mercury, an efficient purely declarative logic programming language. J. of Logic Progr.\u00a026(1\u20133), 17\u201364 (1996)","journal-title":"J. of Logic Progr."},{"key":"11_CR8","unstructured":"Somogyi, Z., Sagonas, K.: Minimal model tabling in Mercury (2005). Available at, http:\/\/www.cs.mu.oz.au\/research\/mercury\/information\/papers.html"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-16492-8_66","volume-title":"Third International Conference on Logic Programming","author":"H. Tamaki","year":"1986","unstructured":"Tamaki, H., Sato, T.: OLD resolution with Tabulation. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol.\u00a0225, pp. 84\u201398. Springer, Heidelberg (1986)"},{"key":"11_CR10","unstructured":"Warren, D.H.D.: An abstract Prolog instruction set. Tech. Rep. 309, SRI International (1983)"},{"key":"11_CR11","unstructured":"Zhou, N.-F., Shen, Y.-D., Yuan, L.-Y., You, J.-H.: Implementation of a linear tabling mechanism. J. of Functional and Logic Programming\u00a02001(10) (2001)"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11603023_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T15:10:07Z","timestamp":1586617807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11603023_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309475","9783540316855"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11603023_11","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11603023","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}