SAT modulo linear arithmetic for solving polynomial constraints (Q438576): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | SAT modulo linear arithmetic for solving polynomial constraints |
scientific article |
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
