9 search results - page 1 / 2 » A Proof-Producing Decision Procedure for Real Arithmetic |
CADE
2005
Springer
14 years 5 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
CAV
2009
Springer
13 years 8 months ago
2009
Springer
We consider the decision problem for quantifier-free formulas whose atoms are linear inequalities interpreted over the reals or rationals. This problem may be decided using satisf...
AISC
2008
Springer
13 years 6 months ago
2008
Springer
Many inequalities involving the functions ln, exp, sin, cos, etc., can be proved automatically by MetiTarski: a resolution theorem prover (Metis) modified to call a decision proced...
JAR
2010
13 years 3 months ago
2010
Many theorems involving special functions such as ln, exp and sin can be proved automatically by MetiTarski: a resolution theorem prover modified to call a decision procedure for ...
CADE
2004
Springer
14 years 5 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...