{"id":"https://openalex.org/W2094368841","doi":"https://doi.org/10.1145/1822327.1822333","title":"Scalable formula decomposition for propositional satisfiability","display_name":"Scalable formula decomposition for propositional satisfiability","publication_year":2010,"publication_date":"2010-05-19","ids":{"openalex":"https://openalex.org/W2094368841","doi":"https://doi.org/10.1145/1822327.1822333","mag":"2094368841"},"language":"en","primary_location":{"id":"doi:10.1145/1822327.1822333","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1822327.1822333","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Third C* Conference on Computer Science and Software Engineering","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, Montr\u00e9al, Canada"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al, Montr\u00e9al, 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":["Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al, Montr\u00e9al, Canada"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al, Montr\u00e9al, Canada","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.6691,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71773632,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"43","last_page":"52"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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/T10126","display_name":"Logic, programming, and type systems","score":0.998199999332428,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dpll-algorithm","display_name":"DPLL algorithm","score":0.9467897415161133},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.8219444751739502},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6882026791572571},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6217990517616272},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5752037763595581},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.556330144405365},{"id":"https://openalex.org/keywords/propositional-formula","display_name":"Propositional formula","score":0.49190211296081543},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4850558340549469},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.47479763627052307},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.4178675711154938},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3907037675380707},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.33594098687171936},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14472690224647522}],"concepts":[{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.9467897415161133},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.8219444751739502},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6882026791572571},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6217990517616272},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5752037763595581},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.556330144405365},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.49190211296081543},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4850558340549469},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.47479763627052307},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.4178675711154938},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3907037675380707},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.33594098687171936},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14472690224647522},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1822327.1822333","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1822327.1822333","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Third C* Conference on Computer Science and Software Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6800000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W91193428","https://openalex.org/W101497066","https://openalex.org/W1480459634","https://openalex.org/W1481397690","https://openalex.org/W1493429498","https://openalex.org/W1496518193","https://openalex.org/W1511963917","https://openalex.org/W1518705996","https://openalex.org/W1530052040","https://openalex.org/W1555272910","https://openalex.org/W1557975422","https://openalex.org/W1569872967","https://openalex.org/W1582996281","https://openalex.org/W1667362966","https://openalex.org/W1748533846","https://openalex.org/W1787074469","https://openalex.org/W1804601140","https://openalex.org/W1855805902","https://openalex.org/W1966350062","https://openalex.org/W1975615576","https://openalex.org/W1981932823","https://openalex.org/W1991755800","https://openalex.org/W1999038767","https://openalex.org/W2010880586","https://openalex.org/W2029448190","https://openalex.org/W2034674470","https://openalex.org/W2036265926","https://openalex.org/W2038264652","https://openalex.org/W2044560939","https://openalex.org/W2057361103","https://openalex.org/W2078174680","https://openalex.org/W2085550081","https://openalex.org/W2105210717","https://openalex.org/W2109710497","https://openalex.org/W2123120888","https://openalex.org/W2131719221","https://openalex.org/W2135613306","https://openalex.org/W2138319640","https://openalex.org/W2139171217","https://openalex.org/W2142785340","https://openalex.org/W2158027086","https://openalex.org/W2164754295","https://openalex.org/W2169084680","https://openalex.org/W2512056759","https://openalex.org/W2561675875","https://openalex.org/W2912526555","https://openalex.org/W6628836516","https://openalex.org/W6634303292","https://openalex.org/W6636950635","https://openalex.org/W6637848473","https://openalex.org/W6643876075"],"related_works":["https://openalex.org/W2022840750","https://openalex.org/W1492881020","https://openalex.org/W2504339508","https://openalex.org/W1859833606","https://openalex.org/W170245869","https://openalex.org/W1608279203","https://openalex.org/W3128448798","https://openalex.org/W2015099359","https://openalex.org/W2483481624","https://openalex.org/W1493084124"],"abstract_inverted_index":{"Propositional":[0],"satisfiability":[1],"solving,":[2],"or":[3,22],"SAT,":[4],"is":[5,30],"an":[6],"important":[7],"reasoning":[8],"task":[9],"arising":[10],"in":[11,31,60,63],"numerous":[12],"applications,":[13],"such":[14],"as":[15],"circuit":[16],"design,":[17],"formal":[18],"verification,":[19],"planning,":[20],"scheduling":[21],"probabilistic":[23],"reasoning.":[24],"The":[25],"depth-first":[26],"search":[27],"DPLL":[28],"procedure":[29],"practice":[32],"the":[33,44,55,65,122,131],"most":[34,90],"efficient":[35],"complete":[36],"algorithm":[37],"to":[38,53,88,110],"date.":[39],"Previous":[40],"studies":[41],"have":[42],"shown":[43],"theoretical":[45],"and":[46,78,107],"experimental":[47],"advantages":[48],"of":[49,57,67,76,96,115,124,133],"decomposing":[50],"propositional":[51],"formulas":[52],"guide":[54],"ordering":[56],"variable":[58],"instantiation":[59],"DPLL.":[61],"However,":[62],"practice,":[64],"computation":[66],"a":[68,73,104],"tree":[69,113],"decomposition":[70,84],"may":[71],"require":[72],"considerable":[74],"amount":[75],"time":[77],"space":[79],"on":[80,130],"large":[81,116],"formulas;":[82],"existing":[83],"tools":[85],"are":[86],"unable":[87],"handle":[89],"currently":[91],"challenging":[92,134],"SAT":[93,117],"instances":[94],"because":[95],"their":[97],"size.":[98],"In":[99],"this":[100],"paper,":[101],"we":[102],"introduce":[103],"simple,":[105],"fast":[106],"scalable":[108],"method":[109],"quickly":[111],"produce":[112],"decompositions":[114,129],"problems.":[118],"We":[119],"show":[120],"experimentally":[121],"efficiency":[123],"orderings":[125],"derived":[126],"from":[127],"these":[128],"solving":[132],"benchmarks.":[135]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"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"}
