Abstract Domains in Constraint Programming - download pdf or read online

Constraint Programming goals at fixing difficult combinatorial difficulties, with a computation time expanding in perform exponentially. The tools are this day effective sufficient to unravel huge business difficulties, in a universal framework. although, solvers are devoted to a unmarried variable style: integer or actual. fixing combined difficulties depends upon advert hoc adjustments. In one other box, summary Interpretation bargains instruments to turn out software houses, by means of learning an abstraction in their concrete semantics, that's, the set of attainable values of the variables in the course of an execution. a number of representations for those abstractions were proposed. they're referred to as summary domain names. summary domain names can combine any kind of variables, or even characterize family among the variables.

In this paintings, we outline summary domain names for Constraint Programming, on the way to construct a widespread fixing procedure, facing either integer and actual variables. We additionally learn the octagons summary area, already outlined in summary Interpretation. Guiding the quest via the octagonal kinfolk, we receive strong effects on a continuing benchmark. We additionally outline our fixing process utilizing summary Interpretation innovations, so as to contain current summary domain names. Our solver, AbSolute, is ready to clear up combined difficulties and use relational domains.

• Exploits the over-approximation easy methods to combine AI instruments within the tools of CP
• Exploits the relationships captured to resolve non-stop difficulties extra effectively
• Learn from the builders of a solver in a position to dealing with virtually all summary domains