{"id":"https://openalex.org/W4251694050","doi":"https://doi.org/10.1109/fmcad.2014.6987611","title":"Turbo-charging Lemmas on demand with don't care reasoning","display_name":"Turbo-charging Lemmas on demand with don't care reasoning","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W4251694050","doi":"https://doi.org/10.1109/fmcad.2014.6987611"},"language":"en","primary_location":{"id":"doi:10.1109/fmcad.2014.6987611","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2014.6987611","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001172270","display_name":"Aina Niemetz","orcid":"https://orcid.org/0000-0003-2600-5283"},"institutions":[{"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"],"is_corresponding":true,"raw_author_name":"Aina Niemetz","raw_affiliation_strings":["Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria"],"affiliations":[{"raw_affiliation_string":"Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002729618","display_name":"Mathias Preiner","orcid":"https://orcid.org/0000-0002-7142-6258"},"institutions":[{"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"],"is_corresponding":false,"raw_author_name":"Mathias Preiner","raw_affiliation_strings":["Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria"],"affiliations":[{"raw_affiliation_string":"Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082596567","display_name":"Armin Biere","orcid":"https://orcid.org/0000-0001-7170-9242"},"institutions":[{"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"],"is_corresponding":false,"raw_author_name":"Armin Biere","raw_affiliation_strings":["Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria"],"affiliations":[{"raw_affiliation_string":"Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001172270"],"corresponding_institution_ids":["https://openalex.org/I121883995"],"apc_list":null,"apc_paid":null,"fwci":1.4243,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.83622151,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"179","last_page":"186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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.9991000294685364,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.8997136354446411},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7721068859100342},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6789770722389221},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.6785354018211365},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6234196424484253},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5558882355690002},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4836667478084564},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.48229315876960754},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4812174141407013},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47132375836372375},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.42955905199050903},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4155951738357544},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34718969464302063},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3333476781845093},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3310253620147705},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1565723419189453},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.08895277976989746}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.8997136354446411},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7721068859100342},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6789770722389221},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.6785354018211365},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6234196424484253},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5558882355690002},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4836667478084564},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.48229315876960754},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4812174141407013},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47132375836372375},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.42955905199050903},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4155951738357544},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34718969464302063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3333476781845093},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3310253620147705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1565723419189453},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.08895277976989746},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fmcad.2014.6987611","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2014.6987611","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W129935311","https://openalex.org/W161683976","https://openalex.org/W646410877","https://openalex.org/W1563456403","https://openalex.org/W1644782203","https://openalex.org/W1834186039","https://openalex.org/W1968179244","https://openalex.org/W2018678448","https://openalex.org/W2032890961","https://openalex.org/W2118791871","https://openalex.org/W2127142430","https://openalex.org/W2142563857","https://openalex.org/W2158395308","https://openalex.org/W2158602337","https://openalex.org/W2167400570","https://openalex.org/W3098346725","https://openalex.org/W4232532984","https://openalex.org/W6605298281","https://openalex.org/W6633843490","https://openalex.org/W6678906159","https://openalex.org/W6679104218","https://openalex.org/W6683354071","https://openalex.org/W6684267561","https://openalex.org/W6686986373"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W2578463151","https://openalex.org/W21597398","https://openalex.org/W1505872263","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W4281812495","https://openalex.org/W2810367355","https://openalex.org/W1913543287"],"abstract_inverted_index":{"Lemmas":[0],"on":[1,38,49,93],"demand":[2,39,94],"is":[3,109],"an":[4,83],"abstraction/refinement":[5],"technique":[6,34],"for":[7,35],"procedures":[8],"deciding":[9],"Satisfiability":[10],"Modulo":[11],"Theories":[12],"(SMT),":[13],"which":[14,87],"iteratively":[15],"refines":[16],"full":[17,50],"candidate":[18,43,51],"models":[19,44],"of":[20,69,101],"the":[21,67,99,106],"formula":[22],"abstraction":[23],"until":[24],"convergence.":[25],"In":[26],"this":[27],"paper,":[28],"we":[29,54],"introduce":[30],"a":[31,59],"dual":[32],"propagation-based":[33],"optimizing":[36],"lemmas":[37,92,102],"by":[40,90],"extracting":[41],"partial":[42],"via":[45],"don't":[46,96],"care":[47,97],"reasoning":[48],"models.":[52],"Further,":[53],"compare":[55],"our":[56,77],"approach":[57,61],"to":[58,63],"justification-based":[60],"similar":[62],"techniques":[64],"employed":[65],"in":[66,76],"context":[68],"model":[70],"checking.":[71],"We":[72],"implemented":[73],"both":[74],"optimizations":[75],"SMT":[78],"solver":[79,107],"Boolector":[80],"and":[81,104],"provide":[82],"extensive":[84],"experimental":[85],"evaluation,":[86],"shows":[88],"that":[89],"enhancing":[91],"with":[95],"reasoning,":[98],"number":[100],"generated,":[103],"consequently":[105],"runtime,":[108],"reduced":[110],"considerably.":[111]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}