{"id":"https://openalex.org/W2767598808","doi":"https://doi.org/10.23919/fmcad.2017.8102235","title":"goSAT: Floating-point satisfiability as global optimization","display_name":"goSAT: Floating-point satisfiability as global optimization","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2767598808","doi":"https://doi.org/10.23919/fmcad.2017.8102235","mag":"2767598808"},"language":"en","primary_location":{"id":"doi:10.23919/fmcad.2017.8102235","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2017.8102235","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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/A5046615364","display_name":"M. Ammar Ben Khadra","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"M. Ammar Ben Khadra","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047920654","display_name":"Dominik Stoffel","orcid":"https://orcid.org/0000-0002-8180-9738"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dominik Stoffel","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066184879","display_name":"Wolfgang Kunz","orcid":"https://orcid.org/0000-0002-6612-2946"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Wolfgang Kunz","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5046615364"],"corresponding_institution_ids":["https://openalex.org/I153267046"],"apc_list":null,"apc_paid":null,"fwci":0.9084,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.77561316,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"11","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9995999932289124,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9995999932289124,"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/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"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.991100013256073,"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","display_name":"Satisfiability","score":0.8093071579933167},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.8090394735336304},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7038329839706421},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6411046981811523},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5834822058677673},{"id":"https://openalex.org/keywords/floating-point","display_name":"Floating point","score":0.5378510355949402},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.49742844700813293},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.49016961455345154},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.47790297865867615},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4306780695915222},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42611005902290344},{"id":"https://openalex.org/keywords/look-ahead","display_name":"Look-ahead","score":0.42245298624038696},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35619184374809265},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19187450408935547},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15465235710144043}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.8093071579933167},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.8090394735336304},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7038329839706421},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6411046981811523},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5834822058677673},{"id":"https://openalex.org/C84211073","wikidata":"https://www.wikidata.org/wiki/Q117879","display_name":"Floating point","level":2,"score":0.5378510355949402},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.49742844700813293},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.49016961455345154},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.47790297865867615},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4306780695915222},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42611005902290344},{"id":"https://openalex.org/C147297375","wikidata":"https://www.wikidata.org/wiki/Q6674930","display_name":"Look-ahead","level":2,"score":0.42245298624038696},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35619184374809265},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19187450408935547},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15465235710144043},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/fmcad.2017.8102235","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2017.8102235","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Formal Methods in Computer Aided Design (FMCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W199478921","https://openalex.org/W203276351","https://openalex.org/W602497127","https://openalex.org/W1716612759","https://openalex.org/W1986602910","https://openalex.org/W2074869363","https://openalex.org/W2119401655","https://openalex.org/W2123871098","https://openalex.org/W2127145687","https://openalex.org/W2157056800","https://openalex.org/W2160960847","https://openalex.org/W2238963713","https://openalex.org/W2301746362","https://openalex.org/W2484725950","https://openalex.org/W2603352844","https://openalex.org/W3105621768","https://openalex.org/W4251827013","https://openalex.org/W6637704679"],"related_works":["https://openalex.org/W2480084299","https://openalex.org/W1505872263","https://openalex.org/W3107131366","https://openalex.org/W2796388654","https://openalex.org/W1656268799","https://openalex.org/W2091617677","https://openalex.org/W1945774704","https://openalex.org/W4241145878","https://openalex.org/W2141151670","https://openalex.org/W3042552260"],"abstract_inverted_index":{"We":[0,16,57],"introduce":[1],"goSAT,":[2],"a":[3,31,52],"fast":[4],"and":[5,50,65,71],"publicly":[6],"available":[7],"SMT":[8,48],"solver":[9,23],"for":[10],"the":[11,19,27],"theory":[12],"of":[13,47],"floating-point":[14],"arithmetic.":[15],"build":[17],"on":[18],"recently":[20],"proposed":[21],"XSat":[22],"[1]":[24],"which":[25],"casts":[26],"satisfiability":[28],"problem":[29],"to":[30,37,68],"corresponding":[32],"global":[33],"optimization":[34,55,63],"problem.":[35],"Compared":[36],"XSat,":[38,69],"goSAT":[39],"is":[40],"an":[41],"integrated":[42],"tool":[43,60],"combining":[44],"JIT":[45],"compilation":[46],"formulas":[49],"NLopt,":[51],"feature-rich":[53],"mathematical":[54],"backend.":[56],"evaluate":[58],"our":[59],"using":[61],"several":[62],"algorithms":[64],"compare":[66],"it":[67],"Z3,":[70],"MathSat.":[72],"Our":[73],"evaluation":[74],"demonstrates":[75],"promising":[76],"results.":[77]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}