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

Grant Olney Passmore, Leonardo Mendonça de Moura, Paul B. Jackson · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2010

We present novel Gr"obner basis algorithms based on saturation loops used by modern superposition theorem provers. We illustrate the practical value of the algorithms through an experimental implementation within the Z3 SMT solver.

Read the paper · More papers on PaperTik