×

AQCS

swMATH ID: 8109
Software Authors: Ratschan, S
Description: 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.
Homepage: http://www2.cs.cas.cz/~ratschan/AQCS/AQCS.html
Related Software: QEPCAD; RSOLVER; mctoolbox; GloptiPoly; Acumen; MetiTarski; TopDeg; Numerica; IbexOpt; gaol; RealPaver; INTBIS; RAGlib; REDLOG; SYNRAC; Matlab; INTOPT_90
Cited in: 14 Publications

Citations by Year