Polynomial constraints and unsat cores in \textsc{Tarski}

DOI10.1007/978-3-319-96418-8_55zbMath1395.68353OpenAlexW2883018030MaRDI QIDQ1662298

Christopher W. Brown, Fernando Vale-Enriquez

Publication date: 17 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96418-8_55

zbMATH Keywords

SMTnon-linear polynomial constraintsunsat cores

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (5)

Applying Machine Learning to Heuristics for Real Polynomial Constraint Solving ⋮ Is computer algebra ready for conjecturing and proving geometric inequalities in the classroom? ⋮ Computing with Tarski formulas and semi-algebraic sets in a web browser ⋮ From simplification to a partial theory solver for non-linear real polynomial constraints ⋮ Tarski

Uses Software

• QEPCAD
• Sostools
• SMT-LIB
• SMT-RAT

This page was built for publication: Polynomial constraints and unsat cores in \textsc{Tarski}