Cover Image

Structure-Aware Computing, Partial Quantifier Elimination And SAT

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Goldberg, Eugene
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

On Efficient Algorithms For Partial Quantifier Elimination
by: Goldberg, Eugene
Published: (2024)

Partial Quantifier Elimination By Certificate Clauses
by: Goldberg, Eugene
Published: (2020)

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

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

Property Checking Without Inductive Invariants
by: Goldberg, Eugene
Published: (2016)

Pseudo-Complex Quantifier Elimination
by: Faroß, Nicolas, et al.
Published: (2026)

Integer Linear-Exponential Programming in NP by Quantifier Elimination
by: Chistikov, Dmitry, et al.
Published: (2024)

Quantifier Elimination Meets Treewidth
by: Wu, Hao, et al.
Published: (2026)

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

Quantifier Elimination and Craig Interpolation, Quantitatively
by: Batz, Kevin, et al.
Published: (2025)

Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability
by: Amat, Nicolas, et al.
Published: (2024)

One-Parametric Presburger Arithmetic has Quantifier Elimination
by: Mansutti, Alessio, et al.
Published: (2025)

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

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

On the Cut Elimination of Weak Intuitionistic Tense Logic
by: Wang, Yiheng, et al.
Published: (2024)

On Hyperproperty Verification, Quantifier Alternations, and Games under Partial Information
by: Beutner, Raven, et al.
Published: (2025)

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

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

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

From Quantifier Depth to Quantifier Number: Separating Structures with k Variables
by: Vinall-Smeeth, Harry
Published: (2023)

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

Multi-Structural Games and Number of Quantifiers
by: Fagin, Ronald, et al.
Published: (2021)

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

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

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

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

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)

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

Fast Ramsey Quantifier Elimination in LIRA (with applications to liveness checking)
by: Lichtner, Kilian, et al.
Published: (2025)

The Dual of Quantifier Elimination: Boolean Elimination over C and R
by: Frank, Matthew
Published: (2025)

Embedded Finite Models Beyond Restricted Quantifier Collapse
by: Benedikt, Michael, et al.
Published: (2023)

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

Some General Completeness Results for Propositionally Quantified Modal Logics
by: Ding, Yifeng, et al.
Published: (2024)

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

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

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

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

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