{"id":"https://openalex.org/W2403284201","doi":"https://doi.org/10.29007/7n71","title":"Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers","display_name":"Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W2403284201","doi":"https://doi.org/10.29007/7n71","mag":"2403284201"},"language":"en","primary_location":{"id":"doi:10.29007/7n71","is_oa":true,"landing_page_url":"https://doi.org/10.29007/7n71","pdf_url":"https://easychair.org/publications/open/nTn","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":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/nTn","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015257932","display_name":"Steffen H\u00f6lldobler","orcid":null},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Steffen H\u00f6lldobler","raw_affiliation_strings":["International Center for Computational Logic Technische Universit\u00e4t Dresden"],"affiliations":[{"raw_affiliation_string":"International Center for Computational Logic Technische Universit\u00e4t Dresden","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025110435","display_name":"Norbert Manthey","orcid":null},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Norbert Manthey","raw_affiliation_strings":["International Center for Computational Logic Technische Universitt Dresden","International Center for Computational Logic Technische Universit\u00e4t Dresden"],"affiliations":[{"raw_affiliation_string":"International Center for Computational Logic Technische Universitt Dresden","institution_ids":["https://openalex.org/I78650965"]},{"raw_affiliation_string":"International Center for Computational Logic Technische Universit\u00e4t Dresden","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090587947","display_name":"Tobias Philipp","orcid":null},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tobias Philipp","raw_affiliation_strings":["International Center for Computational Logic Technische Universitt Dresden","International Center for Computational Logic Technische Universit\u00e4t Dresden"],"affiliations":[{"raw_affiliation_string":"International Center for Computational Logic Technische Universitt Dresden","institution_ids":["https://openalex.org/I78650965"]},{"raw_affiliation_string":"International Center for Computational Logic Technische Universit\u00e4t Dresden","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006707085","display_name":"Peter Steinke","orcid":null},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Steinke","raw_affiliation_strings":["International Center for Computational Logic Technische Universitt Dresden","International Center for Computational Logic Technische Universit\u00e4t Dresden"],"affiliations":[{"raw_affiliation_string":"International Center for Computational Logic Technische Universitt Dresden","institution_ids":["https://openalex.org/I78650965"]},{"raw_affiliation_string":"International Center for Computational Logic Technische Universit\u00e4t Dresden","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5015257932"],"corresponding_institution_ids":["https://openalex.org/I78650965"],"apc_list":null,"apc_paid":null,"fwci":0.3691,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.61620016,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"27","issue":null,"first_page":"89","last_page":"74"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9988999962806702,"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.9988999962806702,"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.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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9979000091552734,"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/soundness","display_name":"Soundness","score":0.845382571220398},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.795366108417511},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7513457536697388},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7095043063163757},{"id":"https://openalex.org/keywords/propositional-formula","display_name":"Propositional formula","score":0.6647739410400391},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5331560373306274},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5293368101119995},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.46384480595588684},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.45888906717300415},{"id":"https://openalex.org/keywords/dpll-algorithm","display_name":"DPLL algorithm","score":0.437304824590683},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4347488284111023},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41948145627975464},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.33663469552993774},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.29288673400878906},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.06621050834655762}],"concepts":[{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.845382571220398},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.795366108417511},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7513457536697388},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7095043063163757},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.6647739410400391},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5331560373306274},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5293368101119995},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.46384480595588684},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.45888906717300415},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.437304824590683},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4347488284111023},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41948145627975464},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.33663469552993774},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29288673400878906},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.06621050834655762},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"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/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.29007/7n71","is_oa":true,"landing_page_url":"https://doi.org/10.29007/7n71","pdf_url":"https://easychair.org/publications/open/nTn","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"}],"best_oa_location":{"id":"doi:10.29007/7n71","is_oa":true,"landing_page_url":"https://doi.org/10.29007/7n71","pdf_url":"https://easychair.org/publications/open/nTn","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2403284201.pdf","grobid_xml":"https://content.openalex.org/works/W2403284201.grobid-xml"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W47957325","https://openalex.org/W66855977","https://openalex.org/W78552530","https://openalex.org/W134175813","https://openalex.org/W139740642","https://openalex.org/W140733995","https://openalex.org/W157230443","https://openalex.org/W189838518","https://openalex.org/W1480459634","https://openalex.org/W1511775544","https://openalex.org/W1518705996","https://openalex.org/W1535839566","https://openalex.org/W1582243294","https://openalex.org/W1586677474","https://openalex.org/W1591802374","https://openalex.org/W1656268799","https://openalex.org/W1672891595","https://openalex.org/W1950282396","https://openalex.org/W2021196646","https://openalex.org/W2022846948","https://openalex.org/W2036265926","https://openalex.org/W2044560939","https://openalex.org/W2048051309","https://openalex.org/W2057361103","https://openalex.org/W2091138122","https://openalex.org/W2095709533","https://openalex.org/W2112709934","https://openalex.org/W2119634222","https://openalex.org/W2142785340","https://openalex.org/W2148962278","https://openalex.org/W2152069383","https://openalex.org/W2164754295","https://openalex.org/W2165874780","https://openalex.org/W2170253995","https://openalex.org/W2225800216","https://openalex.org/W2233408344","https://openalex.org/W2913257024","https://openalex.org/W4206807714","https://openalex.org/W4233090747","https://openalex.org/W4298335305","https://openalex.org/W6664827099","https://openalex.org/W6814292443"],"related_works":["https://openalex.org/W949976107","https://openalex.org/W1987118140","https://openalex.org/W2788816388","https://openalex.org/W2990043628","https://openalex.org/W2951901777","https://openalex.org/W4298267346","https://openalex.org/W3099382357","https://openalex.org/W3049436368","https://openalex.org/W2045432969","https://openalex.org/W80801749"],"abstract_inverted_index":{"Modern":[0],"propositional":[1],"satisfiability":[2],"(or":[3],"SAT)":[4],"solvers":[5,85,104],"are":[6,37,48,99],"very":[7],"powerful":[8],"due":[9],"to":[10,21,28,81,130],"recent":[11],"developments":[12],"on":[13],"the":[14,18,23,25,32,51,54,64,126],"underlying":[15],"data":[16],"structures,":[17],"used":[19,38,137],"heuristics":[20],"guide":[22],"search,":[24],"deduction":[26],"techniques":[27,35,47,97,139],"infer":[29],"knowledge,":[30],"and":[31,41,62,121,133],"formula":[33],"simplification":[34],"that":[36,79,112],"during":[39],"pre-":[40],"inprocessing.":[42],"However,":[43],"when":[44],"all":[45,96],"these":[46,94],"put":[49],"together,":[50],"soundness":[52],"of":[53,77,88,115],"combined":[55],"algorithm":[56],"is":[57,118],"not":[58],"guaranteed":[59],"any":[60],"more,":[61],"understanding":[63],"complex":[65],"dependencies":[66],"becomes":[67],"non-trivial.":[68],"In":[69],"this":[70,113],"paper":[71],"we":[72,110,124],"present":[73],"a":[74,89],"small":[75],"set":[76,114],"rules":[78,95,116],"allows":[80],"model":[82],"modern":[83,102],"SAT":[84,103],"in":[86,101],"terms":[87],"state":[90],"transition":[91,128],"system.":[92],"With":[93],"which":[98],"applied":[100],"can":[105,140],"be":[106,141],"modeled":[107],"adequately.":[108],"Furthermore,":[109],"show":[111,134],"results":[117],"sound,":[119],"complete":[120],"confluent.":[122],"Finnaly,":[123],"compare":[125],"proposed":[127],"system":[129],"related":[131],"systems,":[132],"how":[135],"widely":[136],"solving":[138],"modeled.":[142]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}