Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure

Abstrakt

In order to facilitate automated reasoning about large Boolean combinations of non-linear arithmetic constraints involving transcendental functions, we provide a tight integration of recent SAT solving techniques with interval-based arithmetic constraint solving. As a consequence, our approach is able to handle large constraint systems with extremely complex Boolean structure, involving Boolean combinations of multiple thousand arithmetic constraints over some thousands of variables.

Kategorie a štítky

  • Článek v odborném periodiku