:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Schubert, Aleksy, Urzyczyn, Paweł, Zdanowski, Konrad
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2405.05670
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The strength of Ramsey Theorem for coloring relatively large sets
by: Carlucci, Lorenzo, et al.
Published: (2012)

Reductions of well-ordering principles to combinatorial theorems
by: Carlucci, Lorenzo, et al.
Published: (2024)

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

A proof theory of (omega-)context-free languages, via non-wellfounded proofs
by: Das, Anupam, et al.
Published: (2024)

Extracting efficient exact real number computation from proofs in constructive type theory
by: Konečný, Michal, et al.
Published: (2022)

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

A proof-theoretic approach to abstract interpretation
by: D'Silva, Vijay, 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)

Bijective proofs for Eulerian numbers of types B and D
by: Santocanale, Luigi
Published: (2021)

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

A logic of judgmental existence and its relation to proof irrelevance
by: Pezlar, Ivo
Published: (2024)

The proof theory and semantics of second-order (intuitionistic) tense logic
by: Becker, Justus, et al.
Published: (2026)

Uniform interpolation with constructive diamond
by: van der Giessen, Iris, et al.
Published: (2026)

A linear proof language for second-order intuitionistic linear logic
by: Díaz-Caro, Alejandro, et al.
Published: (2023)

Wider systems for linear logic with fixed points: proof theory and complexity
by: Das, Anupam, et al.
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)

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)

The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
by: Oda, Yukihiro, et al.
Published: (2021)

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

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

Degrees of incomputability, realizability and constructive reverse mathematics
by: Kihara, Takayuki
Published: (2020)

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)

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

New bounds on the strength of some restrictions of Hindman's Theorem
by: Carlucci, Lorenzo, et al.
Published: (2017)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

Generalisation of proof simulation procedures for Frege systems by M.L.~Bonet and S.R.~Buss
by: Kozhemiachenko, Daniil
Published: (2024)

A comparison of three kinds of monotonic proof-theoretic semantics and the base-incompleteness of intuitionistic logic
by: d'Aragona, Antonio Piccolomini
Published: (2025)

An ecumenical view of proof-theoretic semantics
by: Nascimento, Victor, et al.
Published: (2023)

Disjoint Projected Enumeration for SAT and SMT without Blocking Clauses
by: Spallitta, Giuseppe, 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)

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

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