{"id":"https://openalex.org/W7225465301","doi":"https://doi.org/10.5281/zenodo.24029012","title":"Formal Specification, Correctness Argument, and Complexity Analysis of Recursive SAT Decomposition","display_name":"Formal Specification, Correctness Argument, and Complexity Analysis of Recursive SAT Decomposition","publication_year":2026,"publication_date":"2026-11-07","ids":{"openalex":"https://openalex.org/W7225465301","doi":"https://doi.org/10.5281/zenodo.24029012"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.24029012","doi":"https://doi.org/10.5281/zenodo.24029012","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24029012","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.24029012","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5161173367","display_name":"Harshan Singh","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Singh, Harshan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5161173367"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.5356000065803528,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.5356000065803528,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.27219998836517334,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.13570000231266022,"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/boolean-satisfiability","display_name":"Boolean satisfiability","score":0.9959999918937683},{"id":"https://openalex.org/keywords/recursive-decomposition","display_name":"recursive decomposition","score":0.7620000243186951},{"id":"https://openalex.org/keywords/formal-specification","display_name":"formal specification","score":0.8169999718666077},{"id":"https://openalex.org/keywords/computational-complexity-analysis","display_name":"complexity analysis","score":0.875},{"id":"https://openalex.org/keywords/p-versus-np","display_name":"P versus NP","score":0.9179999828338623}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7627999782562256},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5856000185012817},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5813999772071838},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5001000165939331},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4643999934196472},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4374000132083893},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.42910000681877136},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.4162999987602234},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.38989999890327454},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.38600000739097595},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.3833000063896179},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.36959999799728394},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3675000071525574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36550000309944153},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.36550000309944153},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.36329999566078186},{"id":"https://openalex.org/C2778648169","wikidata":"https://www.wikidata.org/wiki/Q967768","display_name":"Compatibility (geochemistry)","level":2,"score":0.3425000011920929},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.31200000643730164},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.29100000858306885},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.2883000075817108},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C2776916960","wikidata":"https://www.wikidata.org/wiki/Q637156","display_name":"Warrant","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.25690001249313354}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5281/zenodo.24029012","doi":"https://doi.org/10.5281/zenodo.24029012","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24029012","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.5281/zenodo.24029013","doi":"https://doi.org/10.5281/zenodo.24029013","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24029013","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.5281/zenodo.24029012","doi":"https://doi.org/10.5281/zenodo.24029012","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24029012","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7154495207","https://openalex.org/W7213522047","https://openalex.org/W6911854453","https://openalex.org/W2094368841","https://openalex.org/W7142597208","https://openalex.org/W1531643609","https://openalex.org/W7135391406","https://openalex.org/W6893426024","https://openalex.org/W4294870871","https://openalex.org/W6949134564"],"abstract_inverted_index":{"This":[0,88],"manuscript":[1,52,117],"presents":[2],"a":[3,14,26,35,85,93],"proposed":[4,94],"recursive":[5],"decomposition":[6,70,103],"framework":[7,23],"for":[8,97],"Boolean":[9,27,45],"satisfiability":[10,28],"(SAT),":[11],"together":[12],"with":[13],"formal":[15],"specification,":[16],"correctness":[17],"argument,":[18],"and":[19,39,47,57,66,78,110],"complexity":[20],"analysis.":[21],"The":[22,51,116],"recursively":[24],"partitions":[25],"instance":[29],"into":[30],"smaller":[31],"child":[32,41],"instances,":[33],"uses":[34],"finite":[36],"base-case":[37],"library,":[38],"combines":[40],"information":[42],"through":[43],"parent-level":[44],"placeholders":[46],"shared-variable":[48],"compatibility":[49,68,108],"checks.":[50],"develops":[53],"the":[54,61,80,102,107,122],"intended":[55],"SAT-completeness":[56],"UNSAT-soundness":[58],"arguments,":[59],"including":[60],"preservation":[62],"of":[63,106],"variable":[64],"identity":[65],"joint":[67],"across":[69],"layers.":[71],"It":[72],"also":[73],"provides":[74],"an":[75],"operation-count":[76],"analysis":[77],"discusses":[79],"conditions":[81],"required":[82],"to":[83],"establish":[84],"polynomial-time":[86],"implementation.":[87],"work":[89],"is":[90],"submitted":[91],"as":[92,130],"mathematical":[95],"argument":[96],"independent":[98],"review.":[99],"In":[100],"particular,":[101],"equivalence,":[104],"completeness":[105],"procedure,":[109],"polynomial":[111],"bit-complexity":[112],"warrant":[113],"rigorous":[114],"examination.":[115],"does":[118],"not":[119],"claim":[120],"that":[121],"P":[123],"versus":[124],"NP":[125],"problem":[126],"has":[127],"been":[128],"accepted":[129],"solved.":[131]},"counts_by_year":[],"updated_date":"2026-11-09T13:22:03.289127","created_date":"2026-11-08T00:00:00"}