Approximate quantified constraint solving (AQCS). AQCS is a program for solving quantified constraints approximately. A quantified constraint is a formula of first-order predicate logic containing the following symbols: Variables ranging over the reals, floating point interval constants, the function symbols + and ., the predicate symbols <= , =, <, >= and >, and the quantifiers exist and forall . The output for a given quantified constraint is a set of boxes on which the constraint is guaranteed to be true and a set of boxes on which the constraint is guaranteed to be false. For constraints with less than three free variables graphical output is also available.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element