{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:55:26Z","timestamp":1762102526204,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030518240"},{"type":"electronic","value":"9783030518257"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-51825-7_5","type":"book-chapter","created":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T23:00:13Z","timestamp":1593558013000},"page":"62-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Four Flavors of Entailment"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7883-7749","authenticated-orcid":false,"given":"Sibylle","family":"M\u00f6hle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0989-6101","authenticated-orcid":false,"given":"Roberto","family":"Sebastiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7170-9242","authenticated-orcid":false,"given":"Armin","family":"Biere","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s00224-013-9447-2","volume":"53","author":"A Bernasconi","year":"2013","unstructured":"Bernasconi, A., Ciriani, V., Luccio, F., Pagli, L.: Compact DSOP and partial DSOP forms. Theory Comput. Syst. 53(4), 583\u2013608 (2013). \n                  https:\/\/doi.org\/10.1007\/s00224-013-9447-2","journal-title":"Theory Comput. Syst."},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193\u2013207. Springer, Heidelberg (1999). \n                  https:\/\/doi.org\/10.1007\/3-540-49059-0_14"},{"key":"5_CR3","unstructured":"Biere, A., H\u00f6lldobler, S., M\u00f6hle, S.: An abstract dual propositional model counter. In: YSIP, CEUR Workshop Proceedings, vol. 1837, pp. 17\u201326. CEUR-WS.org (2017)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-22110-1_17","volume-title":"Computer Aided Verification","author":"J Brauer","year":"2011","unstructured":"Brauer, J., King, A., Kriener, J.: Existential quantification as incremental SAT. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 191\u2013207. Springer, Heidelberg (2011). \n                  https:\/\/doi.org\/10.1007\/978-3-642-22110-1_17"},{"issue":"7","key":"5_CR5","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201\u2013215 (1960)","journal-title":"J. ACM"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Galindo, J.A., Acher, M., Tirado, J.M., Vidal, C., Baudry, B., Benavides, D.: Exploiting the enumeration of all feature model configurations: a new perspective with distributed computing. In: SPLC, pp. 74\u201378. ACM (2016)","DOI":"10.1145\/2934466.2934478"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-72200-7_23","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2007","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: a conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 260\u2013265. Springer, Heidelberg (2007). \n                  https:\/\/doi.org\/10.1007\/978-3-540-72200-7_23"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30494-4_20","volume-title":"Formal Methods in Computer-Aided Design","author":"O Grumberg","year":"2004","unstructured":"Grumberg, O., Schuster, A., Yadgar, A.: Memory efficient all-solutions SAT solver and its application for reachability analysis. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 275\u2013289. Springer, Heidelberg (2004). \n                  https:\/\/doi.org\/10.1007\/978-3-540-30494-4_20"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/3-540-40922-X_22","volume-title":"Formal Methods in Computer-Aided Design","author":"A Gupta","year":"2000","unstructured":"Gupta, A., Yang, Z., Ashar, P., Gupta, A.: SAT-based image computation with application in reachability analysis. In: Hunt, W.A., Johnson, S.D. (eds.) FMCAD 2000. LNCS, vol. 1954, pp. 391\u2013408. Springer, Heidelberg (2000). \n                  https:\/\/doi.org\/10.1007\/3-540-40922-X_22"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Klebanov, V., Manthey, N., Muise, C.: SAT-based analysis and quantification of information flow in programs. In: Joshi, K., Siegle, M., Stoelinga, M., D\u2019 Argenio, P.R. (eds.) QEST 2013. LNCS, vol. 8054, pp. 177\u2013192. Springer, Heidelberg (2013). \n                  https:\/\/doi.org\/10.1007\/978-3-642-40196-1_16","DOI":"10.1007\/978-3-642-40196-1_16"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Lagniez, J., Marquis, P.: A recursive algorithm for projected model counting. In: AAAI. pp. 1536\u20131543. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33011536"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/11817963_39","volume-title":"Computer Aided Verification","author":"SK Lahiri","year":"2006","unstructured":"Lahiri, S.K., Nieuwenhuis, R., Oliveras, A.: SMT techniques for fast predicate abstraction. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 424\u2013437. Springer, Heidelberg (2006). \n                  https:\/\/doi.org\/10.1007\/11817963_39"},{"key":"5_CR14","unstructured":"Li, B., Hsiao, M.S., Sheng, S.: A novel SAT all-solutions solver for efficient preimage computation. In: DATE, pp. 272\u2013279. IEEE Computer Society (2004)"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Lonsing, F., Egly, U.: Incremental QBF solving. In: O\u2019 Sullivan, Barry (ed.) CP 2014. LNCS, vol. 8656, pp. 514\u2013530. Springer, Cham (2014). \n                  https:\/\/doi.org\/10.1007\/978-3-319-10428-7_38","DOI":"10.1007\/978-3-319-10428-7_38"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-319-94418-0_27","volume-title":"Sailing Routes in the World of Computation","author":"J Marques-Silva","year":"2018","unstructured":"Marques-Silva, J.: Computing with SAT oracles: past, present and future. In: Manea, F., Miller, R.G., Nowotka, D. (eds.) CiE 2018. LNCS, vol. 10936, pp. 264\u2013276. Springer, Cham (2018). \n                  https:\/\/doi.org\/10.1007\/978-3-319-94418-0_27"},{"issue":"5","key":"5_CR17","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."},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45657-0_19","volume-title":"Computer Aided Verification","author":"KL McMillan","year":"2002","unstructured":"McMillan, K.L.: Applying SAT methods in unbounded symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 250\u2013264. Springer, Heidelberg (2002). \n                  https:\/\/doi.org\/10.1007\/3-540-45657-0_19"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"M\u00f6hle, S., Biere, A.: Dualizing projected model counting. In: Tsoukalas, L.H., Gr\u00e9goire, \u00c9., Alamaniotis, M. (eds.) ICTAI 2018, pp. 702\u2013709. IEEE (2018)","DOI":"10.1109\/ICTAI.2018.00111"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-030-24258-9_18","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"S M\u00f6hle","year":"2019","unstructured":"M\u00f6hle, S., Biere, A.: Backing backtracking. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 250\u2013266. Springer, Cham (2019). \n                  https:\/\/doi.org\/10.1007\/978-3-030-24258-9_18"},{"key":"5_CR21","unstructured":"M\u00f6hle, S., Biere, A.: Combining conflict-driven clause learning and chronological backtracking for propositional model counting. In: GCAI, EPiC Series in Computing, vol. 65, pp. 113\u2013126. EasyChair (2019)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Morettin, P., Passerini, A., Sebastiani, R.: Efficient weighted model integration via SMT-based predicate abstraction. In: IJCAI, pp. 720\u2013728. ijcai.org (2017)","DOI":"10.24963\/ijcai.2017\/100"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2019.04.003","volume":"275","author":"P Morettin","year":"2019","unstructured":"Morettin, P., Passerini, A., Sebastiani, R.: Advanced SMT techniques for weighted model integration. Artif. Intell. 275, 1\u201327 (2019)","journal-title":"Artif. Intell."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: DAC, pp. 530\u2013535. ACM (2001)","DOI":"10.1145\/378239.379017"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-94144-8_7","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"A Nadel","year":"2018","unstructured":"Nadel, A., Ryvchin, V.: Chronological backtracking. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 111\u2013121. Springer, Cham (2018). \n                  https:\/\/doi.org\/10.1007\/978-3-319-94144-8_7"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.1.11201","volume":"62","author":"U Oztok","year":"2018","unstructured":"Oztok, U., Darwiche, A.: An exhaustive DPLL algorithm for model counting. J. Artif. Intell. Res. 62, 1\u201332 (2018)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"5_CR27","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10817-008-9114-5","volume":"42","author":"M Samer","year":"2009","unstructured":"Samer, M., Szeider, S.: Backdoor sets of quantified Boolean formulas. J. Autom. Reasoning 42(1), 77\u201397 (2009)","journal-title":"J. Autom. Reasoning"},{"key":"5_CR28","unstructured":"Sebastiani, R.: Are you satisfied by this partial assignment? \n                  https:\/\/arxiv.org\/abs\/2003.04225"},{"issue":"3\u20134","key":"5_CR29","first-page":"141","volume":"3","author":"R Sebastiani","year":"2007","unstructured":"Sebastiani, R.: Lazy satisfiability modulo theories. JSAT 3(3\u20134), 141\u2013224 (2007)","journal-title":"JSAT"},{"key":"5_CR30","unstructured":"Sheng, S., Hsiao, M.S.: Efficient preimage computation using a novel success-driven ATPG. In: DATE, pp. 10822\u201310827. IEEE Computer Society (2003)"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/10722167_36","volume-title":"Computer Aided Verification","author":"O Shtrichman","year":"2000","unstructured":"Shtrichman, O.: Tuning SAT checkers for bounded model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 480\u2013494. Springer, Heidelberg (2000). \n                  https:\/\/doi.org\/10.1007\/10722167_36"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Tibebu, A.T., Fey, G.: Augmenting all solution SAT solving for circuits with structural information. In: DDECS, pp. 117\u2013122. IEEE (2018)","DOI":"10.1109\/DDECS.2018.00028"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Toda, T., Soh, T.: Implementing efficient all solutions SAT solvers, ACM J. Exp. Algorithmics, 21(1), 1.12:1\u20131.12:44 (2016)","DOI":"10.1145\/2975585"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-41010-9_4","volume-title":"Formal Methods for Industrial Critical Systems","author":"C Zengler","year":"2013","unstructured":"Zengler, C., K\u00fcchlin, W.: Boolean quantifier elimination for automotive configuration \u2013 a case study. In: Pecheur, C., Dierkes, M. (eds.) FMICS 2013. LNCS, vol. 8187, pp. 48\u201362. Springer, Heidelberg (2013). \n                  https:\/\/doi.org\/10.1007\/978-3-642-41010-9_4"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51825-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T23:08:43Z","timestamp":1596841723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51825-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030518240","9783030518257"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51825-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"26 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Satisfiability Testing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Alghero","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sat2020.idea-researchlab.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}