# diff-SAT -- A Software for Sampling and Probabilistic Reasoning for SAT and Answer Set Programming

arXiv: https://arxiv.org/abs/2101.00589 · HTML: https://mlsanity.com/paper/2101.00589/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 13 references that are in the map.
- First posted on arXiv 3 Jan 2021.

## Builds on (most cited first, 1 of 1)

- [Distribution-Aware Sampling and Weighted Model Counting for SAT](https://mlsanity.com/paper/1404.2984/) (2014)

## Abstract (arXiv)

This paper describes diff-SAT, an Answer Set and SAT solver which combines regular solving with the capability to use probabilistic clauses, facts and rules, and to sample an optimal world-view (multiset of satisfying Boolean variable assignments or answer sets) subject to user-provided probabilistic constraints. The sampling process minimizes a user-defined differentiable objective function using a gradient descent based optimization method called Differentiable Satisfiability Solving (partialSAT) respectively Differentiable Answer Set Programming (partialASP). Use cases are i.a. probabilistic logic programming (in form of Probabilistic Answer Set Programming), Probabilistic Boolean Satisfiability solving (PSAT), and distribution-aware sampling of model multisets (answer sets or Boolean interpretations).