8 citations · 16 across the 4 of their papers we have counts for
5 papers
The ksmt calculus is a -complete decision procedure for non-linear constraints
Franz Brauße, Konstantin Korovin, Margarita V. Korovina +1
ksmt is a CDCL-style calculus for solving non-linear constraints over real numbers involving polynomials and transcendental functions. In this paper we investigate properties of th…
A CDCL-style calculus for solving non-linear constraints
Franz Brauße, Konstantin Korovin, Margarita Korovina +1
In this paper we propose a novel approach for checking satisfiability of non-linear constraints over the reals, called ksmt. The procedure is based on conflict resolution in CDCL s…
Semantics, Specification Logic, and Hoare Logic of Exact Real Computation
Sewon Park, Franz Brauße, Pieter Collins +7
We propose a simple imperative programming language, ERC, that features arbitrary real numbers as primitive data type, exactly. Equipped with a denotational semantics, ERC provides…
Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime
Akitoshi Kawamura, Norbert Th. Müller, Carsten Rösnick +1
The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, inte…
Making big steps in trajectories
Norbert Th. Müller, Margarita Korovina
We consider the solution of initial value problems within the context of hybrid systems and emphasise the use of high precision approximations (in software for exact real arithmeti…