Abstract Domains in Constraint Programming - 1st Edition - ISBN: 9781785480102, 9780081004647

Abstract Domains in Constraint Programming

1st Edition

Authors: Marie Pelleau
eBook ISBN: 9780081004647
Hardcover ISBN: 9781785480102
Imprint: ISTE Press - Elsevier
Published Date: 6th May 2015
Page Count: 176
Tax/VAT will be calculated at check-out Price includes VAT (GST)
30% off
30% off
30% off
30% off
30% off
20% off
20% off
30% off
30% off
30% off
30% off
30% off
20% off
20% off
30% off
30% off
30% off
30% off
30% off
20% off
20% off
75.00
52.50
52.50
52.50
52.50
52.50
60.00
60.00
45.99
32.19
32.19
32.19
32.19
32.19
36.79
36.79
53.95
37.77
37.77
37.77
37.77
37.77
43.16
43.16
Unavailable
Price includes VAT (GST)
× DRM-Free

Easy - Download and start reading immediately. There’s no activation process to access eBooks; all eBooks are fully searchable, and enabled for copying, pasting, and printing.

Flexible - Read on multiple operating systems and devices. Easily read eBooks on smart phones, computers, or any eBook readers, including Kindle.

Open - Buy once, receive and download all available eBook formats, including PDF, EPUB, and Mobi (for Kindle).

Institutional Access

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.

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.

Key Features

  • 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

Readership

Researchers and graduate students in Constraint Programming, Researchers in Artificial Intelligence, Operations Research, and Mathematical Programming

Table of Contents

  • Dedication
  • Preface
  • Introduction
    • I.1 Context
    • I.2 Problematic
    • I.3 Outline of the book
    • I.4 Contributions
  • 1. State of the Art
    • Abstract
    • 1.1 Abstract interpretation
    • 1.2 Constraint programming
    • 1.3 Synthesis
  • 2. Abstract Interpretation for the Constraints
    • Abstract
    • 2.1 Introduction
    • 2.2 Unified components
    • 2.3 Unified solving
    • 2.4 Conclusion
  • 3. Octagons
    • Abstract
    • 3.1 Definitions
    • 3.2 Representations
    • 3.3 Abstract domain components
    • 3.4 Abstract domains
    • 3.5 Conclusion
  • 4. Octagonal Solving
    • Abstract
    • 4.1 Octagonal CSP
    • 4.2 Octagonal consistency and propagation
    • 4.3 Octagonal solver
    • 4.4 Experimental results
    • 4.5 Conclusion
  • 5. An Abstract Solver: AbSolute
    • Abstract
    • 5.1 Abstract solving method
    • 5.2 The AbSolute solver
    • 5.3 Conclusion
  • Conclusion and Perspectives
    • C.1 Conclusion
    • C.2 Perspectives
  • Bibliography
  • Index

Details

No. of pages:
176
Language:
English
Copyright:
© ISTE Press - Elsevier 2015
Published:
Imprint:
ISTE Press - Elsevier
eBook ISBN:
9780081004647
Hardcover ISBN:
9781785480102

About the Author

Marie Pelleau

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.

Affiliations and Expertise

Université de Nantes, France