{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:34:20Z","timestamp":1740548060844,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226710"},{"type":"electronic","value":"9783540277750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27775-0_18","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T20:29:36Z","timestamp":1284582576000},"page":"254-268","source":"Crossref","is-referenced-by-count":0,"title":["Speculative Computations in Or-Parallel Tabled Logic Programs"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Rocha","sequence":"first","affiliation":[]},{"given":"Fernando","family":"Silva","sequence":"additional","affiliation":[]},{"given":"V\u00edtor","family":"Santos Costa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","first-page":"449","volume-title":"Proceedings of the International Logic Programming Symposium","author":"K. Ali","year":"1987","unstructured":"Ali, K.: A Method for Implementing Cut in Parallel Execution of Prolog. In: Proceedings of the International Logic Programming Symposium, pp. 449\u2013456. IEEE Computer Society Press, Los Alamitos (1987)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Hausman, B.: Pruning and SpeculativeWork in OR-Parallel PROLOG. PhD thesis, The Royal Institute of Technology (1990)","DOI":"10.1007\/3-540-51285-3_38"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/BF01379406","volume":"21","author":"K. Ali","year":"1992","unstructured":"Ali, K., Karlsson, R.: Scheduling Speculative Work in MUSE and Performance Results. International Journal of Parallel Programming\u00a021, 449\u2013476 (1992)","journal-title":"International Journal of Parallel Programming"},{"key":"18_CR4","first-page":"135","volume-title":"Proceedings of the 10th International Conference on Logic Programming","author":"A. Beaumont","year":"1993","unstructured":"Beaumont, A., Warren, D.H.D.: Scheduling SpeculativeWork in Or-Parallel Prolog Systems. In: Proceedings of the 10th International Conference on Logic Programming, pp. 135\u2013149. The MIT Press, Cambridge (1993)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF01547894","volume":"20","author":"A. Ciepielewski","year":"1991","unstructured":"Ciepielewski, A.: Scheduling in Or-parallel Prolog Systems: Survey and Open Problems. International Journal of Parallel Programming\u00a020, 421\u2013451 (1991)","journal-title":"International Journal of Parallel Programming"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-45635-X_11","volume-title":"Logic Programming","author":"R. Rocha","year":"2001","unstructured":"Rocha, R., Silva, F., Santos Costa, V.: On a Tabling Engine that Can Exploit Or-Parallelism. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 43\u201358. Springer, Heidelberg (2001)"},{"key":"18_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-48159-1_13","volume-title":"Progress in Artificial Intelligence","author":"R. Rocha","year":"1999","unstructured":"Rocha, R., Silva, F., Santos Costa, V.: YapOr: an Or-Parallel Prolog System Based on Environment Copying. In: Barahona, P., Alferes, J.J. (eds.) EPIA 1999. LNCS (LNAI), vol.\u00a01695, pp. 178\u2013192. Springer, Heidelberg (1999)"},{"key":"18_CR8","unstructured":"Rocha, R., Silva, F., Santos Costa, V.: YapTab: A Tabling Engine Designed to Support Parallelism. In: Proceedings of the 2nd Conference on Tabulation in Parsing and Deduction, pp. 77\u201387 (2000)"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/BF01397627","volume":"19","author":"K. Ali","year":"1990","unstructured":"Ali, K., Karlsson, R.: Full Prolog and Scheduling OR-Parallelism in Muse. International Journal of Parallel Programming\u00a019, 445\u2013475 (1990)","journal-title":"International Journal of Parallel Programming"},{"key":"18_CR10","first-page":"442","volume-title":"Proceedings of the ACM SIGMOD International Conference on the Management of Data","author":"K. Sagonas","year":"1994","unstructured":"Sagonas, K., Swift, T., Warren, D.S.: XSB as an Efficient Deductive Database Engine. In: Proceedings of the ACM SIGMOD International Conference on the Management of Data, pp. 442\u2013453. ACM Press, New York (1994)"},{"key":"18_CR11","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, 586\u2013634 (1998)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"18_CR12","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, 31\u201354 (1999)","journal-title":"Journal of Logic Programming"},{"key":"18_CR13","unstructured":"Guo, H.F., Gupta, G.: Cuts in Tabled Logic Programming. In: Proceedings of the Colloquium on Implementation of Constraint and LOgic Programming Systems (2002)"},{"key":"18_CR14","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)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-36575-3_6","volume-title":"Programming Languages and Systems","author":"L.F. Castro","year":"2003","unstructured":"Castro, L.F., Warren, D.S.: Approximate Pruning in Tabled Logic Programming. In: Degano, P. (ed.) ESOP 2003. LNCS, vol.\u00a02618, pp. 69\u201383. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27775-0_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T21:25:34Z","timestamp":1740518734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27775-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226710","9783540277750"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27775-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}