Partial Cylindrical Algebraic Decomposition for quantifier elimination
Journal of Symbolic Computation
REDLOG: computer algebra meets computer logic
ACM SIGSAM Bulletin
A compiled implementation of strong reduction
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
A Skeptic’s Approach to Combining HOL and Maple
Journal of Automated Reasoning
A New Approach for Automatic Theorem Proving in Real Geometry
Journal of Automated Reasoning
A Machine-Checked Implementation of Buchberger's Algorithm
Journal of Automated Reasoning
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Theoretical Computer Science - Latin American theoretical informatics
Journal of Functional Programming
QEPCAD B: a program for computing with semi-algebraic sets using CADs
ACM SIGSAM Bulletin
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Efficient projection orders for CAD
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
A formally verified proof of the prime number theorem
ACM Transactions on Computational Logic (TOCL)
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proving formally the implementation of an efficient gcd algorithm for polynomials
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proving equalities in a commutative ring done right in coq
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
A proof-producing decision procedure for real arithmetic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Affine functions and series with co-inductive real numbers
Mathematical Structures in Computer Science
Proving Bounds on Real-Valued Functions with Computations
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Computing in coq with infinite algebraic data structures
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
On the generation of positivstellensatz witnesses in degenerate cases
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Formalization of Bernstein Polynomials and Applications to Global Optimization
Journal of Automated Reasoning
Optimising problem formulation for cylindrical algebraic decomposition
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
| Hi-index | 0.00 |
The Coq system is a Curry–Howard based proof assistant. Therefore, it contains a full functional, strongly typed programming language, which can be used to enhance the system with powerful automation tools through the implementation of reflexive tactics. We present the implementation of a cylindrical algebraic decomposition algorithm within the Coq system, whose certification leads to a proof producing decision procedure for the first-order theory of real numbers.