A hybrid method of oracle-guided gradient descent and interval arithmetic generates increasingly tight certified lower bounds on the maximum satisfaction probability for stochastic constraints.
ACM Transactions on Mathematical Software (TOMS)32(1), 138–156 (2006)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Solving Stochastic Constraints by Oracle-based Gradient Descent and Interval Arithmetic
A hybrid method of oracle-guided gradient descent and interval arithmetic generates increasingly tight certified lower bounds on the maximum satisfaction probability for stochastic constraints.