Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings (Q1996869): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jlamp.2020.100633 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JLAMP.2020.100633 / rank | |||
Normal rank | |||
Latest revision as of 18:12, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings |
scientific article |
Statements
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings (English)
0 references
26 February 2021
0 references
satisfiability modulo theories
0 references
nonlinear real arithmetic
0 references
cylindrical algebraic decomposition
0 references
real polynomial systems
0 references
0 references
0 references
0 references
0 references
