δ-Complete Decision Procedures for Satisfiability over the Reals
Authors:
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 286-300
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- MetiTarski: An Automatic Theorem Prover for Real-Valued Special FunctionsJournal of Automated Reasoning, 2009
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear ArithmeticLecture Notes in Computer Science, 2009
- A Tutorial on Computable Analysis2008
- The complexity of quantifier elimination and cylindrical algebraic decomposition2007
- Combining decision procedures for the realsLogical Methods in Computer Science, 2006
- A Fast Linear-Arithmetic Solver for DPLL(T)2006
- Continuous and Interval Constraints2006
- Bounded Model Checking Using Satisfiability SolvingFormal Methods in System Design, 2001
- Model Checking2001
- Quantifier elimination for real closed fields by cylindrical algebraic decompostion1975