{"id":"https://openalex.org/W2184319032","doi":"https://doi.org/10.1109/hpec.2014.8466735","title":"Extreme SAT-based Constraint solving with R-Solve","display_name":"Extreme SAT-based Constraint solving with R-Solve","publication_year":2014,"publication_date":"2014-09-01","ids":{"openalex":"https://openalex.org/W2184319032","doi":"https://doi.org/10.1109/hpec.2014.8466735","mag":"2184319032"},"language":"en","primary_location":{"id":"doi:10.1109/hpec.2014.8466735","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2014.8466735","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE High Performance Extreme Computing Conference (HPEC)","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/A5003537070","display_name":"James Ezick","orcid":null},"institutions":[{"id":"https://openalex.org/I4210102519","display_name":"Reservoir Labs (United States)","ror":"https://ror.org/01a3m3f05","country_code":"US","type":"company","lineage":["https://openalex.org/I4210102519"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"James Ezick","raw_affiliation_strings":["Reservoir Labs, Inc., New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Reservoir Labs, Inc., New York, NY, USA","institution_ids":["https://openalex.org/I4210102519"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089567502","display_name":"Jonathan Springer","orcid":null},"institutions":[{"id":"https://openalex.org/I4210102519","display_name":"Reservoir Labs (United States)","ror":"https://ror.org/01a3m3f05","country_code":"US","type":"company","lineage":["https://openalex.org/I4210102519"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan Springer","raw_affiliation_strings":["Reservoir Labs, Inc., New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Reservoir Labs, Inc., New York, NY, USA","institution_ids":["https://openalex.org/I4210102519"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081290223","display_name":"Tom Henretty","orcid":null},"institutions":[{"id":"https://openalex.org/I4210102519","display_name":"Reservoir Labs (United States)","ror":"https://ror.org/01a3m3f05","country_code":"US","type":"company","lineage":["https://openalex.org/I4210102519"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tom Henretty","raw_affiliation_strings":["Reservoir Labs, Inc., New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Reservoir Labs, Inc., New York, NY, USA","institution_ids":["https://openalex.org/I4210102519"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085951493","display_name":"Chanseok Oh","orcid":null},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chanseok Oh","raw_affiliation_strings":["Department of Computer Science, New York University, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, New York University, New York, NY, USA","institution_ids":["https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5003537070"],"corresponding_institution_ids":["https://openalex.org/I4210102519"],"apc_list":null,"apc_paid":null,"fwci":0.6896,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.76493033,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9973999857902527,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9952999949455261,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7230545878410339},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6534377336502075},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5748682022094727},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5624288320541382},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5442784428596497},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5361061096191406},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5008530616760254},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.493720144033432},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.44822508096694946},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.436467707157135},{"id":"https://openalex.org/keywords/adaptation","display_name":"Adaptation (eye)","score":0.43013614416122437},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.41660356521606445},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3885083794593811},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.18570220470428467},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17201054096221924},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1717144250869751},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15421462059020996}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7230545878410339},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6534377336502075},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5748682022094727},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5624288320541382},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5442784428596497},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5361061096191406},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5008530616760254},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.493720144033432},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.44822508096694946},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.436467707157135},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.43013614416122437},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.41660356521606445},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3885083794593811},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18570220470428467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17201054096221924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1717144250869751},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15421462059020996},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec.2014.8466735","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2014.8466735","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE High Performance Extreme Computing Conference (HPEC)","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":26,"referenced_works":["https://openalex.org/W78552530","https://openalex.org/W90023127","https://openalex.org/W169672073","https://openalex.org/W1564340405","https://openalex.org/W1568031762","https://openalex.org/W1950282396","https://openalex.org/W1999396796","https://openalex.org/W2012416679","https://openalex.org/W2046239089","https://openalex.org/W2076373700","https://openalex.org/W2092775861","https://openalex.org/W2096307462","https://openalex.org/W2110123236","https://openalex.org/W2133527541","https://openalex.org/W2142785340","https://openalex.org/W2147148915","https://openalex.org/W2735126411","https://openalex.org/W4239438681","https://openalex.org/W4245630182","https://openalex.org/W4251625379","https://openalex.org/W6603199135","https://openalex.org/W6603700884","https://openalex.org/W6606921157","https://openalex.org/W6634006490","https://openalex.org/W6674427772","https://openalex.org/W6679878532"],"related_works":["https://openalex.org/W4318620547","https://openalex.org/W4386614288","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/W1913543287"],"abstract_inverted_index":{"We":[0,96],"present":[1],"the":[2,12,19,62,100,123],"architecture":[3],"of":[4,58,104,116,125],"R-Solve,":[5],"a":[6,41,55,113,119],"high-performance":[7],"constraint":[8,140],"solver":[9,110],"that":[10,29],"extends":[11],"gains":[13],"made":[14],"in":[15,48,84,138],"SAT":[16,44],"performance":[17,120],"over":[18],"past":[20],"fifteen":[21],"years":[22],"on":[23],"static":[24],"decision":[25],"problems":[26,28,83],"to":[27,81,111],"require":[30],"on-the-fly":[31],"adaptation,":[32],"solution":[33],"space":[34],"exploration":[35],"and":[36,50,54,87,93,102,127,130,142],"optimization.":[37,144],"R-Solve":[38,80,126],"brings":[39],"together":[40],"modern,":[42],"open":[43],"solver,":[45],"HPC":[46,136],"ideas":[47],"ensemble":[49],"collaborative":[51],"parallel":[52],"solving":[53,141],"novel":[56],"set":[57],"extensions":[59],"supporting,":[60],"for":[61,68,134],"first":[63],"time,":[64],"an":[65,106],"efficient":[66],"system":[67],"unrestricted":[69],"incremental":[70],"solving.":[71],"These":[72],"extensions,":[73],"which":[74],"we":[75],"call":[76],"Smart":[77,128],"Repair,":[78],"enable":[79],"address":[82],"dynamic":[85],"planning":[86],"constrained":[88,143],"optimization":[89],"involving":[90],"complex":[91],"logical":[92],"arithmetic":[94],"constraints.":[95],"provide":[97,118],"insight":[98],"into":[99],"rationale":[101],"challenges":[103],"extending":[105],"aggressively":[107],"optimized":[108],"competitive":[109],"support":[112],"new":[114,132],"class":[115],"problem,":[117],"milestone":[121],"illustrating":[122],"potential":[124],"Repair":[129],"discuss":[131],"frontiers":[133],"further":[135],"research":[137],"SAT-based":[139]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}