Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings (Q1996869)
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: Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings |
scientific article; zbMATH DE number 7316066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings |
scientific article; zbMATH DE number 7316066 |
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
0 references
0.8534367084503174
0 references
0.8120859265327454
0 references
0.800085186958313
0 references
0.7823197245597839
0 references
0.7586878538131714
0 references
