Polynomial constraints and unsat cores in \textsc{Tarski}
From MaRDI portal
Publication:1662298
DOI10.1007/978-3-319-96418-8_55zbMATH Open1395.68353OpenAlexW2883018030MaRDI QIDQ1662298FDOQ1662298
Authors: Fernando Vale-Enriquez, Christopher W. Brown 
Publication date: 17 August 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-96418-8_55
Recommendations
- TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
- On Variable-inactivity and Polynomial Formula-Satisfiability Procedures
- Partial Polymorphisms and Constraint Satisfaction Problems
- The property of being polynomial for Mal’tsev constraint satisfaction problems
- Quantified constraint satisfaction and the polynomially generated powers property
- Satisfiability problem: Some polynomial classes of conjunctive normal forms
- STACS 2005
- Principles and Practice of Constraint Programming – CP 2004
- raSAT: an SMT solver for polynomial constraints
- raSAT: An SMT Solver for Polynomial Constraints
Cited In (7)
- 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
- Tarski
- Applying Machine Learning to Heuristics for Real Polynomial Constraint Solving
- Supporting proving and discovering geometric inequalities in GeoGebra by using Tarski
- Faithful real-time animation of parametrized (semi-) algebraic expressions via cylindrical algebraic decomposition
- From simplification to a partial theory solver for non-linear real polynomial constraints
Uses Software
This page was built for publication: Polynomial constraints and unsat cores in \textsc{Tarski}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662298)
