# Solving Satisfiability of Polynomial Formulas By Sample-Cell Projection

@article{Li2020SolvingSO, title={Solving Satisfiability of Polynomial Formulas By Sample-Cell Projection}, author={Haokun Li and Bican Xia}, journal={ArXiv}, year={2020}, volume={abs/2003.00409} }

A new algorithm for deciding the satisfiability of polynomial formulas over the reals is proposed. The key point of the algorithm is a new projection operator, called sample-cell projection operator, custom-made for Conflict-Driven Clause Learning (CDCL)-style search. Although the new operator is also a CAD (Cylindrical Algebraic Decomposition)-like projection operator which computes the cell (not necessarily cylindrical) containing a given sample such that each polynomial from the problem is… Expand

#### References

SHOWING 1-10 OF 24 REFERENCES

A CDCL-style calculus for solving non-linear constraints

- Computer Science
- FroCos
- 2019

A novel approach for checking satisfiability of non-linear constraints over the reals, called ksmt, based on conflict resolution in CDCL style calculus, using a composition of symbolical and numerical methods. Expand

Constructing fewer open cells by GCD computation in CAD projection

- Mathematics, Computer Science
- ISSAC
- 2014

It is proved that the new projection operator based on cylindrical algebraic decomposition can be used for testing semi-definiteness of polynomials and still guarantees obtaining at least one sample point from every connected component of the highest dimension. Expand

A Fast Linear-Arithmetic Solver for DPLL(T)

- Computer Science
- CAV
- 2006

A new Simplex-based linear arithmetic solver that can be integrated efficiently in the DPLL(T) framework by enabling fast backtracking, supporting a priori simplification to reduce the problem size, and providing an efficient form of theory propagation. Expand

A Tutorial on Satisfiability Modulo Theories

- Computer Science
- CAV
- 2007

This tutorial presentation is primarily directed at those who wish to build satisfiability solvers or to use existing solvers more effectively. Expand

Towards Conflict-Driven Learning for Virtual Substitution

- Computer Science
- SMT
- 2014

It is shown that the integration of learning techniques into virtual substitution gives rise to considerable speedups, and it is proved soundness and completeness for that calculus. Expand

Improved Projection for Cylindrical Algebraic Decomposition

- Computer Science, Mathematics
- J. Symb. Comput.
- 2001

A simple theorem is presented showing that the mathematics in McCallum?s paper actually point to a better projection operator than he proposes, which has the potential to not simply speed up CAD computation for problems that are currently solvable in practice, but actually increase the scope of problems that can realistically be attacked via CADs. Expand

Solving non-linear arithmetic

- Mathematics, Computer Science
- ACCA
- 2013

We propose a new decision procedure for the existential theory of the reals. It performs a backtracking search for a model in R, where the backtracking is powered by a novel conflict resolution… Expand

Z3: An Efficient SMT Solver

- Mathematics, Computer Science
- TACAS
- 2008

Z3 is a new and efficient SMT Solver freely available from Microsoft Research that is used in various software verification and analysis applications. Expand

A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions

- Computer Science
- CAV
- 2014

A set of algebraic techniques for solving constraints over the theory of unbounded strings natively, without reduction to other problems are presented and implemented in the SMT solver cvc4 to expand its already large set of built-in theories to a theory of strings with concatenation, length, and membership in regular languages. Expand

Quantifier elimination for real closed fields by cylindrical algebraic decomposition

- Mathematics, Computer Science
- 1975

Tarski in 1948, ( Tarski 1951) published a quantifier elimination method for the elementary theory of real closed fields, which provides a decision method, which enables one to decide whether any sentence of the theory is true or false. Expand