SAT modulo linear arithmetic for solving polynomial constraints (Q438576): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: AProVE / rank | |||
Normal rank | |||
Revision as of 23:51, 29 February 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
