{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:46:36Z","timestamp":1742939196536,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232638"},{"type":"electronic","value":"9783319232645"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23264-5_37","type":"book-chapter","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T06:29:48Z","timestamp":1442212188000},"page":"446-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Clause-Learning for Modular Systems"],"prefix":"10.1007","author":[{"given":"David","family":"Mitchell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugenia","family":"Ternovska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,15]]},"reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.S.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"issue":"4\u20135","key":"37_CR2","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1017\/S1471068412000233","volume":"12","author":"T Eiter","year":"2012","unstructured":"Eiter, T., Fink, M., Krennwallner, T., Redl, C.: Conflict-driven ASP solving with external sources. Theory Pract. Logic Program. 12(4\u20135), 659\u2013679 (2012)","journal-title":"Theory Pract. Logic Program."},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-02846-5_22","volume-title":"Logic Programming","author":"M Gebser","year":"2009","unstructured":"Gebser, M., Ostrowski, M., Schaub, T.: Constraint answer set solving. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 235\u2013249. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Manthey, N.: Towards Next Generation Sequential and Parallel SAT Solvers. Ph.D. thesis, TU Dresden (2014)","key":"37_CR4","DOI":"10.1007\/s10601-015-9226-6"},{"issue":"5","key":"37_CR5","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"JP Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: Grasp: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506\u2013521 (1999)","journal-title":"IEEE Trans. Comput."},{"unstructured":"Mitchell, D.G., Ternovska, E.: A framework for representing and solving NP search problems. In: Veloso, M.M., Kambhampati, S. (eds.) Proceedings The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, 9\u201313 July, 2005, Pittsburgh, Pennsylvania, USA, pp. 430\u2013435. AAAI Press\/The MIT Press (2005)","key":"37_CR6"},{"key":"37_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-540-74970-7_39","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"O Ohrimenko","year":"2007","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation = lazy clause generation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 544\u2013558. Springer, Heidelberg (2007)"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-24364-6_18","volume-title":"Frontiers of Combining Systems","author":"S Tasharrofi","year":"2011","unstructured":"Tasharrofi, S., Ternovska, E.: A semantic account for modularity in multi-language modelling of search problems. In: Tinelli, C., Sofronie-Stokkermans, V. (eds.) FroCoS 2011. LNCS, vol. 6989, pp. 259\u2013274. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23264-5_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T11:28:20Z","timestamp":1676978900000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23264-5_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232638","9783319232645"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23264-5_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}