A CDCL-style calculus for solving non-linear constraints
Abstract
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 style calculus, using a composition of symbolical and numerical methods. To deal with the non-linear components in case of conflicts we use numerically constructed restricted linearisations. This approach covers a large number of computable non-linear real functions such as polynomials, rational or trigonometrical functions and beyond. A prototypical implementation has been evaluated on several non-linear SMT-LIB examples and the results have been compared with state-of-the-art SMT solvers.
Cite
@article{arxiv.1905.09227,
title = {A CDCL-style calculus for solving non-linear constraints},
author = {Franz Brauße and Konstantin Korovin and Margarita Korovina and Norbert Th. Müller},
journal= {arXiv preprint arXiv:1905.09227},
year = {2019}
}
Comments
17 pages, 3 figures; accepted at FroCoS 2019; software available at <http://informatik.uni-trier.de/~brausse/ksmt/>