Cover Image

Efficient Incremental #SAT via Cross-Instance Knowledge Reuse

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bartal, Uriya, Fried, Dror, Lagniez, Jean-Marie
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Algorithmic Perspective on Toda's Theorem
by: Fried, Dror, et al.
Published: (2025)

Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation
by: Van Caudenberg, Daimy, et al.
Published: (2025)

On Dependent Variables in Reactive Synthesis
by: Akshay, S., et al.
Published: (2024)

RustSAT: A Library For SAT Solving in Rust
by: Jabs, Christoph
Published: (2025)

Distributed Incremental SAT Solving with Mallob: Report and Case Study with Hierarchical Planning
by: Schreiber, Dominik
Published: (2025)

On-the-fly LTLf Synthesis under Partial Observability
by: Alon, Nadav, et al.
Published: (2026)

Logic Optimization Meets SAT: A Novel Framework for Circuit-SAT Solving
by: Shi, Zhengyuan, et al.
Published: (2024)

Computing Short SAT Implicants via Ising/QUBO Encodings
by: Spallitta, Giuseppe, et al.
Published: (2026)

SAT-Based Subsumption Resolution
by: Coutelier, Robin, et al.
Published: (2024)

Life span of SAT techniques
by: Fleury, Mathias, et al.
Published: (2024)

SAT-Inspired Higher-Order Eliminations
by: Blanchette, Jasmin, et al.
Published: (2022)

Between proof construction and SAT-solving
by: Schubert, Aleksy, et al.
Published: (2024)

Rethinking Clause Management for CDCL SAT Solvers
by: Cai, Yalun, et al.
Published: (2026)

Empirical Impact of Dimensionality on Random Geometric SAT
by: Rädiker, Flora
Published: (2026)

Compact SAT Encoding for Power Peak Minimization
by: Van Kieu, Tuyen, et al.
Published: (2025)

SAT Solving for Variants of First-Order Subsumption
by: Coutelier, Robin, et al.
Published: (2024)

SAT-based Learning of Computation Tree Logic
by: Pommellet, Adrien, et al.
Published: (2024)

Approaching the Conway-99 problem using SAT solvers
by: Keramatipour, Ali
Published: (2026)

Structure-Aware Computing, Partial Quantifier Elimination And SAT
by: Goldberg, Eugene
Published: (2024)

DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories
by: Feng, Nick, et al.
Published: (2024)

SAT-Based Techniques for Lexicographically Smallest Finite Models
by: Janota, Mikoláš, et al.
Published: (2025)

parSAT: Parallel Solving of Floating-Point Satisfiability
by: Krahl, Markus, et al.
Published: (2025)

Generalizing Unit Commitment Problem Solving via SAT-based Decoupling
by: Zhao, Yuxin, et al.
Published: (2026)

SAT Encodings for Bandwidth Coloring: A Systematic Design Study
by: Nguyen, Duc Trung Kim, et al.
Published: (2026)

Certified Branch-and-Bound MaxSAT Solving (Extended Version)
by: Vandesande, Dieter, et al.
Published: (2025)

Disjoint Projected Enumeration for SAT and SMT without Blocking Clauses
by: Spallitta, Giuseppe, et al.
Published: (2024)

Solving SAT By Computing A Stable Set Of Points In Clusters
by: Goldberg, Eugene
Published: (2025)

Orbitopal Fixing in SAT
by: Anders, Markus, et al.
Published: (2026)

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

PolySAT: Word-level Bit-vector Reasoning in Z3
by: Rath, Jakob, et al.
Published: (2024)

Solving the Two-dimensional single stock size Cutting Stock Problem with SAT and MaxSAT
by: Van Kieu, Tuyen, et al.
Published: (2026)

A SAT-centered XAI method for Deep Learning based Video Understanding
by: Key, Hojer
Published: (2025)

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

SAT-Solving the Poset Cover Problem
by: Yuan, Chih-Cheng Rex, et al.
Published: (2025)

Field Knowledge as a Dual to Distributed Knowledge: A Characterization by Weighted Modal Logic
by: Liang, Xiaolong, et al.
Published: (2024)

Queen Domination by SAT Solving
by: Rostami, Taha, et al.
Published: (2025)

Agent-Knowledge Logic for Alternative Epistemic Logic
by: Nishimura, Yuki
Published: (2024)

Incremental Neural Network Verification via Learned Conflicts
by: Elsaleh, Raya, et al.
Published: (2026)

When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames
by: Krebs, Andreas, et al.
Published: (2025)

Learning to Rank the Initial Branching Order of SAT Solvers
by: Eriksson, Arvid, et al.
Published: (2026)