{"id":"https://openalex.org/W3032765078","doi":"https://doi.org/10.29007/96wb","title":"A Verified SAT Solver Framework including Optimization and Partial Valuations","display_name":"A Verified SAT Solver Framework including Optimization and Partial Valuations","publication_year":2020,"publication_date":"2020-05-27","ids":{"openalex":"https://openalex.org/W3032765078","doi":"https://doi.org/10.29007/96wb","mag":"3032765078"},"language":"en","primary_location":{"id":"doi:10.29007/96wb","is_oa":true,"landing_page_url":"https://doi.org/10.29007/96wb","pdf_url":"https://easychair.org/publications/open/b7Cr","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/b7Cr","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086520801","display_name":"Mathias Fleury","orcid":"https://orcid.org/0000-0002-1705-3083"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT","DE"],"is_corresponding":true,"raw_author_name":"Mathias Fleury","raw_affiliation_strings":["Johannes Kepler University Linz, Austria","Max-Planck-Institut fr Informatik, Saarland Informatics Campus, Saarland","Max-Planck-Institut f\u00fcr Informatik, Saarland Informatics Campus, Saarland"],"affiliations":[{"raw_affiliation_string":"Johannes Kepler University Linz, Austria","institution_ids":["https://openalex.org/I121883995"]},{"raw_affiliation_string":"Max-Planck-Institut fr Informatik, Saarland Informatics Campus, Saarland","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarland Informatics Campus, Saarland","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046034681","display_name":"Christoph Weidenbach","orcid":"https://orcid.org/0000-0001-6002-0458"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph Weidenbach","raw_affiliation_strings":["Max-Planck-Institut fr Informatik, Saarland Informatics Campus, Saarland","Max-Planck-Institut f\u00fcr Informatik, Saarland Informatics Campus, Saarland"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut fr Informatik, Saarland Informatics Campus, Saarland","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarland Informatics Campus, Saarland","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086520801"],"corresponding_institution_ids":["https://openalex.org/I121883995","https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":0.2719,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63416437,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"73","issue":null,"first_page":"212","last_page":"193"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7565613985061646},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6120203137397766},{"id":"https://openalex.org/keywords/hol","display_name":"HOL","score":0.5283380746841431},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5181183218955994},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.48483574390411377},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4783446490764618},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.46400418877601624},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4591578245162964},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4252152442932129},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.4151560962200165},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40003252029418945},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3295440673828125},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.24779683351516724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21509835124015808},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12315693497657776}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7565613985061646},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6120203137397766},{"id":"https://openalex.org/C17435882","wikidata":"https://www.wikidata.org/wiki/Q17030435","display_name":"HOL","level":2,"score":0.5283380746841431},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5181183218955994},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.48483574390411377},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4783446490764618},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.46400418877601624},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4591578245162964},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4252152442932129},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4151560962200165},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40003252029418945},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3295440673828125},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24779683351516724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21509835124015808},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12315693497657776},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.29007/96wb","is_oa":true,"landing_page_url":"https://doi.org/10.29007/96wb","pdf_url":"https://easychair.org/publications/open/b7Cr","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02963986v1","is_oa":true,"landing_page_url":"https://hal.univ-lorraine.fr/hal-02963986","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, May 2020, Alicante, Spain. pp.212-193, ⟨10.29007/96wb⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"doi:10.29007/96wb","is_oa":true,"landing_page_url":"https://doi.org/10.29007/96wb","pdf_url":"https://easychair.org/publications/open/b7Cr","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2197641028","display_name":null,"funder_award_id":"CRC 248","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3032765078.pdf","grobid_xml":"https://content.openalex.org/works/W3032765078.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W111132822","https://openalex.org/W1480459634","https://openalex.org/W1557686760","https://openalex.org/W1579218062","https://openalex.org/W1594550269","https://openalex.org/W1728966390","https://openalex.org/W1881903642","https://openalex.org/W1996404651","https://openalex.org/W2012022843","https://openalex.org/W2022846948","https://openalex.org/W2105888199","https://openalex.org/W2110210775","https://openalex.org/W2149999206","https://openalex.org/W2401610261","https://openalex.org/W2494829073","https://openalex.org/W2495968914","https://openalex.org/W2790974881","https://openalex.org/W2923952739","https://openalex.org/W2969660840","https://openalex.org/W3009380104","https://openalex.org/W4206807714","https://openalex.org/W4232591300","https://openalex.org/W4243217271","https://openalex.org/W4244448683","https://openalex.org/W4250846042","https://openalex.org/W4250850800","https://openalex.org/W4256124958","https://openalex.org/W4287901611","https://openalex.org/W4298072213"],"related_works":["https://openalex.org/W2585743557","https://openalex.org/W1594958113","https://openalex.org/W3193153727","https://openalex.org/W2477568018","https://openalex.org/W43811100","https://openalex.org/W2155335449","https://openalex.org/W3083750017","https://openalex.org/W4386614288","https://openalex.org/W2115480761","https://openalex.org/W2920896101"],"abstract_inverted_index":{"Based":[0],"on":[1,29],"our":[2,69,145],"formal":[3],"framework":[4,50,128],"for":[5,51,85,95],"CDCL":[6,20,52,126,154,165],"(conflict-driven":[7],"clause":[8],"learning)":[9],"using":[10],"the":[11,77,83,124,135,138,142,149,168],"proof":[12],"assistant":[13],"Isabelle/HOL,":[14],"we":[15,81,104],"verify":[16],"an":[17,163],"extension":[18],"of":[19,36,117,123,137,144,153],"computing":[21],"cost-minimal":[22],"models":[23,35,87,174],"called":[24,57],"OCDCL.":[25,65,102],"It":[26],"is":[27,60,148],"based":[28],"branch":[30,54,156],"and":[31,33,55,157,159,167],"bound":[32,158],"computes":[34,172],"minimal":[37],"cost":[38],"with":[39,53,88,155,175],"respect":[40,89,176],"to":[41,63,71,90,93,107,113,133,162,177],"total":[42,96],"valuations.":[43,179],"The":[44],"verification":[45,127],"starts":[46],"by":[47,101],"developing":[48],"a":[49,115],"bound,":[56],"CDCLBnB,":[58],"which":[59],"then":[61,67],"instantiated":[62],"get":[64],"We":[66],"apply":[68],"formalization":[70,152],"three":[72],"different":[73],"applications.":[74],"Firstly,":[75],"through":[76],"dual":[78],"rail":[79],"encoding,":[80],"reduce":[82,134],"search":[84],"cost-optimal":[86,97,173],"partial":[91,178],"valuations":[92],"searching":[94],"models,":[98],"as":[99],"derived":[100],"Secondly,":[103],"instantiate":[105],"OCDCL":[106],"solve":[108],"MAX-SAT,":[109],"and,":[110],"thirdly,":[111],"CDCLBnB":[112],"compute":[114],"set":[116],"covering":[118],"models.":[119],"A":[120],"large":[121],"part":[122],"original":[125],"was":[129],"reused":[130],"without":[131],"changes":[132],"complexity":[136],"new":[139],"formalization.":[140],"To":[141],"best":[143],"knowledge,":[146],"this":[147],"first":[150,169],"rigorous":[151],"its":[160],"application":[161],"optimizing":[164],"calculus,":[166],"solution":[170],"that":[171]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2020-06-05T00:00:00"}