TY - BOOK ID - 22214423 TI - Abstract domains in constraint programming PY - 2015 SN - 1785480103 0081004648 9780081004647 9781785480102 PB - London, England ; Oxford, England : ISTE Press : Elsevier, DB - UniCat KW - Constraint programming (Computer science) KW - Computer programming UR - https://www.unicat.be/uniCat?func=search&query=sysid:22214423 AB - Constraint Programming aims at solving hard combinatorial problems, with a computation time increasing in practice exponentially. The methods are today efficient enough to solve large industrial problems, in a generic framework. However, solvers are dedicated to a single variable type: integer or real. Solving mixed problems relies on ad hoc transformations. In another field, Abstract Interpretation offers tools to prove program properties, by studying an abstraction of their concrete semantics, that is, the set of possible values of the variables during an execution. Various representations ER -