Showing cs.AIShow all
2 papers · 1 filter
cs.AI2025
Solving Satisfiability Modulo Counting Exactly with Probabilistic Circuits
Jinzhao Li, Nan Jiang, Yexiang Xue
Satisfiability Modulo Counting (SMC) is a recently proposed general language to reason about problems integrating statistical and symbolic Artificial Intelligence. An SMC problem i…
cs.AI2023
Solving Satisfiability Modulo Counting for Symbolic and Statistical AI Integration With Provable Guarantees
Jinzhao Li, Nan Jiang, Yexiang Xue
Satisfiability Modulo Counting (SMC) encompasses problems that require both symbolic decision-making and statistical reasoning. Its general formulation captures many real-world pro…