{"id":"https://openalex.org/W2790974881","doi":"https://doi.org/10.1007/s10817-018-9455-7","title":"A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality","display_name":"A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality","publication_year":2018,"publication_date":"2018-03-12","ids":{"openalex":"https://openalex.org/W2790974881","doi":"https://doi.org/10.1007/s10817-018-9455-7","mag":"2790974881","pmid":"https://pubmed.ncbi.nlm.nih.gov/30069073"},"language":"en","primary_location":{"id":"doi:10.1007/s10817-018-9455-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10817-018-9455-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10817-018-9455-7.pdf","source":{"id":"https://openalex.org/S99781599","display_name":"Journal of Automated Reasoning","issn_l":"0168-7433","issn":["0168-7433","1573-0670"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Automated Reasoning","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10817-018-9455-7.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079200257","display_name":"Jasmin Christian Blanchette","orcid":"https://orcid.org/0000-0002-8367-0936"},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["FR","NL"],"is_corresponding":true,"raw_author_name":"Jasmin Christian Blanchette","raw_affiliation_strings":["1Section of Theoretical Computer Science, Department of Computer Science, Vrije Universiteit Amsterdam, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands","2Max-Planck-Institut f\u00fcr Informatik, Saarland Informatics Campus E1 4, 66123 Saarbr\u00fccken, Germany","VERIDIS - Modeling and Verification of Distributed Algorithms and Systems (France)","LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications (Campus Scientifique BP 239 54506 Vandoeuvre-l\u00e8s-Nancy Cedex - France)","VU - Vrije Universiteit Amsterdam [Amsterdam] (De Boelelaan 1105 1081 HV Amsterdam - Pays-Bas)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"1Section of Theoretical Computer Science, Department of Computer Science, Vrije Universiteit Amsterdam, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands","institution_ids":[]},{"raw_affiliation_string":"2Max-Planck-Institut f\u00fcr Informatik, Saarland Informatics Campus E1 4, 66123 Saarbr\u00fccken, Germany","institution_ids":[]},{"raw_affiliation_string":"VERIDIS - Modeling and Verification of Distributed Algorithms and Systems (France)","institution_ids":[]},{"raw_affiliation_string":"LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications (Campus Scientifique BP 239 54506 Vandoeuvre-l\u00e8s-Nancy Cedex - France)","institution_ids":["https://openalex.org/I4210121838"]},{"raw_affiliation_string":"VU - Vrije Universiteit Amsterdam [Amsterdam] (De Boelelaan 1105 1081 HV Amsterdam - Pays-Bas)","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"middle","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"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Mathias Fleury","raw_affiliation_strings":["2Max-Planck-Institut f\u00fcr Informatik, Saarland Informatics Campus E1 4, 66123 Saarbr\u00fccken, Germany","Saarbr\u00fccken Graduate School of Computer Science, Saarland Informatics Campus E1 3, 66123 Saarbr\u00fccken, Germany","MPII - Max-Planck-Institut f\u00fcr Informatik (Campus E-1 4, 66123 Saarbr\u00fccken, Germany - Allemagne)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"2Max-Planck-Institut f\u00fcr Informatik, Saarland Informatics Campus E1 4, 66123 Saarbr\u00fccken, Germany","institution_ids":[]},{"raw_affiliation_string":"Saarbr\u00fccken Graduate School of Computer Science, Saarland Informatics Campus E1 3, 66123 Saarbr\u00fccken, Germany","institution_ids":[]},{"raw_affiliation_string":"MPII - Max-Planck-Institut f\u00fcr Informatik (Campus E-1 4, 66123 Saarbr\u00fccken, Germany - Allemagne)","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082037264","display_name":"Peter Lammich","orcid":"https://orcid.org/0000-0003-3576-0504"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Lammich","raw_affiliation_strings":["4Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstra\u00dfe 3, Garching, Germany","TUM - Technische Universit\u00e4t Munchen - Universit\u00e9 Technique de Munich [Munich, Allemagne] (Arcisstrasse 21, D- 80333 M\u00fcnchen - Allemagne)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"4Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstra\u00dfe 3, Garching, Germany","institution_ids":[]},{"raw_affiliation_string":"TUM - Technische Universit\u00e4t Munchen - Universit\u00e9 Technique de Munich [Munich, Allemagne] (Arcisstrasse 21, D- 80333 M\u00fcnchen - Allemagne)","institution_ids":["https://openalex.org/I62916508"]}]},{"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":["2Max-Planck-Institut f\u00fcr Informatik, Saarland Informatics Campus E1 4, 66123 Saarbr\u00fccken, Germany","MPII - Max-Planck-Institut f\u00fcr Informatik (Campus E-1 4, 66123 Saarbr\u00fccken, Germany - Allemagne)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"2Max-Planck-Institut f\u00fcr Informatik, Saarland Informatics Campus E1 4, 66123 Saarbr\u00fccken, Germany","institution_ids":[]},{"raw_affiliation_string":"MPII - Max-Planck-Institut f\u00fcr Informatik (Campus E-1 4, 66123 Saarbr\u00fccken, Germany - Allemagne)","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5079200257"],"corresponding_institution_ids":["https://openalex.org/I4210121838","https://openalex.org/I865915315"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":4.5135,"has_fulltext":true,"cited_by_count":44,"citation_normalized_percentile":{"value":0.95439189,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"61","issue":"1-4","first_page":"333","last_page":"365"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9986000061035156,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9962000250816345,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6090222001075745},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5808619856834412},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5544572472572327},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5229585766792297},{"id":"https://openalex.org/keywords/problem-solver","display_name":"Problem solver","score":0.5059253573417664},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.46235427260398865},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.35015618801116943},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33914780616760254},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29178959131240845},{"id":"https://openalex.org/keywords/software-engineering","display_name":"Software engineering","score":0.1862162947654724}],"concepts":[{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6090222001075745},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5808619856834412},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5544572472572327},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5229585766792297},{"id":"https://openalex.org/C3019612716","wikidata":"https://www.wikidata.org/wiki/Q730920","display_name":"Problem solver","level":2,"score":0.5059253573417664},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.46235427260398865},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.35015618801116943},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33914780616760254},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29178959131240845},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.1862162947654724}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1007/s10817-018-9455-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10817-018-9455-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10817-018-9455-7.pdf","source":{"id":"https://openalex.org/S99781599","display_name":"Journal of Automated Reasoning","issn_l":"0168-7433","issn":["0168-7433","1573-0670"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Automated Reasoning","raw_type":"journal-article"},{"id":"pmid:30069073","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/30069073","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of automated reasoning","raw_type":null},{"id":"pmh:oai:research.vu.nl:openaire/44ee03ef-180e-478e-bfc6-5b5db8013893","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/44ee03ef-180e-478e-bfc6-5b5db8013893","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Blanchette, J C, Fleury, M, Lammich, P & Weidenbach, C 2018, 'A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality', Journal of Automated Reasoning, vol. 2018, no. 1-4, pp. 1-33. https://doi.org/10.1007/s10817-018-9455-7","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:HAL:hal-01904579v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01904579","pdf_url":"https://inria.hal.science/hal-01904579v1/file/sat_article.pdf","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":"Journal of Automated Reasoning, 2018, 61 (1-4), pp.333-365. ⟨10.1007/s10817-018-9455-7⟩","raw_type":"Journal articles"},{"id":"pmh:oai:europepmc.org:5015313","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/6044257","pdf_url":null,"source":{"id":"https://openalex.org/S4306400806","display_name":"Europe PMC (PubMed Central)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1303153112","host_organization_name":"European Bioinformatics Institute","host_organization_lineage":["https://openalex.org/I1303153112"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},{"id":"pmh:oai:mediatum.ub.tum.de:node/1531202","is_oa":true,"landing_page_url":"http://mediatum.ub.tum.de/node?id=1531202","pdf_url":null,"source":{"id":"https://openalex.org/S4306400453","display_name":"mediaTUM \u2013 the media and publications repository of the Technical University Munich (Technical University Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"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":"","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/120e72e9-f939-434b-8344-bf28b5334426","is_oa":true,"landing_page_url":"https://research.manchester.ac.uk/en/publications/120e72e9-f939-434b-8344-bf28b5334426","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Blanchette, J C, Fleury, M, Lammich, P & Weidenbach, C 2018, 'A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality', Journal of Automated Reasoning, vol. 61, no. 1-4, pp. 333-365. https://doi.org/10.1007/s10817-018-9455-7","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/120e72e9-f939-434b-8344-bf28b5334426","is_oa":true,"landing_page_url":"http://link.springer.com/10.1007/s10817-018-9455-7","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:research.vu.nl:publications/44ee03ef-180e-478e-bfc6-5b5db8013893","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/citedby.url?scp=85043697141&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"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":"Blanchette, J C, Fleury, M, Lammich, P & Weidenbach, C 2018, 'A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality', Journal of Automated Reasoning, vol. 2018, no. 1-4, pp. 1-33. https://doi.org/10.1007/s10817-018-9455-7","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s10817-018-9455-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10817-018-9455-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10817-018-9455-7.pdf","source":{"id":"https://openalex.org/S99781599","display_name":"Journal of Automated Reasoning","issn_l":"0168-7433","issn":["0168-7433","1573-0670"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Automated Reasoning","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.6399999856948853}],"awards":[{"id":"https://openalex.org/G1694576325","display_name":null,"funder_award_id":"713999","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G6937246109","display_name":null,"funder_award_id":"713999","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320322434","display_name":"Max-Planck-Gesellschaft","ror":"https://ror.org/01hhn8329"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2790974881.pdf","grobid_xml":"https://content.openalex.org/works/W2790974881.grobid-xml"},"referenced_works_count":57,"referenced_works":["https://openalex.org/W15103390","https://openalex.org/W46694604","https://openalex.org/W266135116","https://openalex.org/W836255558","https://openalex.org/W1216298300","https://openalex.org/W1480459634","https://openalex.org/W1497978324","https://openalex.org/W1498523273","https://openalex.org/W1513576223","https://openalex.org/W1518705996","https://openalex.org/W1522519483","https://openalex.org/W1523874359","https://openalex.org/W1552715853","https://openalex.org/W1569975162","https://openalex.org/W1579218062","https://openalex.org/W1591830785","https://openalex.org/W1807554065","https://openalex.org/W1881903642","https://openalex.org/W1955004327","https://openalex.org/W1968376266","https://openalex.org/W1991066194","https://openalex.org/W1996404651","https://openalex.org/W2000872679","https://openalex.org/W2022589543","https://openalex.org/W2022846948","https://openalex.org/W2029843512","https://openalex.org/W2048051309","https://openalex.org/W2057361103","https://openalex.org/W2061969020","https://openalex.org/W2080046595","https://openalex.org/W2089728649","https://openalex.org/W2094855848","https://openalex.org/W2106192381","https://openalex.org/W2114237827","https://openalex.org/W2117664102","https://openalex.org/W2142785340","https://openalex.org/W2148817888","https://openalex.org/W2153096231","https://openalex.org/W2154318861","https://openalex.org/W2206900256","https://openalex.org/W2221495694","https://openalex.org/W2282536569","https://openalex.org/W2293069733","https://openalex.org/W2293405767","https://openalex.org/W2468912077","https://openalex.org/W2494829073","https://openalex.org/W2534205211","https://openalex.org/W2564212270","https://openalex.org/W2734612968","https://openalex.org/W2752853835","https://openalex.org/W2790974881","https://openalex.org/W2987977008","https://openalex.org/W3102087768","https://openalex.org/W4229840182","https://openalex.org/W4250846042","https://openalex.org/W4250850800","https://openalex.org/W4256124958"],"related_works":["https://openalex.org/W2011621332","https://openalex.org/W2116898168","https://openalex.org/W1605093979","https://openalex.org/W2152572054","https://openalex.org/W2920969592","https://openalex.org/W4386614288","https://openalex.org/W2074269745","https://openalex.org/W2115480761","https://openalex.org/W2568362682","https://openalex.org/W1836984851"],"abstract_inverted_index":{"We":[0,91],"developed":[1],"a":[2,16,28,34,39,46,60],"formal":[3],"framework":[4,58],"for":[5,115],"conflict-driven":[6],"clause":[7],"learning":[8],"(CDCL)":[9],"using":[10],"the":[11,71,80,98,111,122],"Isabelle/HOL":[12],"proof":[13],"assistant.":[14],"Through":[15],"chain":[17],"of":[18,107,113,124],"refinements,":[19],"an":[20,50],"abstract":[21],"CDCL":[22],"calculus":[23],"is":[24],"connected":[25],"first":[26],"to":[27,33,45,63,96],"more":[29],"concrete":[30],"calculus,":[31],"then":[32],"SAT":[35,47],"solver":[36,48],"expressed":[37],"in":[38,49,88],"functional":[40],"programming":[41],"language,":[42,52],"and":[43,66,84,118,121],"finally":[44],"imperative":[51,76],"with":[53,68],"total":[54],"correctness":[55],"guarantees.":[56],"The":[57,75,103],"offers":[59],"convenient":[61],"way":[62],"prove":[64],"metatheorems":[65],"experiment":[67],"variants,":[69],"including":[70],"Davis-Putnam-Logemann-Loveland":[72],"(DPLL)":[73],"calculus.":[74],"program":[77],"relies":[78],"on":[79],"two-watched-literal":[81],"data":[82],"structure":[83],"other":[85],"optimizations":[86],"found":[87],"modern":[89],"solvers.":[90],"used":[92],"Isabelle's":[93],"Refinement":[94],"Framework":[95],"automate":[97],"most":[99,104],"tedious":[100],"refinement":[101],"steps.":[102],"noteworthy":[105],"aspects":[106],"our":[108],"work":[109],"are":[110],"inclusion":[112],"rules":[114],"forget,":[116],"restart,":[117],"incremental":[119],"solving":[120],"application":[123],"stepwise":[125],"refinement.":[126]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5}],"updated_date":"2026-05-23T08:51:43.019350","created_date":"2025-10-10T00:00:00"}