Search Results for author:
Found 1 papers, 0 papers with code
On Classifying Continuous Constraint Satisfaction Problems
In an instance of this problem we are given some sentence of the form $\exists x_1, \ldots, x_n \in \mathbb{R} : \Phi(x_1, \ldots, x_n)$, where $\Phi$ is a well-formed quantifier-free formula consisting of the symbols $\{0, 1, +, \cdot, \geq, >, \wedge, \vee, \neg\}$, the goal is to check whether this sentence is true.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
