{"id":"https://openalex.org/W6989297785","doi":null,"title":"Applications of SAT solving","display_name":"Applications of SAT solving","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W6989297785"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.137.3717","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.3717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.chalmers.se/~nik/lic.ps.gz","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5053866278","display_name":"Niklas S\u00f6rensson","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Niklas S\u00f6rensson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5053866278"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.98580002784729,"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.98580002784729,"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.00430000014603138,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.00419999985024333,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/sat-solving","display_name":"SAT solving","score":0.9879999756813049},{"id":"https://openalex.org/keywords/incremental-sat-solving","display_name":"incremental SAT solving","score":0.8939999938011169},{"id":"https://openalex.org/keywords/first-order-theorem-proving","display_name":"first-order theorem proving","score":0.8690000176429749},{"id":"https://openalex.org/keywords/model-finding","display_name":"model finding","score":0.8790000081062317},{"id":"https://openalex.org/keywords/symbolic-model-checking","display_name":"symbolic model checking","score":0.8709999918937683},{"id":"https://openalex.org/keywords/k-induction","display_name":"k-induction","score":0.9879999756813049},{"id":"https://openalex.org/keywords/safety-verification","display_name":"safety verification","score":0.9229999780654907},{"id":"https://openalex.org/keywords/paradox","display_name":"paradox","score":0.7110000252723694},{"id":"https://openalex.org/keywords/clause-reduction","display_name":"clause reduction","score":0.5299999713897705}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6888999938964844},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6176999807357788},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6085000038146973},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.579200029373169},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.569599986076355},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.5009999871253967},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4927999973297119},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48539999127388},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.46070000529289246},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.42899999022483826},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4250999987125397},{"id":"https://openalex.org/C60798267","wikidata":"https://www.wikidata.org/wiki/Q1226939","display_name":"Division (mathematics)","level":2,"score":0.4223000109195709},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.3955000042915344},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.36550000309944153},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.35530000925064087},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.3375000059604645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.320499986410141},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3172000050544739},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.3151000142097473},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.3140000104904175},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3109000027179718},{"id":"https://openalex.org/C47884741","wikidata":"https://www.wikidata.org/wiki/Q1166618","display_name":"Mathematical logic","level":2,"score":0.2996000051498413},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.2935999929904938},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.2921000123023987},{"id":"https://openalex.org/C3019612716","wikidata":"https://www.wikidata.org/wiki/Q730920","display_name":"Problem solver","level":2,"score":0.29120001196861267},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C13766981","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Automated proof checking","level":3,"score":0.28200000524520874},{"id":"https://openalex.org/C2776542497","wikidata":"https://www.wikidata.org/wiki/Q5266672","display_name":"Development (topology)","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C206743973","wikidata":"https://www.wikidata.org/wiki/Q178377","display_name":"Mathematical induction","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.25690001249313354},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C94633896","wikidata":"https://www.wikidata.org/wiki/Q7140378","display_name":"Partial order reduction","level":3,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.137.3717","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.3717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.chalmers.se/~nik/lic.ps.gz","raw_type":"text"},{"id":"pmh:oai:publications.lib.chalmers.se:41401","doi":null,"is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/41401-applications-of-sat-solving","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Thesis.Licentiate"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1537963748","https://openalex.org/W2001859357","https://openalex.org/W2400262552","https://openalex.org/W2046239089","https://openalex.org/W4399036844","https://openalex.org/W2401940852","https://openalex.org/W4245099715","https://openalex.org/W7099132316","https://openalex.org/W2794709452","https://openalex.org/W1499997324"],"abstract_inverted_index":{"In":[0],"the":[1,24,60,126,139,155,171,174,185,189,283],"area":[2],"of":[3,26,49,63,74,111,173,188,223,236,253,257],"formal":[4],"verification":[5,203],"it":[6,29],"is":[7,130,135,212,266,304],"well":[8,183],"known":[9],"that":[10,17,80,129,145,153,165,204],"there":[11,193],"can":[12,146,238],"be":[13,147,229,239],"no":[14],"single":[15],"logic":[16],"suits":[18],"all":[19,254,258],"needs.":[20],"This":[21,269],"insight":[22],"motivates":[23],"diversity":[25],"this":[27,234],"dissertation:":[28],"contains":[30],"contributions":[31],"to":[32,107,157,168,228,261],"SAT":[33,57,67,76,98,113,118,133,158,175,186,208,245],"solving,":[34,134],"First":[35],"Order":[36],"theorem":[37],"proving":[38],"and":[39,42,65,90,294,306],"Model":[40,44],"Finding,":[41],"Symbolic":[43],"Checking.":[45],"\\n\\nA":[46],"growing":[47],"number":[48],"problem":[50],"domains":[51],"are":[52,166,205],"successfully":[53],"being":[54],"tackled":[55],"by":[56,142],"solvers.":[58],"Following":[59],"current":[61],"trend":[62],"extending":[64],"adapting":[66],"solvers":[68],"we":[69,104,295],"present":[70],"a":[71,75,86,94,109,221,251,262,297],"detailed":[72],"description":[73,84],"solver":[77],"designed":[78,167],"for":[79,200],"particular":[81],"purpose.":[82],"The":[83,177,218,299],"bridges":[85],"gap":[87],"between":[88],"theory":[89],"practice,":[91],"serving":[92],"as":[93,150,272],"tutorial":[95],"on":[96,132,207],"modern":[97],"solving":[99],"algorithms.":[100],"Among":[101],"other":[102],"things":[103],"describe":[105],"how":[106,233],"solve":[108],"series":[110],"related":[112],"problems":[114],"efficiently,":[115],"called":[116,180,216],"incremental":[117,244],"solving.":[119,209,246],"\\n\\nFor":[120],"finding":[121],"finite":[122],"first":[123,276],"order":[124,277],"models,":[125],"MACE-style":[127],"method":[128,141,219],"based":[131,206],"well-known.":[136],"We":[137,281],"improve":[138],"basic":[140],"several":[143],"techniques,":[144],"loosely":[148],"classified":[149],"either":[151],"transformations":[152],"make":[154],"reduction":[156],"result":[159],"in":[160,184,198,274,302],"fewer":[161],"clauses,":[162],"or":[163],"techniques":[164],"speed":[169],"up":[170,260],"search":[172],"solver.":[176],"resulting":[178,300],"tool,":[179],"Paradox,":[181],"performed":[182],"division":[187],"CASC-19":[190],"competition.":[191],"Recently,":[192],"has":[194],"been":[195,292],"large":[196],"interest":[197],"methods":[199],"safety":[201],"property":[202],"One":[210],"example":[211],"temporal":[213],"induction,":[214],"also":[215],"k-induction.":[217],"requires":[220],"sequence":[222,235],"increasingly":[224],"stronger":[225],"induction":[226],"proofs":[227,237],"performed.":[230],"\\n\\nWe":[231],"show":[232],"solved":[240],"more":[241],"efficiently":[242],"using":[243],"Constraint":[247],"merging":[248],"tableaux":[249],"maintain":[250],"system":[252],"closing":[255],"substitutions":[256],"subtableau":[259],"certain":[263],"depth,":[264],"which":[265],"incrementally":[267],"increased.":[268],"avoids":[270],"backtracking":[271],"necessary":[273],"destructive":[275],"free":[278],"variable":[279],"tableaux.":[280],"analyse":[282],"reasons":[284],"why":[285],"lazy":[286],"functional":[287],"implementations":[288],"so":[289],"far":[290],"have":[291],"problematic,":[293],"give":[296],"solution.":[298],"implementation":[301],"Haskell":[303],"compact":[305],"modular.\\n\\n":[307]},"counts_by_year":[],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2025-10-10T00:00:00"}