Comparing CSP and SAT solvers for polynomial constraints in termination provers (Q2871851)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: scientific article |
scientific article; zbMATH DE number 6244379
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparing CSP and SAT solvers for polynomial constraints in termination provers |
scientific article; zbMATH DE number 6244379 |
Statements
10 January 2014
0 references
polynomial interpretations
0 references
term rewriting
0 references
program analysis
0 references
termination
0 references
Comparing CSP and SAT solvers for polynomial constraints in termination provers (English)
0 references
