{"id":"https://openalex.org/W3126185111","doi":"https://doi.org/10.3233/faia200987","title":"Chapter 4. Conflict-Driven Clause Learning SAT Solvers","display_name":"Chapter 4. Conflict-Driven Clause Learning SAT Solvers","publication_year":2021,"publication_date":"2021-02-02","ids":{"openalex":"https://openalex.org/W3126185111","doi":"https://doi.org/10.3233/faia200987","mag":"3126185111"},"language":"en","primary_location":{"id":"doi:10.3233/faia200987","is_oa":false,"landing_page_url":"https://doi.org/10.3233/faia200987","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"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":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","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/A5002246957","display_name":"Jo\u00e3o Marques\u2010Silva","orcid":"https://orcid.org/0000-0002-6632-3086"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Joao Marques-Silva","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058622165","display_name":"In\u00eas Lynce","orcid":"https://orcid.org/0000-0003-4868-415X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ines Lynce","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5085975362","display_name":"Sharad Malik","orcid":"https://orcid.org/0000-0002-0837-5443"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sharad Malik","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002246957"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":22.6022,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.99812559,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9031999707221985,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9031999707221985,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8298184871673584},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7623318433761597},{"id":"https://openalex.org/keywords/dependent-clause","display_name":"Dependent clause","score":0.5541877150535583},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4579128623008728},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33197999000549316}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8298184871673584},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7623318433761597},{"id":"https://openalex.org/C134510687","wikidata":"https://www.wikidata.org/wiki/Q1122094","display_name":"Dependent clause","level":3,"score":0.5541877150535583},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4579128623008728},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33197999000549316},{"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/C2777530160","wikidata":"https://www.wikidata.org/wiki/Q41796","display_name":"Sentence","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/faia200987","is_oa":false,"landing_page_url":"https://doi.org/10.3233/faia200987","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"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":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2884576438","https://openalex.org/W1756885467","https://openalex.org/W2905364337","https://openalex.org/W1522517976","https://openalex.org/W2034983601","https://openalex.org/W3042941765","https://openalex.org/W2560284304","https://openalex.org/W2169928498","https://openalex.org/W31576638","https://openalex.org/W3101233600"],"abstract_inverted_index":{"One":[0],"of":[1,10,21,58,65,86,98,131,139,146,157,164],"the":[2,8,19,41,48,56,74,96,128,137,144,154,162],"most":[3],"important":[4],"paradigm":[5,92],"shifts":[6],"in":[7,62,123],"use":[9,138],"SAT":[11,168],"solvers":[12],"for":[13,31,77],"solving":[14],"industrial":[15],"problems":[16],"has":[17,94],"been":[18,95],"introduction":[20,145],"clause":[22,30,39,166,181],"learning.":[23],"Clause":[24],"learning":[25,167],"entails":[26],"adding":[27],"a":[28,63,83,89,132],"new":[29,38,99],"each":[32],"conflict":[33,43,171],"during":[34,47],"backtrack":[35],"search.":[36],"This":[37,159],"prevents":[40],"same":[42],"from":[44],"occurring":[45],"again":[46],"search":[49,176],"process.":[50],"Moreover,":[51],"sophisticated":[52],"techniques":[53],"such":[54],"as":[55],"identification":[57],"unique":[59],"implication":[60],"points":[61],"graph":[64],"implications,":[66],"allow":[67],"creating":[68],"clauses":[69,80],"that":[70,149],"more":[71],"precisely":[72],"identify":[73],"assignments":[75],"responsible":[76],"conflicts.":[78],"Learned":[79],"often":[81],"have":[82],"large":[84,112],"number":[85],"literals.":[87],"As":[88],"result,":[90],"another":[91],"shift":[93],"development":[97],"data":[100,104,115,141,174],"structures,":[101,105,175],"namely":[102,170],"lazy":[103,119,140,173],"which":[106],"are":[107,117],"particularly":[108],"effective":[109],"at":[110],"handling":[111],"clauses.":[113,158],"These":[114],"structures":[116,142],"called":[118],"due":[120],"to":[121,126],"being":[122],"general":[124],"unable":[125],"provide":[127],"actual":[129],"status":[130,156],"clause.":[133],"Efficiency":[134],"concerns":[135],"and":[136,180],"motivated":[143],"dynamic":[147],"heuristics":[148,179],"do":[150],"not":[151],"require":[152],"knowing":[153],"precise":[155],"chapter":[160],"describes":[161],"ingredients":[163],"conflict-driven":[165,178],"solvers,":[169],"analysis,":[172],"restarts,":[177],"deletion":[182],"strategies.":[183]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":21},{"year":2024,"cited_by_count":17},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}