Models and Counter-Models of Quantified Boolean Formulas (abstract)

The strength of the dominance rule (abstract)

Small unsatisfiable k-CNFs with bounded literal occurrence (abstract)

On Limits of Symbolic Approach to SAT Solving (abstract)

satsuma: Structure-based Symmetry Breaking in SAT (abstract)

Clausal Congruence Closure (abstract)

Lazy Reimplication in Chronological Backtracking (abstract)

eSLIM: Circuit Minimization with SAT Based Local Improvement (abstract)

Entailing Generalization Boosts Enumeration (abstract)

Logical Algorithmics: From Relational Queries to Boolean Reasoning (abstract)

Scalable Trusted SAT Solving with on-the-fly LRAT Checking (abstract)

Speeding-up Pseudo-Boolean Propagation (abstract)

Anytime Approximate Formal Feature Attribution (abstract)

Hierarchical Stochastic SAT and Quality Assessment of Logic Locking (abstract)

Strategy Extraction by Interpolation (abstract)

Dynamic Blocked Clause Elimination for Projected Model Counting (abstract)

Antichain with SAT and Tries (abstract)

Cooking String-Integer Conversions with Noodles (abstract)

SAT Encoding of Partial Ordering Models for Graph Coloring Problems (abstract)

Scalable Proof Production and Checking in SMT (abstract)

New lower bounds for Polynomial Calculus over non-Boolean bases (abstract)

On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNF (abstract)

The Relative Strength of #SAT Proof Systems (abstract)

Towards Universally Accessible SAT Technology (abstract)

Revisiting SATZilla Features in 2024 (abstract)

Global Benchmark Database (abstract)

Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving (abstract)

Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits (abstract)

MaxSAT Resolution with Inclusion Redundancy (abstract)

Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme (abstract)

Parallel Clause Sharing Strategy based on Graph Structure of SAT Problem (abstract)