By Marie Pelleau
Constraint Programming goals at fixing demanding combinatorial difficulties, with a computation time expanding in perform exponentially. The tools are at the present time effective adequate to unravel huge commercial difficulties, in a known framework. despite the fact that, solvers are devoted to a unmarried variable kind: integer or genuine. fixing combined difficulties will depend on advert hoc differences. In one other box, summary Interpretation bargains instruments to end up software homes, 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. quite a few representations for those abstractions were proposed. they're known as summary domain names. summary domain names can combine any form of variables, or even signify kinfolk among the variables.
In this paintings, we outline summary domain names for Constraint Programming, with a purpose to construct a universal fixing approach, facing either integer and actual variables. We additionally research the octagons summary area, already outlined in summary Interpretation. Guiding the hunt through the octagonal family members, we receive reliable effects on a continuing benchmark. We additionally outline our fixing procedure utilizing summary Interpretation concepts, so as to comprise latest summary domain names. Our solver, AbSolute, is ready to remedy combined difficulties and use relational domains.
- Exploits the over-approximation ways 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