Cover Image

SAT Solving for Variants of First-Order Subsumption

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Coutelier, Robin, Rath, Jakob, Rawson, Michael, Biere, Armin, Kovács, Laura
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Lazy Reimplication in Chronological Backtracking
by: Coutelier, Robin, et al.
Published: (2025)

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

Spanning Matrices via Satisfiability Solving
by: Eisenhofer, Clemens, et al.
Published: (2024)

Finding Connections via Satisfiability Solving
by: Eisenhofer, Clemens, et al.
Published: (2026)

Term Ordering Diagrams
by: Hajdu, Márton, et al.
Published: (2025)

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

The Vampire Diary
by: Bártek, Filip, et al.
Published: (2025)

Rewriting and Inductive Reasoning
by: Hajdu, Márton, et al.
Published: (2024)

Constraint Learning for Non-confluent Proof Search
by: Rawson, Michael, et al.
Published: (2026)

On Enumerating Short Projected Models
by: Möhle, Sibylle, et al.
Published: (2021)

Disjoint Partial Enumeration without Blocking Clauses
by: Spallitta, Giuseppe, et al.
Published: (2023)

Lean on Vampire Proofs (Short Paper)
by: Bodingbauer, Jonas, et al.
Published: (2026)

CryptoVampire: Automated Reasoning for the Complete Symbolic Attacker Cryptographic Model
by: Jeanteur, Simon, et al.
Published: (2023)

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

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

Subsumption in $\mathcal{FL}_{\bot \mathit{reg}}$ with TBoxes Is in ExpTime
by: Henne, Michał, et al.
Published: (2026)

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

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

Scaling CheckMate for Game-Theoretic Security
by: Rain, Sophie, et al.
Published: (2024)

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

On Solving String Equations via Powers and Parikh Images
by: Eisenhofer, Clemens, et al.
Published: (2026)

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)

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

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

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

Unravelling Cyclic First-Order Arithmetic
by: Leigh, Graham E., et al.
Published: (2025)

Case Study: Saturations as Explicit Models in Equational Theories
by: Janota, Mikoláš, et al.
Published: (2026)

When Agda met Vampire
by: Šinkarovs, Artjoms, et al.
Published: (2026)

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

Case Study: Verified Vampire Proofs in the LambdaPi-calculus Modulo
by: Komel, Anja Petković, et al.
Published: (2025)

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

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

Positive Almost-Sure Termination of Polynomial Random Walks
by: Winkler, Lorenz, et al.
Published: (2025)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
by: Artale, Alessandro, et al.
Published: (2025)

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

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

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

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