The satisfiability problem in real closed fields is decidable. In the context of satisfiability modulo theories, the problem restricted to conjunctive sets of literals, that is, sets of polynomial constraints, is of particular importance. One of the central problems is the computation of good explanations of the unsatisfiability of such sets, i.e. obtaining a small subset of the input constraints whose conjunction is already unsatisfiable. We adapt two commonly used real quantifier elimination methods, cylindrical algebraic decomposition and virtual substitution, to provide such conflict sets and demonstrate the performance of our method in practice.
CITATION STYLE
Jaroschek, M., Dobal, P. F., & Fontaine, P. (2015). Adapting real quantifier elimination methods for conflict set computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9322, pp. 151–166). Springer Verlag. https://doi.org/10.1007/978-3-319-24246-0_10
Mendeley helps you to discover research relevant for your work.