For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Edinburgh

Return to search Previous output Next output
Output 173 of 401 in the submission
Output title

Gröbner Basis Construction Algorithms Based on Theorem Proving Saturation Loops

Type
E - Conference contribution
DOI
-
Name of conference/published proceedings
Decision Procedures in Software, Hardware and Bioware
Volume number
-
Issue number
-
First page of article
1
ISSN of proceedings
1862-4405
Year of publication
2010
Number of additional authors
2
Additional information

<12> Originality: The chief novelty is the combination of an abstract strategy-independent framework for describing Groebner Basis construction algorithms and the presentation of instantiations of this framework that are implemented and empirically evaluated.

Significance: The implementation was incorporated into Microsoft's Z3 SMT solver and improved its capabilities for non-linear arithmetic reasoning. The Z3 solver was the best performing of the 13 competitors in the 2011 SMT competition.

Rigour: The paper includes a precise mathematical definition of the abstract framework, pseudocode for the instantiations, theorems proving the correctness of the instantiations, and experimental results.

Interdisciplinary
-
Cross-referral requested
-
Research group
F - Laboratory for Foundations of Computer Science
Citation count
-
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-