A Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematics in Computer Science Year : 2017

A Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications

Abstract

Effective quantifier elimination procedures for first-order theories provide a powerful tool for generically solving a wide range of problems based on logical specifications. In contrast to general first-order provers, quantifier elimination procedures are based on a fixed set of admissible logical symbolswith an implicitly fixed semantics. This admits the use of sub-algorithms from symbolic computation. We are going to focus on quantifier elimination for the reals and its applications giving examples from geometry, verification, and the life sciences. Beyond quantifier elimination we are going to discuss recent results with a subtropical procedure for an existential fragment of the reals. This incomplete decision procedure has been successfully applied to the analysis of reaction systems in chemistry and in the life sciences.
Fichier principal
Vignette du fichier
10.1007_s11786-017-0319-z.pdf (1.14 Mo) Télécharger le fichier
Origin : Explicit agreement for this submission
Loading...

Dates and versions

hal-01648690 , version 1 (30-11-2017)

Identifiers

Cite

Thomas Sturm. A Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications. Mathematics in Computer Science, 2017, 11 (3-4), pp.483 - 502. ⟨10.1007/s11786-017-0319-z⟩. ⟨hal-01648690⟩
110 View
569 Download

Altmetric

Share

Gmail Facebook X LinkedIn More