Constraint programming can be acclimated to baddest assay cases acceptable specific constraints by analytic a set of constraints over a set of variables. The arrangement is declared by the agency of constraints.4 Analytic the set of constraints can be done by Boolean solvers (e.g. SAT-solvers based on the Boolean satisfiability problem) or by after analysis, like the Gaussian elimination. A band-aid begin by analytic the set of constraints formulas can serve as a assay cases for the agnate system.
Constraint programming can be accumulated with allegorical execution. In this access a arrangement archetypal is accomplished symbolically, i.e. accession abstracts constraints over altered ascendancy paths, and again application the coercion programming adjustment for analytic the constraints and bearing assay cases.
No comments:
Post a Comment