Cover Image

Solving Satisfiability Modulo Counting Exactly with Probabilistic Circuits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Jinzhao, Jiang, Nan, Xue, Yexiang
Format:	Preprint
Published:	2025
Subjects:	Artificial Intelligence Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Solving Satisfiability Modulo Counting for Symbolic and Statistical AI Integration With Provable Guarantees
by: Li, Jinzhao, et al.
Published: (2023)

Approximating Pareto Frontiers in Stochastic Multi-Objective Optimization via Hashing and Randomization
by: Li, Jinzhao, et al.
Published: (2026)

Constrained and Robust Policy Synthesis with Satisfiability-Modulo-Probabilistic-Model-Checking
by: Heck, Linus, et al.
Published: (2025)

Probabilistic and Causal Satisfiability: Constraining the Model
by: Bläser, Markus, et al.
Published: (2025)

GaloisSAT: Differentiable Boolean Satisfiability Solving via Finite Field Algebra
by: Kim, Curie, et al.
Published: (2026)

Satisfiability Solving with LLMs: A Matched-Pair Evaluation of Reasoning Capability
by: Zhang, Leizhen, et al.
Published: (2026)

Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets
by: Patil, Jaikrishna Manojkumar, et al.
Published: (2025)

Solving Decision Theory Problems with Probabilistic Answer Set Programming
by: Azzolini, Damiano, et al.
Published: (2024)

Entailment vs. Verification for Partial-assignment Satisfiability and Enumeration
by: Sebastiani, Roberto
Published: (2025)

Canonical Decision Diagrams Modulo Theories
by: Michelutti, Massimo, et al.
Published: (2024)

Satisfiability Modulo Exponential Integer Arithmetic
by: Frohn, Florian, et al.
Published: (2024)

Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization
by: Chatterjee, Krishnendu, et al.
Published: (2024)

Satisfying Rationality Postulates of Structured Argumentation Through Deductive Support -- Technical Report
by: Cramer, Marcos, et al.
Published: (2026)

Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability
by: Orvalho, Pedro, et al.
Published: (2026)

Satisfiability Modulo Theories for Verifying MILP Certificates
by: Wood, Kenan, et al.
Published: (2023)

Satisfiability Modulo Extensional Constant Arrays (Extended Version)
by: Preiner, Mathias, et al.
Published: (2026)

An Effective Orchestral Approach to Satisfiability Modulo Prime Fields
by: Isabel, Miguel, et al.
Published: (2026)

On Probabilistic and Causal Reasoning with Summation Operators
by: Ibeling, Duligur, et al.
Published: (2024)

Queries With Exact Truth Values in Paraconsistent Description Logics
by: Bienvenu, Meghyn, et al.
Published: (2024)

Model Counting in the Wild
by: Shaw, Arijit, et al.
Published: (2024)

Temporal Planning via Interval Logic Satisfiability for Autonomous Systems
by: Ramirez, Miquel, et al.
Published: (2024)

On-the-fly Synthesis for LTL over Finite Traces: An Efficient Approach that Counts
by: Xiao, Shengping, et al.
Published: (2024)

Orthologic for SAT Solving
by: de Haldat, Vladislas, et al.
Published: (2026)

Satisfiability.jl: Satisfiability Modulo Theories in Julia
by: Soroka, Emiko, et al.
Published: (2023)

Deductive Systems for Logic Programs with Counting
by: Fandinno, Jorge, et al.
Published: (2025)

Formally Certified Approximate Model Counting
by: Tan, Yong Kiam, et al.
Published: (2024)

The Computational Complexity of Satisfiability in State Space Models
by: Alsmann, Eric, et al.
Published: (2025)

Towards Practical First-Order Model Counting
by: Kidambi, Ananth K., et al.
Published: (2025)

Approximate SMT Counting Beyond Discrete Domains
by: Shaw, Arijit, et al.
Published: (2025)

Decentralized Planning Using Probabilistic Hyperproperties
by: Pontiggia, Francesco, et al.
Published: (2025)

Probabilistic Strategy Logic with Degrees of Observability
by: Mu, Chunyan, et al.
Published: (2024)

Shields to Guarantee Probabilistic Safety in MDPs
by: Heck, Linus, et al.
Published: (2026)

Counting Answer Sets of Disjunctive Answer Set Programs
by: Kabir, Mohimenul, et al.
Published: (2025)

Towards Projected and Incremental Pseudo-Boolean Model Counting
by: Yang, Suwei, et al.
Published: (2024)

Integrating Belief Domains into Probabilistic Logic Programs
by: Azzolini, Damiano, et al.
Published: (2025)

Transformer Encoder Satisfiability: Complexity and Impact on Formal Reasoning
by: Sälzer, Marco, et al.
Published: (2024)

Shield Synthesis for LTL Modulo Theories
by: Rodriguez, Andoni, et al.
Published: (2024)

Finding Connections via Satisfiability Solving
by: Eisenhofer, Clemens, et al.
Published: (2026)

Spanning Matrices via Satisfiability Solving
by: Eisenhofer, Clemens, et al.
Published: (2024)

Solving reachability problems on data-aware workflows
by: De Masellis, Riccardo, et al.
Published: (2019)