Polynomial constraints and unsat cores in \textsc{Tarski}
type: Item
instance of: scholarly article
title: Polynomial constraints and unsat cores in \textsc{Tarski}
zbMATH Open document ID: 1395.68353
DOI: 10.1007/978-3-319-96418-8_55
author: Fernando Vale-Enriquez
author: Christopher W. Brown
publication date: 2018-08-17T00:00:00Z
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 6920299
zbMATH Keywords: non-linear polynomial constraints
zbMATH Keywords: unsat cores
zbMATH Keywords: SMT
describes a project that uses: QEPCAD
describes a project that uses: SMT-LIB
describes a project that uses: SMT-RAT
describes a project that uses: Sostools
MaRDI profile type: Publication
full work available at URL: 978-3-319-96418-8 55
OpenAlex ID: W2883018030
Recommended article: TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
Recommended article: On Variable-inactivity and Polynomial Formula-Satisfiability Procedures
Recommended article: Partial Polymorphisms and Constraint Satisfaction Problems
Recommended article: The property of being polynomial for Mal’tsev constraint satisfaction problems
Recommended article: Quantified constraint satisfaction and the polynomially generated powers property
Recommended article: Satisfiability problem: Some polynomial classes of conjunctive normal forms
Recommended article: STACS 2005
Recommended article: Principles and Practice of Constraint Programming – CP 2004
Recommended article: raSAT: an SMT solver for polynomial constraints
Recommended article: raSAT: An SMT Solver for Polynomial Constraints
description: scientific article; zbMATH DE number 6920299