:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Castro, Pablo F.
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2604.15992
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Satisfiability Modulo Exponential Integer Arithmetic
by: Frohn, Florian, et al.
Published: (2024)

Satisfiability for Knowing How over Linear Plans is NP-complete
by: Areces, Carlos, et al.
Published: (2026)

Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
by: Lommen, Nils, et al.
Published: (2022)

Satisfiability of Non-Linear Transcendental Arithmetic as a Certificate Search Problem
by: Lipparini, Enrico, et al.
Published: (2023)

Optimization Modulo Integer Linear-Exponential Programs
by: Hitarth, S, et al.
Published: (2025)

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

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

Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic (Technical Report)
by: Habermehl, Peter, et al.
Published: (2024)

Overapproximation of Non-Linear Integer Arithmetic for Smart Contract Verification
by: Hozzová, Petra, et al.
Published: (2024)

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

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

Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization
by: Chatterjee, Krishnendu, et al.
Published: (2024)

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

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

Hyperproperty Verification as CHC Satisfiability
by: Itzhaky, Shachar, et al.
Published: (2023)

Non-expansive Fuzzy ALC
by: Gebhart, Stefan, et al.
Published: (2025)

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

Solving Satisfiability Modulo Counting for Symbolic and Statistical AI Integration With Provable Guarantees
by: Li, Jinzhao, et al.
Published: (2023)

Modular Automatic Complexity Analysis of Recursive Integer Programs
by: Lommen, Nils, et al.
Published: (2025)

Targeting Completeness: Automated Complexity Analysis of Integer Programs
by: Lommen, Nils, et al.
Published: (2024)

Non-Expansive Fuzzy Coalgebraic Logic
by: Gebhart, Stefan, et al.
Published: (2025)

Satisfiability Modulo Theories for Verifying MILP Certificates
by: Wood, Kenan, et al.
Published: (2023)

On the Satisfiability of Local First-Order Logics with Data
by: Bollig, Benedikt, et al.
Published: (2023)

Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory [Extended Version]
by: Kettmann, Pascal, et al.
Published: (2026)

Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
by: Lommen, Nils, et al.
Published: (2023)

Satisfiability Modulo Extensional Constant Arrays (Extended Version)
by: Preiner, Mathias, et al.
Published: (2026)

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

Checking Satisfiability of Hyperproperties using First-Order Logic
by: Beutner, Raven, et al.
Published: (2025)

Coinductive Techniques for Checking Satisfiability of Generalized Nested Conditions
by: Stoltenow, Lara, et al.
Published: (2024)

FLINGO -- Instilling ASP Expressiveness into Linear Integer Constraints
by: Fandinno, Jorge, et al.
Published: (2026)

Inductive Satisfiability Certification for Universal Quantifiers and Uninterpreted Function Symbols
by: Ratschan, Stefan, et al.
Published: (2026)

Satisfiability.jl: Satisfiability Modulo Theories in Julia
by: Soroka, Emiko, et al.
Published: (2023)

The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic are Highly Undecidable
by: Chodil, Miroslav, et al.
Published: (2025)

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder
by: Fortin, Marie, et al.
Published: (2023)

Neuro-Symbolic Constrained Optimization for Cloud Application Deployment via Graph Neural Networks and Satisfiability Modulo Theory
by: Erascu, Madalina
Published: (2025)

Linear Programming in Isabelle/HOL
by: Parsert, Julian
Published: (2024)

Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability
by: Orvalho, Pedro, et al.
Published: (2026)

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