{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:57Z","timestamp":1725664977043},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617563"},{"type":"electronic","value":"9783540706540"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61756-6_89","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:20:23Z","timestamp":1330276823000},"page":"243-258","source":"Crossref","is-referenced-by-count":14,"title":["Beyond depth-first: Improving tabled logic programs through alternative scheduling strategies"],"prefix":"10.1007","author":[{"given":"Juliana","family":"Freire","sequence":"first","affiliation":[]},{"given":"Terrance","family":"Swift","sequence":"additional","affiliation":[]},{"given":"David S.","family":"Warren","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"17_CR1","unstructured":"H. A\u00eft-Kaci. WAM: A Tutorial Reconstruction. MIT Press, 1991."},{"issue":"3","key":"17_CR2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0743-1066(91)90038-Q","volume":"10","author":"C. Beeri","year":"1991","unstructured":"C. Beeri and R. Ramakrishnan. On the Power of Magic. Journal of Logic Programming, 10(3):255\u2013299, 1991.","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"17_CR3","doi-asserted-by":"crossref","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":"17_CR4","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 Conference on Programming Language Design and Implementation (PLDI), pages 117\u2013125. ACM, 1996.","DOI":"10.1145\/231379.231399"},{"issue":"7","key":"17_CR5","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1002\/spe.4380220706","volume":"22","author":"C. Fan","year":"1992","unstructured":"C. Fan and S. Dietrich. Extension Table Built-ins for Prolo. Software-Practice and Experience, 22(7):573\u2013597, July 1992.","journal-title":"Software-Practice and Experience"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"J. Freire, R. Hu, T. Swift, and D.S. Warren. Exploiting Parallelism in Tabled Evaluations. In 7th International Symposium, PLILP 95 \u2014 LNCS Vol. 982. Springer-Verlag, 1995.","DOI":"10.1007\/BFb0026817"},{"key":"17_CR7","volume-title":"Technical Report 96\/2","author":"J. Freire","year":"1996","unstructured":"J. Freire, T. Swift, and D.S. Warren. Batched answers: An alternative strategy for tabled evaluations. Technical Report 96\/2, Department of Computer Science, State University of New York at Stony Brook, 1996."},{"key":"17_CR8","volume-title":"Technical Report 96\/4","author":"J. Freire","year":"1996","unstructured":"J. Freire, T. Swift, and D.S. Warren. Taking I\/O seriously: Resolution reconsidered for disk. Technical Report 96\/4, Department of Computer Science, State University of New York at Stony Brook, 1996."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.-L. Lassez. Constraint logic programming. In Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages (POPL), pages 111\u2013119, 1987.","DOI":"10.1145\/41625.41635"},{"key":"17_CR10","unstructured":"G. Janssens, M. Bruynooghe, and V. Dumortier. A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic Programs. In Proceedings of the International Symposium on Logic Programming (ILPS), 1995."},{"key":"17_CR11","unstructured":"D. E. Knuth. The Stanford GraphBase: A Platform for Combinatorial Computing. Addison Wesley, 1993."},{"issue":"2","key":"17_CR12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00961871","volume":"4","author":"G. K\u00f6stler","year":"1995","unstructured":"G. K\u00f6stler, W. Kiessling, H. Th\u00f6ne, and U. G\u00fcntzer. Fixpoint iteration with subsumption in deductive databases. Journal of Intelligent Information Systems (JIIS), 4(2):123\u2013148, March 1995.","journal-title":"Journal of Intelligent Information Systems (JIIS)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"T.C. Przymusinski. Every logic program has a natural stratification and an iterated least fixed point model. In Proceedings of the ACM Symposium on Principle of Database Systems (PODS), pages 11\u201321, 1989.","DOI":"10.1145\/73721.73723"},{"key":"17_CR14","volume-title":"PhD thesis","author":"T. Swift","year":"1994","unstructured":"T. Swift. Efficient Evaluation of Normal Logic Programs. PhD thesis, Department of Computer Science, State University of New York at Stony Brook, 1994."},{"key":"17_CR15","unstructured":"T. Swift and D. S. Warren. An Abstract Machine for SLG Resolution: Definite Programs. In Proceedings of the International Symposium on Logic Programming (ILPS), pages 633\u2013654, 1994."},{"key":"17_CR16","unstructured":"T. Swift and D. S. Warren. Analysis of sequential SLG evaluation. In Proceedings of the International Symposium on Logic Programming (ILPS), pages 219\u2013238, 1994."},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"A. van Gelder. Foundations of Aggregation in Deductive Databases. In Proceedings of the International Conference on Deductive and Object-Oriented Databases (DOOD), pages 13\u201334, 1993.","DOI":"10.1007\/3-540-57530-8_2"},{"issue":"3","key":"17_CR18","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder van","year":"1991","unstructured":"A. van Gelder, K.A. Ross, and J.S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. JACM, 38(3):620\u2013650, 1991.","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics, and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61756-6_89.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:36:22Z","timestamp":1619559382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61756-6_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617563","9783540706540"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-61756-6_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}