DeepAI AI Chat
Log In Sign Up

The ksmt calculus is a δ-complete decision procedure for non-linear constraints

04/27/2021
by   Franz Brauße, et al.
0

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 the ksmt calculus and show that it is a δ-complete decision procedure for bounded problems. We also propose an extension with local linearisations, which allow for more efficient treatment of non-linear constraints.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/22/2019

A CDCL-style calculus for solving non-linear constraints

In this paper we propose a novel approach for checking satisfiability of...
04/25/2018

Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams

Linear/non-linear (LNL) models, as described by Benton, soundly model a ...
09/06/2021

Quantum CPOs

We introduce the monoidal closed category qCPO of quantum cpos, whose ob...
03/30/2020

Templates and Recurrences: Better Together

This paper is the confluence of two streams of ideas in the literature o...
04/11/2018

Combinatorics of explicit substitutions

λυ is an extension of the λ-calculus which internalises the calculus of ...
09/25/2019

Iterative division in the Distributive Full Non-associative Lambek Calculus

We study an extension of the Distributive Full Non-associative Lambek Ca...
09/06/2019

Optimizing Generalized Rate Metrics through Game Equilibrium

We present a general framework for solving a large class of learning pro...