SAT modulo linear arithmetic for solving polynomial constraints (Q438576)
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: SAT modulo linear arithmetic for solving polynomial constraints |
scientific article; zbMATH DE number 6062063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SAT modulo linear arithmetic for solving polynomial constraints |
scientific article; zbMATH DE number 6062063 |
Statements
SAT modulo linear arithmetic for solving polynomial constraints (English)
0 references
31 July 2012
0 references
non-linear arithmetic
0 references
constraint solving
0 references
polynomial constraints
0 references
SAT modulo theories
0 references
termination
0 references
system verification
0 references
0.9197124242782592
0 references
0.8174289464950562
0 references
0.8086121082305908
0 references
0.7928361296653748
0 references
0.7904670238494873
0 references
