Pages that link to "Item:Q1996869"
From MaRDI portal
The following pages link to Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings (Q1996869):
Displaying 13 items.
- Optimization modulo non-linear arithmetic via incremental linearization (Q831943) (← links)
- Flexible proof production in an industrial-strength SMT solver (Q2104495) (← links)
- Cooperating techniques for solving nonlinear real arithmetic in the \texttt{cvc5} SMT solver (system description) (Q2104500) (← links)
- New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis (Q2109991) (← links)
- From simplification to a partial theory solver for non-linear real polynomial constraints (Q2307623) (← links)
- Levelwise construction of a single cylindrical algebraic cell (Q6149151) (← links)
- Handling polynomial and transcendental functions in SMT via unconstrained optimisation and topological degree test (Q6160909) (← links)
- Computing with Tarski formulas and semi-algebraic sets in a web browser (Q6170823) (← links)
- Local search for solving satisfiability of polynomial formulas (Q6535529) (← links)
- Satisfiability modulo finite fields (Q6535532) (← links)
- Introducing asynchronicity to probabilistic hyperproperties (Q6546446) (← links)
- Recent developments in real quantifier elimination and cylindrical algebraic decomposition (extended abstract of invited talk) (Q6660310) (← links)
- Merging adjacent cells during single cell construction (Q6660335) (← links)
