SAT modulo linear arithmetic for solving polynomial constraints (Q438576): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10817-010-9196-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10817-010-9196-8 / rank | |||
Normal rank | |||
Latest revision as of 17:37, 9 December 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
