Téléchargez le livre : Abstract Domains in Constraint Programming

Abstract Domains in Constraint Programming



de

Éditeur :

Iste Press - Elsevier


Paru le : 2015-05-20



eBook Téléchargement , DRM LCP 🛈 DRM Adobe 🛈 ebook sans DRM
Lecture en ligne (streaming)
56,92 €
Téléchargement immédiat
Dès validation de votre commande
Ajouter à ma liste d'envies
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

badge apple Application Louise Reader
badge Android Application Louise Reader
Description
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 for these abstractions have been proposed. They are called abstract domains. Abstract domains can mix any type of variables, and even represent relations between the variables. In this work, we define abstract domains for Constraint Programming, so as to build a generic solving method, dealing with both integer and real variables. We also study the octagons abstract domain, already defined in Abstract Interpretation. Guiding the search by the octagonal relations, we obtain good results on a continuous benchmark. We also define our solving method using Abstract Interpretation techniques, in order to include existing abstract domains. Our solver, AbSolute, is able to solve mixed problems and use relational domains. - Exploits the over-approximation methods to integrate AI tools in the methods of CP - Exploits the relationships captured to solve continuous problems more effectively - Learn from the developers of a solver capable of handling practically all abstract domains
Pages
176 pages
Collection
n.c
Parution
2015-05-20
Marque
Iste Press - Elsevier
EAN papier
9781785480102
EAN PDF
9780081004647
Informations sur l'ebook
Nombre pages copiables
17
Nombre pages imprimables
17
Taille du fichier
3492 Ko
Ce livre est accessible aux handicaps Voir les informations sur l'accessibilité
Prix
56,92 €
EAN EPUB SANS DRM
9780081004647
Informations sur l'ebook
Ce livre est accessible aux handicaps Voir les informations sur l'accessibilité
Prix
56,92 €
Marie Pelleau is a Doctorate in Computer Science at the University of Nantes, France. Her research interests include Constraint Programming and local research Constraint Programming (CP) to model and solve combinatory problems.

Suggestions personnalisées