{"id":"https://openalex.org/W7160402373","doi":"https://doi.org/10.48550/arxiv.2605.03391","title":"A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers","display_name":"A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers","publication_year":2026,"publication_date":"2026-05-05","ids":{"openalex":"https://openalex.org/W7160402373","doi":"https://doi.org/10.48550/arxiv.2605.03391"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.03391","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03391","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":null,"license_id":null,"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.2605.03391","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135298199","display_name":"Shixin Sun","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sun, Shixin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038774856","display_name":"Astrid Klipfel","orcid":"https://orcid.org/0009-0004-8310-4573"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Klipfel, Astrid","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021262042","display_name":"Ond\u0159ej Ku\u017eelka","orcid":"https://orcid.org/0000-0002-6523-9114"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ku\u017eelka, Ond\u0159ej","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101852624","display_name":"Yuanhong Wang","orcid":"https://orcid.org/0000-0003-1801-9634"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Yuanhong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135447316","display_name":"Yi Chang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chang, Yi","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.972000002861023,"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.972000002861023,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.006500000134110451,"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/T10028","display_name":"Topic Modeling","score":0.0015999999595806003,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.6966999769210815},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.6395999789237976},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.534600019454956},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5123000144958496},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4884999990463257},{"id":"https://openalex.org/keywords/propositional-formula","display_name":"Propositional formula","score":0.45730000734329224},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4309999942779541},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.42570000886917114},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.423799991607666}],"concepts":[{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.6966999769210815},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6395999789237976},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5453000068664551},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.534600019454956},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5257999897003174},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5123000144958496},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4884999990463257},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48539999127388},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.45730000734329224},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4309999942779541},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.42570000886917114},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.423799991607666},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.42340001463890076},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4120999872684479},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.40700000524520874},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.4032999873161316},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3953000009059906},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.35920000076293945},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.35190001130104065},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.34869998693466187},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.32839998602867126},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3179999887943268},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.31610000133514404},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.3154999911785126},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.28529998660087585},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C2781104640","wikidata":"https://www.wikidata.org/wiki/Q11827313","display_name":"Counting process","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C2777530160","wikidata":"https://www.wikidata.org/wiki/Q41796","display_name":"Sentence","level":2,"score":0.273499995470047},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.25209999084472656}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.03391","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03391","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.03391","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03391","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Weighted":[0],"first-order":[1,24,40],"model":[2,217],"counting":[3,65,89,120,139,173,193],"(WFOMC)":[4],"is":[5,68,180],"a":[6,23,27,110,133,153,187],"central":[7],"task":[8],"in":[9,52,55,159,171],"lifted":[10,111],"probabilistic":[11],"inference:":[12],"It":[13],"asks":[14],"for":[15,46,79,113,157],"the":[16,56,61,71,100,162,165,172],"weighted":[17],"sum":[18],"of":[19,22,33,39,70,124,164],"all":[20],"models":[21],"sentence":[25],"over":[26],"finite":[28],"domain.":[29],"A":[30],"long":[31],"line":[32],"work":[34],"has":[35],"identified":[36],"domain-liftable":[37],"fragments":[38],"logic,":[41],"that":[42,87,137,178,200],"is,":[43],"syntactic":[44],"classes":[45],"which":[47,94],"WFOMC":[48,114,158,212],"can":[49],"be":[50],"solved":[51],"time":[53],"polynomial":[54,166],"domain":[57,101],"size.":[58],"Among":[59],"them,":[60],"two-variable":[62],"fragment":[63,189],"with":[64,190],"quantifiers,":[66],"$\\mathbf{C}^2$,":[67,80,160],"one":[69],"most":[72],"expressive":[73],"known":[74],"liftable":[75],"fragments.":[76],"Existing":[77],"algorithms":[78,213],"however,":[81],"establish":[82],"tractability":[83,183],"through":[84],"multi-stage":[85],"reductions":[86],"eliminate":[88],"quantifiers":[90,140],"via":[91],"cardinality":[92],"constraints,":[93],"introduces":[95],"substantial":[96],"practical":[97],"overhead":[98],"as":[99],"size":[102],"grows.":[103],"In":[104],"this":[105],"paper,":[106],"we":[107,151,176],"introduce":[108],"IncrementalWFOMC3,":[109],"algorithm":[112],"on":[115,126,132],"$\\mathbf{C}^2$":[116,185],"and":[117,206,214],"its":[118],"modulo":[119,192],"extension,":[121],"$\\mathbf{C}^2_{\\text{mod}}$.":[122],"Instead":[123],"relying":[125],"reduction":[127],"techniques,":[128],"IncrementalWFOMC3":[129,201],"operates":[130],"directly":[131],"Scott":[134],"normal":[135],"form":[136],"retains":[138],"throughout":[141],"inference.":[142],"This":[143],"direct":[144],"treatment":[145],"yields":[146],"two":[147],"main":[148],"results.":[149],"First,":[150],"derive":[152],"tighter":[154],"data-complexity":[155],"bound":[156],"reducing":[161],"degree":[163],"from":[167,184],"quadratic":[168],"to":[169,186],"linear":[170],"parameters.":[174],"Second,":[175],"prove":[177],"$\\mathbf{C}^2_{\\text{mod}}$":[179],"domain-liftable,":[181],"extending":[182],"richer":[188],"native":[191],"support.":[194],"Finally,":[195],"our":[196],"empirical":[197],"evaluation":[198],"shows":[199],"delivers":[202],"orders-of-magnitude":[203],"runtime":[204],"improvements":[205],"better":[207],"scalability":[208],"than":[209],"both":[210],"existing":[211],"state-of-the-art":[215],"propositional":[216],"counters.":[218]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-07T00:00:00"}