Imagen de Portada

GaloisSAT: Differentiable Boolean Satisfiability Solving via Finite Field Algebra

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kim, Curie, Portner, Carsten, Liu, Mingju, Dai, Steve, Ren, Haoxing, Khailany, Brucek, Velasquez, Alvaro, Alkhouri, Ismail, Yu, Cunxi
Formato:	Preprint
Publicado:	2026
Materias:	Logic in Computer Science Artificial Intelligence
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

TurboSAT: Gradient-Guided Boolean Satisfiability Accelerated on GPU-CPU Hybrid System
por: Dai, Steve, et al.
Publicado: (2025)

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

Complexity of Satisfiability in Kochen-Specker Partial Boolean Algebras
por: Dawar, Anuj, et al.
Publicado: (2026)

Satisfiability of Quantified Boolean Announcements
por: van Ditmarsch, Hans, et al.
Publicado: (2022)

Rings and Boolean Algebras as Algebraic Theories
por: De Faveri, Arturo
Publicado: (2025)

Finding Connections via Satisfiability Solving
por: Eisenhofer, Clemens, et al.
Publicado: (2026)

Spanning Matrices via Satisfiability Solving
por: Eisenhofer, Clemens, et al.
Publicado: (2024)

RustSAT: A Library For SAT Solving in Rust
por: Jabs, Christoph
Publicado: (2025)

Autonomous Code Evolution Meets NP-Completeness
por: Yu, Cunxi, et al.
Publicado: (2025)

Orthologic for SAT Solving
por: de Haldat, Vladislas, et al.
Publicado: (2026)

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

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

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

VerilogCoder: Autonomous Verilog Coding Agents with Graph-based Planning and Abstract Syntax Tree (AST)-based Waveform Tracing Tool
por: Ho, Chia-Tung, et al.
Publicado: (2024)

Solving Fuzzy Satisfiability via Mixed-Integer Non-Linear Programming
por: Castro, Pablo F.
Publicado: (2026)

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

Degree of Satisfiability in Heyting Algebras
por: Bumpus, Benjamin Merlin, et al.
Publicado: (2021)

Solving Satisfiability Modulo Counting Exactly with Probabilistic Circuits
por: Li, Jinzhao, et al.
Publicado: (2025)

Differentiable Initialization-Accelerated CPU-GPU Hybrid Combinatorial Scheduling
por: Liu, Mingju, et al.
Publicado: (2026)

Minimal Axiomatization of Boolean Algebras
por: Zhang, Eugene
Publicado: (2023)

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

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

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

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

Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants
por: Kieronski, Emanuel, et al.
Publicado: (2016)

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

Characterizing Finitely Based Abelian Mal'cev Algebras
por: Muro, Mateo
Publicado: (2024)

A Scalable Lift-and-Project Differentiable Approach For the Maximum Cut Problem
por: Alkhouri, Ismail, et al.
Publicado: (2025)

Power Term Polynomial Algebra for Boolean Logic
por: Sansone, Emanuele, et al.
Publicado: (2026)

The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable
por: Pratt-Hartmann, Ian
Publicado: (2017)

Satisfiability in Łukasiewicz logic and its unbounded relative
por: Haniková, Zuzana, et al.
Publicado: (2025)

DateSAT: A Framework for Solving Date and Period Constraints
por: Cui, Leyi, et al.
Publicado: (2026)

SAT Solving Using XOR-OR-AND Normal Forms
por: Andraschko, Bernhard, et al.
Publicado: (2023)

The General and Finite Satisfiability Problems for PCTL are Undecidable
por: Chodil, Miroslav, et al.
Publicado: (2024)

Completeness of Finitely Weighted Kleene Algebra With Tests
por: Sedlár, Igor
Publicado: (2024)

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

Hyperproperty Verification as CHC Satisfiability
por: Itzhaky, Shachar, et al.
Publicado: (2023)

Boolean basis, formula size, and number of modal operators
por: Berkholz, Christoph, et al.
Publicado: (2024)

Probabilistic-bit Guided CDCL for SAT Solving using Ising Consensus Assumptions
por: Bino, Melki
Publicado: (2026)

Function Recovery Attacks in Gate-Hiding Garbled Circuits using SAT Solving
por: Yin, Chao, et al.
Publicado: (2026)