:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Van Kieu, Tuyen, Nguyen, Phong Chi, Hoang, Bao Gia, Van To, Khanh
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2512.11435
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

Efficient SAT and MaxSAT techniques for solving the Two-Dimensional Strip Packing Problem
by: Kieu, Tuyen Van, et al.
Published: (2025)

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

Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks
by: Kabir, Mohimenul, et al.
Published: (2025)

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

Encoding Peano Arithmetic in a Minimal Fragment of Separation Logic
by: Ito, Sohei, et al.
Published: (2025)

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

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

Structural Origin and the Minimal Syntax of NP-Hardness: Analysis of SAT from Syntactic Generativity and Compositional Collapse
by: Nishiyama, Yumiko
Published: (2025)

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)

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)

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

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

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)

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)

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

A Naive Encoding of Russell's Paradox in Type Theory
by: Qu, Zhuoyuan
Published: (2025)

SAT Encoding of Partial Ordering Models for Graph Coloring Problems
by: Faber, Daniel, et al.
Published: (2024)

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

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

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

Efficient Incremental #SAT via Cross-Instance Knowledge Reuse
by: Bartal, Uriya, et al.
Published: (2026)

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

Boolean Variation and Boolean Logic BackPropagation
by: Nguyen, Van Minh
Published: (2023)

Impredicative Encodings of (Higher) Inductive Types
by: Awodey, Steve, et al.
Published: (2018)

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

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

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

When both Grounding and not Grounding are Bad -- A Partially Grounded Encoding of Planning into SAT (Extended Version)
by: Filipe, João, et al.
Published: (2026)

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

Deeply Optimizing the SAT Solver for the IC3 Algorithm
by: Su, Yuheng, et al.
Published: (2025)