{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:29:37Z","timestamp":1725568177729},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287001"},{"type":"electronic","value":"9783540319252"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549468_82","type":"book-chapter","created":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T17:18:34Z","timestamp":1288027114000},"page":"750-760","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Investigation of Sharing Strategies for Answer Set Solvers and SAT Solvers"],"prefix":"10.1007","author":[{"given":"Hung Viet","family":"Le","sequence":"first","affiliation":[]},{"given":"Enrico","family":"Pontelli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"82_CR1","unstructured":"Blochinger, W., et al.: Parallel SAT-Checking with Lemma Exchange: Implementation and Applications. Theory & Apps. of Satisfiability Testing, ENDM (2001)"},{"key":"82_CR2","doi-asserted-by":"crossref","unstructured":"Bonacina, M.: Taxonomy of Parallel Strategies for Deduction. Annals Math. & AI\u00a029 (2000)","DOI":"10.1023\/A:1018932114059"},{"key":"82_CR3","unstructured":"Chrabakh, W., Wolski, R.: A Parallel SAT solver for the Grid. UCSB TR 2003-05 (2003)"},{"key":"82_CR4","unstructured":"Finkel, R., et al.: Computing Stable Models in Parallel.In: AAAI Spring Symposium (2001)"},{"key":"82_CR5","unstructured":"Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programs. In:ILPS (1988)"},{"issue":"4","key":"82_CR6","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1145\/504083.504085","volume":"23","author":"G. Gupta","year":"2001","unstructured":"Gupta, G., et al.: Parallel Execution of Prolog Programs. ACM TOPLAS\u00a023(4), 472\u2013602 (2001)","journal-title":"ACM TOPLAS"},{"key":"82_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-46767-X_28","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V.: Answer Set Planning. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol.\u00a01730, pp. 373\u2013374. Springer, Heidelberg (1999)"},{"key":"82_CR8","unstructured":"Lin, F., Zhao, Y.: Computing Answer Sets By SAT Solvers. In:AAAI (2002)"},{"key":"82_CR9","volume-title":"The Logic Programming Paradigm","author":"V.W. Marek","year":"1999","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Stable Models and an Alternative Logic Programming Paradigm. In: The Logic Programming Paradigm, Springer, Heidelberg (1999)"},{"key":"82_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/978-3-540-48085-3_25","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"L. Perron","year":"1999","unstructured":"Perron, L.: Search and Parallelism in Constraint Programming. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 346\u2013361. Springer, Heidelberg (1999)"},{"key":"82_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45241-9_20","volume-title":"Practical Aspects of Declarative Languages","author":"E. Pontelli","year":"2001","unstructured":"Pontelli, E., El-Kathib, O.: Construction of a Parallel Engine for ASP. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol.\u00a01990, p. 288. Springer, Heidelberg (2001)"},{"issue":"3","key":"82_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF03037223","volume":"17","author":"D. Ranjan","year":"1999","unstructured":"Ranjan, D., et al.: On the Complexity of Or-Parallelism. NGC\u00a017(3), 285\u2013308 (1999)","journal-title":"NGC"},{"key":"82_CR13","unstructured":"Simons, P.: Extending and Implementing the Stable Model Semantics. PhD, HUT (2000)"},{"key":"82_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-540-45209-6_98","volume-title":"Euro-Par 2003 Parallel Processing","author":"K. Villaverde","year":"2003","unstructured":"Villaverde, K., et al.: A methodology for order-sensitive execution of non-deterministic languages on beowulf platforms. In: Kosch, H., B\u00f6sz\u00f6rm\u00e9nyi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol.\u00a02790, pp. 694\u2013703. Springer, Heidelberg (2003)"},{"key":"82_CR15","first-page":"1","volume":"11","author":"H. Zhang","year":"1996","unstructured":"Zhang, H., et al.: PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems. J. Symbolic Computation\u00a011, 1\u201318 (1996)","journal-title":"J. Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2005 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549468_82","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:09:59Z","timestamp":1587341399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549468_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287001","9783540319252"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11549468_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}