{"id":"https://openalex.org/W7134974695","doi":"https://doi.org/10.48550/arxiv.2603.09975","title":"d-DNNF Modulo Theories: A General Framework for Polytime SMT Queries","display_name":"d-DNNF Modulo Theories: A General Framework for Polytime SMT Queries","publication_year":2026,"publication_date":"2026-03-10","ids":{"openalex":"https://openalex.org/W7134974695","doi":"https://doi.org/10.48550/arxiv.2603.09975"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.09975","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.09975","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.09975","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068121034","display_name":"Gabriele Masina","orcid":"https://orcid.org/0000-0001-8842-4913"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Masina, Gabriele","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128794858","display_name":"Emanuale Civini","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Civini, Emanuele","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5095912703","display_name":"Massimo Michelutti","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michelutti, Massimo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046799062","display_name":"Giuseppe Spallitta","orcid":"https://orcid.org/0000-0002-4321-4995"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Spallitta, Giuseppe","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5128771591","display_name":"Roberto Sebastiani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sebastiani, Roberto","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":[],"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.32089999318122864,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.32089999318122864,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.259799987077713,"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.2053000032901764,"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/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5361999869346619},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.49540001153945923},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.474700003862381},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.4661000072956085},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.4359999895095825},{"id":"https://openalex.org/keywords/knowledge-base","display_name":"Knowledge base","score":0.4120999872684479},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.4074999988079071},{"id":"https://openalex.org/keywords/propositional-formula","display_name":"Propositional formula","score":0.36230000853538513}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8008000254631042},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6478999853134155},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5361999869346619},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.49540001153945923},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.474700003862381},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.4661000072956085},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44699999690055847},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.4359999895095825},{"id":"https://openalex.org/C4554734","wikidata":"https://www.wikidata.org/wiki/Q593744","display_name":"Knowledge base","level":2,"score":0.4120999872684479},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.4074999988079071},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.36230000853538513},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.34630000591278076},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.32989999651908875},{"id":"https://openalex.org/C59656382","wikidata":"https://www.wikidata.org/wiki/Q191536","display_name":"Conjunction (astronomy)","level":2,"score":0.2865000069141388},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.28600001335144043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27559998631477356},{"id":"https://openalex.org/C174348530","wikidata":"https://www.wikidata.org/wiki/Q188635","display_name":"Bridging (networking)","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.26339998841285706},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C2777152325","wikidata":"https://www.wikidata.org/wiki/Q108163","display_name":"Proposition","level":2,"score":0.2590999901294708},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.2531999945640564},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.09975","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.09975","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.09975","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.09975","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,75],"Knowledge":[1],"Compilation":[2],"(KC)":[3],"a":[4,35,84,109,189,201],"propositional":[5,127,191],"knowledge":[6],"base":[7],"is":[8,29,53,68,106,154],"compiled":[9,178],"off-line":[10,64],"into":[11,16,62],"some":[12],"target":[13],"form,":[14],"typically":[15],"deterministic":[17],"decomposable":[18],"negation":[19],"normal":[20],"form":[21],"(d-DNNF)":[22],"or":[23,140],"one":[24],"of":[25,38,58,111,150,160,188,196,205,210,222],"its":[26],"subcases,":[27],"which":[28,67,168],"then":[30],"used":[31,170],"on-line":[32,72],"to":[33,54,89,95,124,156],"answer":[34],"large":[36],"number":[37],"queries":[39,119],"in":[40,184],"polytime,":[41],"such":[42],"as":[43,56,171],"clausal":[44],"entailment,":[45],"model":[46],"counting,":[47],"and":[48,86,93,164,209],"others.":[49],"The":[50],"general":[51,87],"idea":[52],"push":[55],"much":[57],"the":[59,63,81,102,118,211,220,223],"computational":[60],"effort":[61],"compilation":[65,92],"phase,":[66],"amortized":[69],"over":[70],"all":[71,148],"polytime":[73,185],"queries.":[74],"this":[76],"paper,":[77],"we":[78,198],"present":[79],"for":[80,137,147],"first":[82],"time":[83],"novel":[85],"technique":[88],"leverage":[90],"d-DNNF":[91,100,162,192,207],"querying":[94],"SMT":[96,104,121,179,213],"level.":[97,128],"Intuitively,":[98],"before":[99],"compilation,":[101],"input":[103],"formula":[105],"combined":[107],"with":[108],"list":[110],"pre-computed":[112],"ad-hoc":[113],"theory":[114,141],"lemmas,":[115],"so":[116],"that":[117],"at":[120,126],"level":[122],"reduce":[123],"those":[125],"This":[129],"approach":[130],"has":[131],"several":[132],"features:":[133],"(i)":[134],"it":[135,145,153],"works":[136,146],"every":[138],"theory,":[139],"combination":[142],"thereof;":[143],"(ii)":[144],"forms":[149],"d-DNNF;":[151],"(iii)":[152],"easy":[155],"implement":[157],"on":[158,203],"top":[159,204],"any":[161,165],"compiler":[163],"theory-lemma":[166],"enumerator,":[167],"are":[169],"black":[172],"boxes;":[173],"(iv)":[174],"most":[175],"importantly,":[176],"these":[177],"d-DNNFs":[180],"can":[181],"be":[182],"queried":[183],"by":[186],"means":[187],"standard":[190],"reasoner.":[193],"As":[194],"proof":[195],"concept,":[197],"have":[199],"implemented":[200],"tool":[202],"state-of-the-art":[206],"packages":[208],"MathSAT":[212],"solver.":[214],"Some":[215],"preliminary":[216],"empirical":[217],"evaluation":[218],"supports":[219],"effectiveness":[221],"approach.":[224]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-12T00:00:00"}