{"id":"https://openalex.org/W3124061582","doi":"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_29","title":"Ternary Propagation-Based Local Search for More Bit-Precise Reasoning","display_name":"Ternary Propagation-Based Local Search for More Bit-Precise Reasoning","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3124061582","doi":"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_29","mag":"3124061582"},"language":"en","primary_location":{"id":"pmh:oai:repositum.tuwien.at:20.500.12708/15525","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.12708/15525","pdf_url":"http://hdl.handle.net/20.500.12708/15525","source":{"id":"https://openalex.org/S4306400494","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Inproceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/20.500.12708/15525","any_repository_has_fulltext":true},"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/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Niemetz, Aina","raw_affiliation_strings":["Stanford University ()"],"affiliations":[{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002729618","display_name":"Mathias Preiner","orcid":"https://orcid.org/0000-0002-7142-6258"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Preiner, Mathias","raw_affiliation_strings":["Stanford University ()"],"affiliations":[{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001172270"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9984999895095825,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9984999895095825,"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.9976999759674072,"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"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9962999820709229,"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/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6140437126159668},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5957794189453125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4843231737613678},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4716799855232239},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.45766690373420715},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.41800931096076965},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.41698744893074036},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3662463426589966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2957651615142822}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6140437126159668},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5957794189453125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4843231737613678},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4716799855232239},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.45766690373420715},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.41800931096076965},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41698744893074036},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3662463426589966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2957651615142822},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:repositum.tuwien.at:20.500.12708/15525","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.12708/15525","pdf_url":"http://hdl.handle.net/20.500.12708/15525","source":{"id":"https://openalex.org/S4306400494","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Inproceedings"},{"id":"doi:10.34727/2020/isbn.978-3-85448-042-6_29","is_oa":true,"landing_page_url":"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_29","pdf_url":null,"source":{"id":"https://openalex.org/S4306400493","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:repositum.tuwien.at:20.500.12708/15525","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.12708/15525","pdf_url":"http://hdl.handle.net/20.500.12708/15525","source":{"id":"https://openalex.org/S4306400494","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Inproceedings"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.44999998807907104,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3124061582.pdf"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W55301369","https://openalex.org/W128869332","https://openalex.org/W221832247","https://openalex.org/W1494865762","https://openalex.org/W1601158010","https://openalex.org/W1605798759","https://openalex.org/W2051111453","https://openalex.org/W2105505307","https://openalex.org/W2136177401","https://openalex.org/W2238963713","https://openalex.org/W2764059762","https://openalex.org/W2899831531","https://openalex.org/W2956992268","https://openalex.org/W2958011253","https://openalex.org/W2959756750","https://openalex.org/W2963310240","https://openalex.org/W2969652480","https://openalex.org/W2995422495","https://openalex.org/W3033455412"],"related_works":["https://openalex.org/W2465314249","https://openalex.org/W3134206239","https://openalex.org/W3176862352","https://openalex.org/W2963185930","https://openalex.org/W2603352844","https://openalex.org/W2950558303","https://openalex.org/W3013760975","https://openalex.org/W2528337068","https://openalex.org/W2779212808","https://openalex.org/W2026790447","https://openalex.org/W2163651657","https://openalex.org/W2999307977","https://openalex.org/W1600251413","https://openalex.org/W2802734398","https://openalex.org/W3121218067","https://openalex.org/W3186831878","https://openalex.org/W2950104892","https://openalex.org/W2554165547","https://openalex.org/W2155963553","https://openalex.org/W2888583758"],"abstract_inverted_index":{"Current":[0],"state":[1],"of":[2,80],"the":[3,40,115,146],"art":[4],"for":[5,36,125,134],"reasoning":[6],"about":[7],"quantifier-free":[8],"bit-vector":[9,120],"constraints":[10],"in":[11,30,65,67,71,153],"Satisfiability":[12],"Modulo":[13],"Theories":[14],"(SMT)":[15],"is":[16,83],"a":[17,72,77,150],"technique":[18],"called":[19],"bit-blasting,":[20],"an":[21,139],"eager":[22],"translation":[23],"into":[24],"propositional":[25],"logic":[26],"(SAT).":[27],"While":[28],"efficient":[29],"practice,":[31],"it":[32],"may":[33],"not":[34],"scale":[35],"large":[37],"bit-widths":[38],"when":[39],"input":[41],"size":[42],"cannot":[43],"be":[44,59,90],"sufficiently":[45],"reduced":[46],"with":[47,69,103],"preprocessing":[48],"techniques.":[49],"A":[50],"recent":[51],"propagation-based":[52,100],"local":[53,101],"search":[54,102],"procedure":[55,116],"was":[56],"shown":[57],"to":[58,86,92,105,109,117],"effective":[60],"on":[61],"hard":[62],"satisfiable":[63],"instances,":[64],"particular":[66],"combination":[68],"bit-blasting":[70],"sequential":[73],"portfolio":[74],"setting.":[75],"However,":[76],"major":[78],"weakness":[79],"this":[81,96],"approach":[82],"its":[84],"obliviousness":[85],"bits":[87,108],"that":[88,145],"can":[89],"simplified":[91],"constant":[93,107],"values.":[94,111],"In":[95],"paper,":[97],"we":[98],"generalize":[99],"respect":[104],"such":[106],"ternary":[110],"We":[112,137],"further":[113],"extend":[114],"handle":[118],"more":[119,126],"operators,":[121],"and":[122,143],"introduce":[123],"heuristics":[124],"precise":[127],"inverse":[128],"value":[129],"computation":[130],"via":[131],"bound":[132],"tightening":[133],"inequality":[135],"constraints.":[136],"provide":[138],"extensive":[140],"experimental":[141],"evaluation":[142],"show":[144],"presented":[147],"techniques":[148],"yield":[149],"considerable":[151],"improvement":[152],"performance.":[154]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}