Sign-definite polynomials' parity constraints are used as symbolic reduction rules to speed up SMT synthesis of global Lyapunov functions.
In: 2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Symbolic Reduction for Formal Synthesis of Global Lyapunov Functions
Sign-definite polynomials' parity constraints are used as symbolic reduction rules to speed up SMT synthesis of global Lyapunov functions.