Efficient solution of a class of quantified constraints with quantifier prefix exists-forall

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10282496" target="_blank" >RIV/00216208:11320/14:10282496 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s11786-014-0195-8" target="_blank" >http://dx.doi.org/10.1007/s11786-014-0195-8</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11786-014-0195-8" target="_blank" >10.1007/s11786-014-0195-8</a>

Result language
angličtina
Original language name
Efficient solution of a class of quantified constraints with quantifier prefix exists-forall
Original language description
In various applications the search for certificates for certain properties (e.g., stability of dynamical systems, program termination) can be formulated as a quantified constraint solving problem with quantifier prefix exists-forall. In this paper, we present an algorithm for solving a certain class of such problems based on interval techniques in combination with conservative linear programming approximation. In comparison with previous work, the method is more general-allowing general Boolean structure in the input constraint, and more efficient-using splitting heuristics that learn from the success of previous linear programming approximations.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BD - Information theory
OECD FORD branch
—

Project
<a href="/en/project/GA13-10660S" target="_blank" >GA13-10660S: Interval methods for optimization problems</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)