Pages that link to "Item:Q972422"
From MaRDI portal
The following pages link to MetiTarski: An automatic theorem prover for real-valued special functions (Q972422):
Displayed 29 items.
- Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems (Q287269) (← links)
- Proving tight bounds on univariate expressions with elementary functions in Coq (Q331615) (← links)
- Case splitting in an automatic theorem prover for real-valued special functions (Q352970) (← links)
- Polynomial function intervals for floating-point software verification (Q457251) (← links)
- A search-based procedure for nonlinear real arithmetic (Q518407) (← links)
- A logarithmic inequality (Q1646361) (← links)
- Proof certificates in PVS (Q1687741) (← links)
- Deciding univariate polynomial problems using untrusted certificates in Isabelle/HOL (Q1725844) (← links)
- Quasi-decidability of a fragment of the first-order theory of real numbers (Q2013319) (← links)
- HOL(y)Hammer: online ATP service for HOL Light (Q2018657) (← links)
- Implicit definitions with differential equations for KeYmaera X (system description) (Q2104559) (← links)
- Learning theorem proving components (Q2142080) (← links)
- Deductive verification of floating-point Java programs in KeY (Q2233510) (← links)
- A conflict-driven solving procedure for poly-power constraints (Q2303230) (← links)
- Verifying safety and persistence in hybrid systems using flowpipes and continuous invariants (Q2331077) (← links)
- Formalization of Bernstein polynomials and applications to global optimization (Q2351165) (← links)
- Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\) (Q2351415) (← links)
- Deadness and how to disprove liveness in hybrid dynamical systems (Q2629097) (← links)
- Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation) (Q2635072) (← links)
- Validating QBF Validity in HOL4 (Q3088005) (← links)
- Proving Valid Quantified Boolean Formulas in HOL Light (Q3088006) (← links)
- SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving (Q3453240) (← links)
- Fuzzy answer set computation via satisfiability modulo theories (Q4592999) (← links)
- Can an A.I. win a medal in the mathematical olympiad? – Benchmarking mechanized mathematics on pre-university problems1 (Q5145435) (← links)
- Formal Proofs for Nonlinear Optimization (Q5195260) (← links)
- On Transfinite Knuth-Bendix Orders (Q5200038) (← links)
- Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition (Q5495916) (← links)
- Isolating all the real roots of a mixed trigonometric-polynomial (Q6051116) (← links)
- An augmented MetiTarski dataset for real quantifier elimination using machine learning (Q6118846) (← links)