model counting

Model Counting for Dependency Quantified Boolean Formulas AAAI 2026 Proof Systems for Tensor-based Model Counting AAAI 2026 Proof Systems That Tightly Characterise Model Counting Algorithms AAAI 2026 New Compilation Languages Based on Restricted Weak Decomposability AAAI 2025 Towards Projected and Incremental Pseudo-Boolean Model Counting AAAI 2025 Towards Real-Time Approximate Counting AAAI 2025 An Approximate Skolem Function Counter AAAI 2024 A Top-Down Tree Model Counter for Quantified Boolean Formulas IJCAI 2024 Auditable Algorithms for Approximate Model Counting AAAI 2024 Compilation and Fast Model Counting beyond CNF IJCAI 2024 Encoding Constraints as Binary Constraint Networks Satisfying BTP AAAI 2024 Engineering an Exact Pseudo-Boolean Model Counter AAAI 2024 Exact ASP Counting with Compact Encodings AAAI 2024 Knowledge Compilation for Incremental and Checkable Stochastic Boolean Satisfiability IJCAI 2024 Model Counting and Sampling via Semiring Extensions AAAI 2024 What Are the Rules? Discovering Constraints from Data AAAI 2024 Engineering an Efficient Approximate DNF-Counter IJCAI 2023 Fast Converging Anytime Model Counting AAAI 2023 On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results JMLR 2023 ApproxASP – a Scalable Approximate Answer Set Counter AAAI 2022 Domain-Lifted Sampling for Universal Two-Variable Logic and Extensions AAAI 2022 DPSampler: Exact Weighted Sampling Using Dynamic Programming IJCAI 2022 Knowledge Compilation Meets Logical Separability AAAI 2022 NSNet: A General Neural Probabilistic Framework for Satisfiability Problems NeurIPS 2022 A Sharp Leap from Quantified Boolean Formula to Stochastic Boolean Satisfiability Solving AAAI 2021