{"id":"https://openalex.org/W2400302331","doi":"https://doi.org/10.3233/978-1-61499-385-8-223","title":"Boolean Satisfiability: Solvers and Extensions","display_name":"Boolean Satisfiability: Solvers and Extensions","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2400302331","doi":"https://doi.org/10.3233/978-1-61499-385-8-223","mag":"2400302331"},"language":"en","primary_location":{"id":"doi:10.3233/978-1-61499-385-8-223","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-61499-385-8-223","pdf_url":null,"source":{"id":"https://openalex.org/S4210202636","display_name":"NATO science for peace and security series. D, Information and communication security","issn_l":"1874-6268","issn":["1874-6268","1879-8292"],"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"NATO Science for Peace and Security Series - D: Information and Communication Security","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/A5017958562","display_name":"Georg Wei\u00dfenbacher","orcid":"https://orcid.org/0000-0002-0143-632X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Weissenbacher Georg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5116320000","display_name":"Subramanyan Pramod","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Subramanyan Pramod","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Malik Sharad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Malik Sharad","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.20230525,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"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/T10142","display_name":"Formal Methods in Verification","score":0.6647999882698059,"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.6647999882698059,"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/satisfiability","display_name":"Satisfiability","score":0.7119627594947815},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6000826358795166},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.525642991065979},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37990957498550415},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3726244866847992}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7119627594947815},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6000826358795166},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.525642991065979},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37990957498550415},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3726244866847992}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/978-1-61499-385-8-223","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-61499-385-8-223","pdf_url":null,"source":{"id":"https://openalex.org/S4210202636","display_name":"NATO science for peace and security series. D, Information and communication security","issn_l":"1874-6268","issn":["1874-6268","1879-8292"],"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"NATO Science for Peace and Security Series - D: Information and Communication Security","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287","https://openalex.org/W2014111643","https://openalex.org/W2963044240","https://openalex.org/W2076399409","https://openalex.org/W2102364390"],"abstract_inverted_index":{"Contemporary":[0],"satisfiability":[1],"solvers":[2,110,129],"are":[3],"the":[4,63,79,84,93,120],"corner-stone":[5],"of":[6,22,43,76,78,86,96,125,127],"many":[7],"successful":[8],"applications":[9,126],"in":[10,133],"domains":[11],"such":[12,82],"as":[13,50,83],"automated":[14,134],"verification":[15],"and":[16,29,91,130],"artificial":[17],"intelligence.":[18],"The":[19],"impressive":[20],"advances":[21],"SAT":[23,80,109,128],"solvers,":[24],"achieved":[25],"by":[26,102],"clever":[27],"engineering":[28],"sophisticated":[30],"algorithms,":[31,61],"enable":[32],"us":[33],"to":[34,58,114],"tackle":[35],"Boolean":[36],"Satisfiability":[37],"(SAT)":[38],"problem":[39],"instances":[40],"with":[41,122],"millions":[42],"variables":[44],"–":[45],"which":[46],"was":[47],"previously":[48],"conceived":[49],"a":[51,74],"hopeless":[52],"problem.":[53],"We":[54,106,118],"provide":[55],"an":[56,103,123],"introduction":[57],"contemporary":[59],"SAT-solving":[60],"covering":[62],"fundamental":[64],"techniques":[65],"that":[66,98],"made":[67],"this":[68],"revolution":[69],"possible.":[70],"Further,":[71],"we":[72],"present":[73],"number":[75,95],"extensions":[77,132],"problem,":[81],"enumeration":[85],"all":[87],"satisfying":[88],"assignments":[89],"(ALL-SAT)":[90],"determining":[92],"maximum":[94],"clauses":[97],"can":[99,111],"be":[100,112],"satisfied":[101],"assignment":[104],"(MAX-SAT).":[105],"demonstrate":[107],"how":[108],"leveraged":[113],"solve":[115],"these":[116],"problems.":[117],"conclude":[119],"chapter":[121],"overview":[124],"their":[131],"verification.":[135]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}