{"id":"https://openalex.org/W2294335085","doi":"https://doi.org/10.3233/sat190082","title":"Reusing the Assignment Trail in CDCL Solvers","display_name":"Reusing the Assignment Trail in CDCL Solvers","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W2294335085","doi":"https://doi.org/10.3233/sat190082","mag":"2294335085"},"language":"en","primary_location":{"id":"doi:10.3233/sat190082","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190082","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190082?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190082","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190082?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190082","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081884695","display_name":"Peter van der Tak","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Peter van der Tak","raw_affiliation_strings":["Department of Software Technology, Delft University of Technology, Delft, The Netherlands. E-mails:\u00a0peter@vdtak.eu,\u00a0ramosmaurer@hotmail.com"],"affiliations":[{"raw_affiliation_string":"Department of Software Technology, Delft University of Technology, Delft, The Netherlands. E-mails:\u00a0peter@vdtak.eu,\u00a0ramosmaurer@hotmail.com","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067401312","display_name":"Ant\u00f4nio Francisco Ramos","orcid":"https://orcid.org/0000-0003-4841-1442"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Antonio Ramos","raw_affiliation_strings":["Department of Software Technology, Delft University of Technology, Delft, The Netherlands. E-mails:\u00a0peter@vdtak.eu,\u00a0ramosmaurer@hotmail.com"],"affiliations":[{"raw_affiliation_string":"Department of Software Technology, Delft University of Technology, Delft, The Netherlands. E-mails:\u00a0peter@vdtak.eu,\u00a0ramosmaurer@hotmail.com","institution_ids":["https://openalex.org/I98358874"]}]},{"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/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":"Marijn Heule","raw_affiliation_strings":["Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria. E-mail:\u00a0marijn@heule.nl"],"affiliations":[{"raw_affiliation_string":"Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria. E-mail:\u00a0marijn@heule.nl","institution_ids":["https://openalex.org/I121883995"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025921874"],"corresponding_institution_ids":["https://openalex.org/I121883995"],"apc_list":null,"apc_paid":null,"fwci":1.9388,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.8666374,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"7","issue":"4","first_page":"133","last_page":"138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9983999729156494,"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.9983999729156494,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9825999736785889,"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.9801999926567078,"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/reuse","display_name":"Reuse","score":0.7001845836639404},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5390529036521912},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.16227006912231445},{"id":"https://openalex.org/keywords/waste-management","display_name":"Waste management","score":0.15331727266311646}],"concepts":[{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.7001845836639404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5390529036521912},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.16227006912231445},{"id":"https://openalex.org/C548081761","wikidata":"https://www.wikidata.org/wiki/Q180388","display_name":"Waste management","level":1,"score":0.15331727266311646}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/sat190082","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190082","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190082?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190082","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.3233/sat190082","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190082","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190082?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190082","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8488583251","display_name":null,"funder_award_id":"S11408-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321012","display_name":"Technische Universiteit Delft","ror":"https://ror.org/02e2c7k09"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2294335085.pdf","grobid_xml":"https://content.openalex.org/works/W2294335085.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W128869332","https://openalex.org/W1518705996","https://openalex.org/W1535230609","https://openalex.org/W1551913526","https://openalex.org/W1608123432","https://openalex.org/W1774277213","https://openalex.org/W2094855848","https://openalex.org/W2142785340","https://openalex.org/W2154318861","https://openalex.org/W2405976968","https://openalex.org/W4233090747","https://openalex.org/W4285719527","https://openalex.org/W4293646171","https://openalex.org/W6631957625","https://openalex.org/W6674197599","https://openalex.org/W6814292443"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2000444236","https://openalex.org/W2390279801","https://openalex.org/W2384475851","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2353602216","https://openalex.org/W2382290278"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,12,27,34,38,95,126],"solver":[3],"RestartSAT":[4,117],"which":[5,52],"includes":[6],"a":[7,16,43,47,66,92,102,105,120],"novel":[8],"technique":[9],"to":[10,14,37,100],"reduce":[11],"cost":[13],"perform":[15],"restart":[17,49,107],"in":[18,82],"CDCL":[19,30,85],"SAT":[20],"solvers.":[21],"This":[22],"technique,":[23],"called":[24],"ReusedTrail,":[25],"exploits":[26],"observation":[28],"that":[29,56,116],"solvers":[31],"often":[32],"reassign":[33],"same":[35,39],"variables":[36,58],"truth":[40],"values":[41],"after":[42,65],"restart.":[44,68],"It":[45],"computes":[46],"partial":[48],"level":[50,61],"for":[51],"it":[53,89],"is":[54],"guaranteed":[55],"all":[57],"below":[59],"this":[60],"will":[62],"be":[63,79],"reassigned":[64],"full":[67],"RestartSAT,":[69],"an":[70],"extended":[71],"version":[72],"of":[73,94],"MiniSAT,":[74],"incorporates":[75],"ReusedTrail":[76],"-which":[77],"can":[78],"implemented":[80],"easily":[81],"almost":[83],"any":[84],"solver.":[86],"On":[87],"average,":[88],"saves":[90],"over":[91,119],"third":[93],"decisions":[96],"and":[97],"propagations":[98],"necessary":[99],"solve":[101],"problem":[103],"using":[104],"Luby":[106],"policy":[108],"with":[109],"unit":[110],"run":[111],"1.":[112],"Experimental":[113],"results":[114],"show":[115],"solves":[118],"dozen":[121],"more":[122],"application":[123],"instances":[124],"than":[125],"default":[127],"MiniSAT.":[128]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}