{"id":"https://openalex.org/W2398036300","doi":"https://doi.org/10.29007/fblb","title":"CDCL with Less Destructive Backtracking through Partial Ordering","display_name":"CDCL with Less Destructive Backtracking through Partial Ordering","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W2398036300","doi":"https://doi.org/10.29007/fblb","mag":"2398036300"},"language":"en","primary_location":{"id":"doi:10.29007/fblb","is_oa":false,"landing_page_url":"https://doi.org/10.29007/fblb","pdf_url":null,"source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","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/A5012789130","display_name":"Anthony Monnet","orcid":null},"institutions":[{"id":"https://openalex.org/I159129438","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al","ror":"https://ror.org/002rjbv21","country_code":"CA","type":"education","lineage":["https://openalex.org/I159129438","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Anthony Monnet","raw_affiliation_strings":["Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al, Montreal, Canada"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al, Montreal, Canada","institution_ids":["https://openalex.org/I159129438"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045225534","display_name":"Roger Villemaire","orcid":"https://orcid.org/0009-0008-9222-885X"},"institutions":[{"id":"https://openalex.org/I159129438","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al","ror":"https://ror.org/002rjbv21","country_code":"CA","type":"education","lineage":["https://openalex.org/I159129438","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Roger Villemaire","raw_affiliation_strings":["Universite du Qu\u00e9bec a Montreal"],"affiliations":[{"raw_affiliation_string":"Universite du Qu\u00e9bec a Montreal","institution_ids":["https://openalex.org/I159129438"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012789130"],"corresponding_institution_ids":["https://openalex.org/I159129438"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.00295543,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"21","issue":null,"first_page":"124","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9990000128746033,"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.9990000128746033,"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/T10142","display_name":"Formal Methods in Verification","score":0.996399998664856,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9944000244140625,"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/backtracking","display_name":"Backtracking","score":0.9413458704948425},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7571002244949341},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6370382905006409},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6318625211715698},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.5975534915924072},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.538493812084198},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.4599560499191284},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4396265745162964},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3769552409648895},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3528393805027008},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.333219438791275},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1174052357673645},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.08080154657363892}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.9413458704948425},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7571002244949341},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6370382905006409},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6318625211715698},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.5975534915924072},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.538493812084198},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.4599560499191284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4396265745162964},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3769552409648895},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3528393805027008},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.333219438791275},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1174052357673645},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.08080154657363892},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.29007/fblb","is_oa":false,"landing_page_url":"https://doi.org/10.29007/fblb","pdf_url":null,"source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},{"id":"mag:2398036300","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/cade/paar2012.html#MonnetV12","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.8100000023841858,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W78552530","https://openalex.org/W128869332","https://openalex.org/W205249600","https://openalex.org/W1608123432","https://openalex.org/W1748533846","https://openalex.org/W1966350062","https://openalex.org/W1970908002","https://openalex.org/W2010880586","https://openalex.org/W2029448190","https://openalex.org/W2044560939","https://openalex.org/W2094368841","https://openalex.org/W2105210717","https://openalex.org/W2136950039","https://openalex.org/W2138319640","https://openalex.org/W2142785340","https://openalex.org/W2184595489","https://openalex.org/W2913258176"],"related_works":["https://openalex.org/W2953843826","https://openalex.org/W59043292","https://openalex.org/W301365898","https://openalex.org/W3039500262","https://openalex.org/W2294335085","https://openalex.org/W2886746432","https://openalex.org/W6730885","https://openalex.org/W2215774152","https://openalex.org/W2286662631","https://openalex.org/W2156964787","https://openalex.org/W3010355169","https://openalex.org/W3113010888","https://openalex.org/W2954319419","https://openalex.org/W2808706008","https://openalex.org/W2997126574","https://openalex.org/W2129791282","https://openalex.org/W2047325845","https://openalex.org/W2989262635","https://openalex.org/W2166776175","https://openalex.org/W1549765843"],"abstract_inverted_index":{"Conflict-driven":[0],"clause":[1],"learning":[2],"is":[3],"currently":[4],"the":[5,22,31,39,64],"most":[6],"efficient":[7],"complete":[8],"algorithm":[9,41],"for":[10],"satisfiability":[11,84],"solving.":[12],"However,":[13],"a":[14,46,74],"conflict-directed":[15],"backtrack":[16],"deletes":[17],"potentially":[18],"large":[19],"portions":[20],"of":[21,89],"current":[23],"assignment":[24],"that":[25,38,56,80],"have":[26],"no":[27],"direct":[28],"relation":[29],"with":[30,45],"conflict.":[32],"In":[33],"this":[34],"paper,":[35],"we":[36],"show":[37,79],"CDCL":[40,72,76],"can":[42],"be":[43,59],"generalized":[44],"partial":[47,70],"ordering":[48,71],"on":[49,86],"decision":[50],"levels.":[51],"This":[52],"allows":[53],"keeping":[54],"levels":[55],"would":[57],"otherwise":[58],"undone":[60],"during":[61],"backtracking":[62],"under":[63],"usual":[65],"total":[66],"ordering.":[67],"We":[68],"implement":[69],"in":[73],"state-of-the-art":[75],"solver":[77],"and":[78],"it":[81],"significantly":[82],"ameliorates":[83],"solving":[85],"some":[87],"series":[88],"benchmarks.":[90]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}