MC — PROGRAM
Days: Saturday, 25 July 2026
Saturday, 25 July 2026
09:00-10:15
Opening and Proof Complexity
MC
Session Chair:
Location:
C6.02
| 09:00-09:15 |
Opening (abstract) 15 min
1 Linköping University
2 CRIL (CNRS UMR 8188)
3 Georgia Tech
|
| 09:15-09:45 |
Tutorial: Proof Complexity and Model Counting (abstract) 30 min
1 University of Jena
|
| 09:45-10:15 |
Proof Systems That Tightly Characterise Model Counting Algorithms (abstract) 30 min
1 University of Jena
|
10:15-11:00
Coffee Break
MC
Location:
C6.02
11:00-12:30
Proof Logging and Knowledge Compilation
MC
Location:
C6.02
| 11:00-11:30 |
Proof Logging for Projected Enumeration (and Counting?) Problems in VeriPB (abstract) 30 min
1 NTU Singapore
2 University of Glasgow
3 Lund University and Copenhagen University
|
| 11:30-12:00 |
From Tensor Networks to Tractable Circuits, and back (abstract) 30 min
1 Leiden University
|
| 12:00-12:30 |
Knowledge Compilation for Boolean and Presburger Functional Synthesis (abstract) 30 min
1 IIT Bombay
|
12:30-14:00
Lunch
MC
Location:
C6.02
14:00-15:30
Complexity and Explanations
MC
Location:
C6.02
| 14:00-14:30 |
A Novel Reduction from #SAT to #2SAT Based on Symmetry: Simply Drop the Large Clauses (abstract) 30 min
1 University of Potsdam, Germany & CNRS, University of Artois, France
|
| 14:30-15:00 |
Counting Complexity of ASP (abstract) 30 min
1 European Space Agency
2 Linköping University
3 None
|
| 15:00-15:30 |
Counting for Explanations: Evaluating Domain Theories and Constraint Encodings in Probabilistic Abductive Reasoning (abstract) 30 min
1 CRIL (CNRS UMR 8188), Artois University
|
15:30-16:00
Coffee Break
MC
Location:
C6.02
16:00-18:00
Weighted Counting over Theories and First-Order Structures
MC
Location:
C6.02
| 16:00-16:30 |
What Should #SMT Count? (abstract) 30 min
1 Rice University
|
| 16:30-17:00 |
LP-Based Weighted Model Integration over Non-Linear Real Arithmetic (abstract) 30 min
1 IIT Bombay
2 HKUST
3 University of Oxford
4 TU Wien
5 Singapore Management University
|
| 17:00-17:30 |
Bridging Weighted First Order Model Counting and Graph Polynomials (abstract) 30 min
1 Czech Technical University in Prague
|
| 17:30-18:00 |
Quantifying Sensitivity for Tree Ensembles: A symbolic and compositional approach (abstract) 30 min
1 IIT Bombay
2 University of Toronto
|