Programming and certifying a CAD algorithm in the Coq system - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Programming and certifying a CAD algorithm in the Coq system

Assia Mahboubi
  • Function : Correspondent author

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.
No file

Dates and versions

hal-00819492 , version 1 (01-05-2013)

Identifiers

  • HAL Id : hal-00819492 , version 1

Cite

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

Collections

INRIA INRIA2
77 View
0 Download

Share

Gmail Facebook X LinkedIn More