{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:22:53Z","timestamp":1725844973978},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319276526"},{"type":"electronic","value":"9783319276533"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27653-3_11","type":"book-chapter","created":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T00:21:31Z","timestamp":1450830091000},"page":"113-124","source":"Crossref","is-referenced-by-count":2,"title":["Batched Evaluation of Full-Sharing Multithreaded Tabling"],"prefix":"10.1007","author":[{"given":"Miguel","family":"Areias","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Rocha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,24]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Areias, M., Rocha, R.: An efficient and scalable memory allocator for multithreaded tabled evaluation of logic programs. In: International Conference on Parallel and Distributed Systems, pp. 636\u2013643. IEEE Computer Society (2012)","DOI":"10.1109\/ICPADS.2012.91"},{"issue":"4 & 5","key":"11_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1017\/S1471068412000117","volume":"12","author":"M Areias","year":"2012","unstructured":"Areias, M., Rocha, R.: Towards multi-threaded local tabling using a common table space. J. Theory Pract. Logic Program. 12(4 & 5), 427\u2013443 (2012)","journal-title":"J. Theory Pract. Logic Program."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Areias, M., Rocha, R.: A simple and efficient lock-free hash trie design for concurrent tabling. In: Technical Communications of the International Conference on Logic Programming (2014)","DOI":"10.1007\/s10766-014-0346-1"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Areias, M., Rocha, R.: A lock-free hash trie design for concurrent tabled logic programs. Int. J. Parallel Program. 1\u201321 (2015)","DOI":"10.1007\/s10766-014-0346-1"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/227595.227597","volume":"43","author":"W Chen","year":"1996","unstructured":"Chen, W., Warren, D.S.: Tabled evaluation with delaying for general logic programs. J. ACM 43(1), 20\u201374 (1996)","journal-title":"J. ACM"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-61756-6_89","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"J Freire","year":"1996","unstructured":"Freire, J., Swift, T., Warren, D.S.: Beyond depth-first: improving tabled logic programs through alternative scheduling strategies. In: Kuchen, H., Swierstra, S.D. (eds.) PLILP 1996. LNCS, vol. 1140, pp. 243\u2013258. Springer, Heidelberg (1996)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Liang, S., Fodor, P., Wan, H., Kifer, M.: OpenRuleBench: an analysis of the performance of rule engines. In: International World Wide Web Conference, pp. 601\u2013610. ACM (2009)","DOI":"10.1145\/1526709.1526790"},{"key":"11_CR8","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-540-89982-2_24","volume-title":"Logic Programming","author":"R Marques","year":"2008","unstructured":"Marques, R., Swift, T.: Concurrent and local evaluation of normal programs. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 206\u2013222. Springer, Heidelberg (2008)"},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0743-1066(98)10013-4","volume":"38","author":"IV Ramakrishnan","year":"1999","unstructured":"Ramakrishnan, I.V., Rao, P., Sagonas, K., Swift, T., Warren, D.S.: Efficient access mechanisms for tabled logic programs. J. Logic Program. 38(1), 31\u201354 (1999)","journal-title":"J. Logic Program."},{"issue":"3","key":"11_CR10","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. Program. Lang. Syst. 20(3), 586\u2013634 (1998)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-24599-5_23","volume-title":"Logic Programming","author":"J Wielemaker","year":"2003","unstructured":"Wielemaker, J.: Native preemptive threads in SWI-prolog. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 331\u2013345. Springer, Heidelberg (2003)"}],"container-title":["Communications in Computer and Information Science","Languages, Applications and Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27653-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T09:35:31Z","timestamp":1653903331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27653-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319276526","9783319276533"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27653-3_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]}}}