On Gröbner Bases in the Context of Satisfiability-Modulo-Theories Solving over the Real Numbers

DOI10.1007/978-3-642-40663-8_18zbMath1398.68696OpenAlexW76533186MaRDI QIDQ2850015

Sebastian Junges, Erika Ábrahám, Ulrich Loup, Florian Corzilius

Publication date: 20 September 2013

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: http://publications.rwth-aachen.de/record/228582

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (4)

SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving ⋮ Modular strategic SMT solving with \textbf{SMT-RAT} ⋮ Experiments with automated reasoning in the class ⋮ MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures

Uses Software

• SMT-RAT

This page was built for publication: On Gröbner Bases in the Context of Satisfiability-Modulo-Theories Solving over the Real Numbers