arrow
Return

A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers

delete2026-09-24
delete0
PRE
AI
S
Shixin Sun
A
Astrid Klipfel
O
Ondřej Kuželka
Y
Yuanhong Wang *
Y
Yi Chang
DOI:10.1016/j.ijar.2026.109832delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• A novel WFOMC algorithm for C2 and its modulo-counting extension. • Tighter data complexity for WFOMC in two-variable logic with counting quantifiers. • Domain-liftability of the modulo-counting extension of C2.
Keywords:
Lifted probabilistic inference
Model counting
Two-variable logic
Counting quantifiers
Modulo counting quantifiers

Journal

International Journal of Approximate Reasoning cover
International Journal of Approximate Reasoning
IF:
3
Papers:
3.0K
Citations:
5.1K

Organization

C
Czech Technical University
Scholars:
5
Papers: 3
Citations: 0
U
Université d'Artois
Scholars:
21
Papers: 13
Citations: 0
J
Jilin University
Scholars:
2.7K
Papers: 633
Citations: 0
researcher View more organizations
Cited Papers

Cited Papers

No cited papers available