Skip to Main content Skip to Navigation
New interface
Conference papers

Programming and certifying a CAD algorithm in the Coq system

Assia Mahboubi 1, * 
* Corresponding author
1 LEMME - Software and mathematics
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : A. Tarski has shown in 1948 that one can perform quantifier elimination in the theory of real closed fields. The introduction of the Cylindrical Algebraic Decomposition (CAD) method has later allowed to design rather feasible algorithms. Our aim is to program a reflectional decision procedure for the Coq system, using the CAD, to decide whether a (possibly multivariate) system of polynomial inequalities with rational coefficients has a solution or not. We have therefore implemented various computer algebra tools like gcd computations, subresultant polynomial or Bernstein polynomials.
Document type :
Conference papers
Complete list of metadata
Contributor : Assia Mahboubi Connect in order to contact the contributor
Submitted on : Wednesday, May 1, 2013 - 4:16:00 PM
Last modification on : Friday, February 4, 2022 - 3:09:29 AM


  • HAL Id : hal-00819492, version 1



Assia Mahboubi. Programming and certifying a CAD algorithm in the Coq system. Dagstuhl Seminar 05021 - Mathematics, Algorithms, Proofs, Jan 2005, Dagstuhl, Germany. ⟨hal-00819492⟩



Record views