Satisfiability of Non-Linear Transcendental Arithmetic as a Certificate Search Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lipparini, Enrico, Ratschan, Stefan
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

MCSAT Modulo Transcendental Arithmetics
by: Gallego-Hernández, Jorge, et al.
Published: (2026)

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

Boosting MCSat Modulo Nonlinear Integer Arithmetic via Local Search
by: Lipparini, Enrico, et al.
Published: (2025)

Deciding Predicate Logical Theories of Real-Valued Functions
by: Ratschan, Stefan
Published: (2023)

Applications of Quantified Constraint Solving over the Reals -- Bibliography
by: Ratschan, Stefan
Published: (2012)

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

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

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

Input-based Three-valued Abstraction Refinement
by: Onderka, Jan, et al.
Published: (2024)

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

A theory of Lending Protocols in DeFi
by: Bartoletti, Massimo, et al.
Published: (2025)

Efficient Solving of Quantified Inequality Constraints over the Real Numbers
by: Ratschan, Stefan
Published: (2002)

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

SMT and Functional Equation Solving over the Reals: Challenges from the IMO
by: Brown, Chad E., et al.
Published: (2025)

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

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

KindHML: formal verification of smart contracts based on Hennessy-Milner logic
by: Bartoletti, Massimo, et al.
Published: (2026)

Program Synthesis for Non-Linear Real Arithmetic: Going Beyond Realizability
by: Akshay, S., et al.
Published: (2026)

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

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

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

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

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

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

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

The Arithmetical Hierarchy: A Realizability-Theoretic Perspective
by: Kihara, Takayuki
Published: (2024)

On proving consistency of equational theories in Bounded Arithmetic
by: Beckmann, Arnold, et al.
Published: (2022)

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

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

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

Coalgebraic Satisfiability Checking for Arithmetic $μ$-Calculi
by: Hausmann, Daniel, et al.
Published: (2022)

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)

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)

PBLean: Pseudo-Boolean Proof Certificates for Lean 4
by: Szeider, Stefan
Published: (2026)

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

Formally Verified Certification of Unsolvability of Temporal Planning Problems
by: Wang, David, et al.
Published: (2025)

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

Arithmetics within the Linear Time Hierarchy
by: Pollett, Chris
Published: (2025)