{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:18:24Z","timestamp":1725538704849},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642046858"},{"type":"electronic","value":"9783642046865"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04686-5_10","type":"book-chapter","created":{"date-parts":[[2009,10,6]],"date-time":"2009-10-06T02:59:43Z","timestamp":1254797983000},"page":"113-125","source":"Crossref","is-referenced-by-count":0,"title":["On Improving the Efficiency of Deterministic Calls and Answers in Tabled Logic Programs"],"prefix":"10.1007","author":[{"given":"Miguel","family":"Areias","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Rocha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","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. Journal of the ACM\u00a043(1), 20\u201374 (1996)","journal-title":"Journal of the ACM"},{"key":"10_CR2","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.\u00a01140, pp. 243\u2013258. Springer, Heidelberg (1996)"},{"issue":"3","key":"10_CR3","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 Transactions on Programming Languages and Systems\u00a020(3), 586\u2013634 (1998)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1 & 2","key":"10_CR4","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"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/11562931_20","volume-title":"Logic Programming","author":"R. Rocha","year":"2005","unstructured":"Rocha, R., Silva, F., Santos Costa, V.: Dynamic mixed-strategy evaluation of tabled logic programs. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 250\u2013264. Springer, Heidelberg (2005)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-540-74610-2_27","volume-title":"Logic Programming","author":"V. Santos Costa","year":"2007","unstructured":"Santos Costa, V., Sagonas, K., Lopes, R.: Demand-driven indexing of prolog clauses. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 395\u2013409. Springer, Heidelberg (2007)"},{"issue":"1","key":"10_CR7","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. Journal of Logic Programming\u00a038(1), 31\u201354 (1999)","journal-title":"Journal of Logic Programming"},{"key":"10_CR8","first-page":"3","volume-title":"International Conference on Logic Programming","author":"M. Carlsson","year":"1989","unstructured":"Carlsson, M.: On the Efficiency of Optimising Shallow Backtracking in Compiled Prolog. In: International Conference on Logic Programming, pp. 3\u201316. The MIT Press, Cambridge (1989)"},{"key":"10_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7160.001.0001","volume-title":"Warren\u2019s Abstract Machine \u2013 A Tutorial Reconstruction","author":"H. A\u00eft-Kaci","year":"1991","unstructured":"A\u00eft-Kaci, H.: Warren\u2019s Abstract Machine \u2013 A Tutorial Reconstruction. MIT Press, Cambridge (1991)"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04686-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T16:26:18Z","timestamp":1590164778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04686-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046858","9783642046865"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04686-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}