{"id":"https://openalex.org/W3178381410","doi":"https://doi.org/10.1007/978-3-030-79876-5_25","title":"Dual Proof Generation for Quantified Boolean Formulas with a BDD-based Solver","display_name":"Dual Proof Generation for Quantified Boolean Formulas with a BDD-based Solver","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3178381410","doi":"https://doi.org/10.1007/978-3-030-79876-5_25","mag":"3178381410"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-79876-5_25","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-79876-5_25","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-79876-5_25.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-79876-5_25.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054408811","display_name":"Randal E. Bryant","orcid":"https://orcid.org/0000-0001-5024-6613"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Randal E. Bryant","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, United States"],"raw_orcid":"https://orcid.org/0000-0001-5024-6613","affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, United States","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025921874","display_name":"Marijn J. H. Heule","orcid":"https://orcid.org/0000-0002-5587-8801"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marijn J. H. Heule","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, United States"],"raw_orcid":"https://orcid.org/0000-0002-5587-8801","affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, United States","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054408811"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":4.9063,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.96211324,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"433","last_page":"449"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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.9979000091552734,"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/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.9958999752998352,"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/binary-decision-diagram","display_name":"Binary decision diagram","score":0.7373889088630676},{"id":"https://openalex.org/keywords/tautology","display_name":"Tautology (logic)","score":0.684726357460022},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6747955083847046},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.5437759757041931},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5358574986457825},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5261996388435364},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4603341519832611},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4354396164417267},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.42807018756866455},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.42484769225120544},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.4214048683643341},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.41031041741371155},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4003724455833435},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.369031697511673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2738952040672302},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.17226701974868774},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.1456834375858307}],"concepts":[{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.7373889088630676},{"id":"https://openalex.org/C166374712","wikidata":"https://www.wikidata.org/wiki/Q209555","display_name":"Tautology (logic)","level":5,"score":0.684726357460022},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6747955083847046},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.5437759757041931},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5358574986457825},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5261996388435364},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4603341519832611},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4354396164417267},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.42807018756866455},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.42484769225120544},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.4214048683643341},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.41031041741371155},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4003724455833435},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.369031697511673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2738952040672302},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17226701974868774},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.1456834375858307},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-79876-5_25","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-79876-5_25","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-79876-5_25.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/978-3-030-79876-5_25","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-79876-5_25","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-79876-5_25.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[{"score":0.8100000023841858,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G8995341299","display_name":"SHF: Small: Mechanical Verification of QBF Results","funder_award_id":"2010951","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3178381410.pdf","grobid_xml":"https://content.openalex.org/works/W3178381410.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W88271430","https://openalex.org/W99602494","https://openalex.org/W173417183","https://openalex.org/W179349679","https://openalex.org/W1496518193","https://openalex.org/W1579221659","https://openalex.org/W1608888815","https://openalex.org/W1720224351","https://openalex.org/W1800789167","https://openalex.org/W1976876676","https://openalex.org/W1982333717","https://openalex.org/W2011039300","https://openalex.org/W2030224590","https://openalex.org/W2080267935","https://openalex.org/W2127982853","https://openalex.org/W2133527541","https://openalex.org/W2149441048","https://openalex.org/W2233304325","https://openalex.org/W2405635959","https://openalex.org/W2547601025","https://openalex.org/W2592985765","https://openalex.org/W2804240010","https://openalex.org/W2809711152","https://openalex.org/W2949458057","https://openalex.org/W2995839731","https://openalex.org/W3136791784","https://openalex.org/W3164530004","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2796388654","https://openalex.org/W2036901448","https://openalex.org/W1656268799","https://openalex.org/W3107131366","https://openalex.org/W2590445006","https://openalex.org/W2963321374","https://openalex.org/W2014111643","https://openalex.org/W2332241156","https://openalex.org/W4240374464","https://openalex.org/W2005573219"],"abstract_inverted_index":{"Abstract":[0],"Existing":[1],"proof-generating":[2],"quantified":[3],"Boolean":[4],"formula":[5,19],"(QBF)":[6],"solvers":[7],"must":[8],"construct":[9],"a":[10,29,41,55,70,83,122,127],"different":[11],"type":[12],"of":[13,54,57,97,113],"proof":[14,44,74,99],"depending":[15],"on":[16,33,126],"whether":[17],"the":[18,73,77,95,98,101,110],"is":[20],"false":[21,71],"(refutation)":[22],"or":[23],"true":[24,84],"(satisfaction).":[25],"We":[26,117],"show":[27],"that":[28],"QBF":[30],"solver":[31,120],"based":[32,125],"ordered":[34],"binary":[35],"decision":[36],"diagrams":[37],"(BDDs)":[38],"can":[39],"emit":[40],"single":[42],"dual":[43],"as":[45],"it":[46,86,106],"operates,":[47],"supporting":[48],"either":[49],"outcome.":[50],"This":[51],"form":[52],"consists":[53],"sequence":[56],"equivalence-preserving":[58],"clause":[59],"addition":[60],"and":[61,100],"deletion":[62],"steps":[63],"in":[64],"an":[65],"extended":[66],"resolution":[67],"framework.":[68],"For":[69,82],"formula,":[72],"terminates":[75,87],"with":[76,88],"empty":[78],"clause,":[79],"indicating":[80,92],"conflict.":[81],"one,":[85],"all":[89],"clauses":[90],"deleted,":[91],"tautology.":[93],"Both":[94],"length":[96],"time":[102],"required":[103],"to":[104,109],"check":[105],"are":[107],"proportional":[108],"total":[111],"number":[112],"BDD":[114],"operations":[115],"performed.":[116],"evaluate":[118],"our":[119],"using":[121],"scalable":[123],"benchmark":[124],"two-player":[128],"tiling":[129],"game.":[130]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}