[PDF] A Combination Of Abstract Interpretation And Constraint Programming eBook

Author : Ghiles Ziat
Publisher :
Page : 0 pages
File Size : 18,68 MB
Release : 2019
Category :
ISBN :

GET BOOK

We investigate in this thesis a tight collaboration between techniques of Abstract Interpretation and Constraint Programming within a unified method of resolution of constraint satisfaction problems. This work addresses the problem of the design in a generic and modular way of a constraint solver based on abstract domains, which capture specific properties of program or constrained variables. We exploit the assets of both fields to bypass the restriction of standard constraint solvers, such as the dedication to a certain type of constraints or variables. Our effort also consists in the design of a robust method, providing soundness properties even in thecontext of floating-point errors. Moreover, we are interested in different techniques allowing the construction of a partition of a solution space that can be easily reused, both from a quantitative and a qualitative point of view. Our work has been concretized in the form of an implementation within the AbSolute constraint solver and applied on several examples. Our experiments show that our methods improve the solver's efficiency or the quality of the results according to the metrics we have defined.

Author : Marie Pelleau
Publisher : Elsevier
Page : 177 pages
File Size : 16,46 MB
Release : 2015-05-20
Category : Computers
ISBN : 0081004648

GET BOOK

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

Author : Ugo Montanari
Publisher : Springer Science & Business Media
Page : 676 pages
File Size : 12,66 MB
Release : 1995-09-06
Category : Computers
ISBN : 9783540602996

GET BOOK

This book constitutes the proceedings of the First International Conference on Principles and Practice of Constraint Programming, CP '95, held in Cassis near Marseille, France in September 1995. The 33 refereed full papers included were selected out of 108 submissions and constitute the main part of the book; in addition there is a 60-page documentation of the four invited papers and a section presenting industrial reports. Thus besides having a very strong research component, the volume will be attractive for practitioners. The papers are organized in sections on efficient constraint handling, constraint logic programming, concurrent constraint programming, computational logic, applications, and operations research.

Author : Barry O'Sullivan
Publisher : Springer
Page : 209 pages
File Size : 29,12 MB
Release : 2003-08-03
Category : Business & Economics
ISBN : 3540366075

GET BOOK

This book constitutes the thoroughly refereed post-proceedings of the Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, held in Cork, Ireland in June 2002. The 14 revised full papers presented were carefully selected for inclusion in the book during two rounds of reviewing and revision. Among the topics addressed are verification and debugging of constraint logic programs, modeling and solving CSPs, explanation generation, inference and inconsistency processing, SAT and 0/1 encodings of CSPs, soft constraints and constraint relaxation, real-world applications, and distributed constraint solving.

Author : Pierre Deransart
Publisher : Springer
Page : 375 pages
File Size : 25,7 MB
Release : 2006-12-31
Category : Computers
ISBN : 3540400168

GET BOOK

Coordinating production across a supply chain, designing a new VLSI chip, allocating classrooms or scheduling maintenance crews at an airport are just a few examples of complex (combinatorial) problems that can be modeled as a set of decision variables whose values are subject to a set of constraints. The decision variables may be the time when production of a particular lot will start or the plane that a maintenance crew will be working on at a given time. Constraints may range from the number of students you can ?t in a given classroom to the time it takes to transfer a lot from one plant to another.Despiteadvancesincomputingpower,manyformsoftheseandother combinatorial problems have continued to defy conventional programming approaches. Constraint Logic Programming (CLP) ?rst emerged in the mid-eighties as a programming technique with the potential of signi?cantly reducing the time it takes to develop practical solutions to many of these problems, by combining the expressiveness of languages such as Prolog with the compu- tional power of constrained search. While the roots of CLP can be traced to Monash University in Australia, it is without any doubt in Europe that this new software technology has gained the most prominence, bene?ting, among other things, from sustained funding from both industry and public R&D programs over the past dozen years. These investments have already paid o?, resulting in a number of popular commercial solutions as well as the creation of several successful European startups.

Author : Brian Mayoh
Publisher : Springer Science & Business Media
Page : 460 pages
File Size : 42,78 MB
Release : 2013-11-21
Category : Computers
ISBN : 3642859836

GET BOOK

Constraint programming is like an octopus spreading its tentacles into databases, operations research, artificial intelligence, and many other areas. The concept of constraint programming was introduced in artificial intelligence and graphics in the 1960s and 1970s. Now the related techniques are used and studied in many fields of computing. Different aspects of constraint processing are investigated in theoretical computer science, logic programming, knowledge representation, operations research, and related application domains. Constraint programming has been included in the lists of related topics of many conferences. Nevertheless, only in 1993 were the first forums held, devoted as a whole to this field of knowledge. These were the First Workshop on Principles and Practice of Constraint Programming (PPCP'93) which was held in Newport, Rhode Island, USA, April 28-30, the International Workshop on Constraint Processing (at CSAM'93) held in St. Petersburg, Russia, July 20-21, and the NATO Advanced Study Institute (NATO AS!) on Constraint Programming held in Parnu, Estonia, August 13-24. NATO A Sis are aimed to be schools bringing together leading researchers and practitioners from industry and academia in some area of knowledge to provide a concise picture of the work done and results obtained by different groups. This is intended for dissemination of advanced knowledge not yet taught regularly in of new topics university. However, ASis must also encourage the introduction into university curricula as well as foster international scientific contacts.

Author : Alan H. Borning
Publisher : Springer Science & Business Media
Page : 382 pages
File Size : 25,26 MB
Release : 1994-10-12
Category : Computers
ISBN : 9783540586012

GET BOOK

This volume is the proceedings of the Second International Workshop on the Principles and Practice of Constraint Programming, held at Rosario, Orcas Island, Washington, USA in May 1994 in cooperation with AAAI and ALP. The volume contains 27 full revised papers selected from 87 submissions as well as a summary of a panel session on commercial applications of constraint programming. The contributions cover a broad range of topics including constraint programming languages, algorithms for constraint satisfaction and entailment, and constraints and their relation to fields such as artificial intelligence, databases, operations research, problem solving, and user interfaces.

Author : Radhia Cousot
Publisher : Springer Science & Business Media
Page : 408 pages
File Size : 46,58 MB
Release : 1996-09-11
Category : Computers
ISBN : 9783540617396

GET BOOK

This book constitutes the refereed proceedings of the Third International Static Analysis Symposium, SAS '96, held in Aachen, Germany, in September 1996 in conjunction with ALP and PLILP. The volume presents 22 highly-quality revised full papers selected from a total of 79 submissions; also included are three system descriptions and invited contributions by Alex Aiken (abstract only), Flemming Nielson, and Bernhard Steffen. Among the topics addressed are program analysis, incremental analysis, abstract interpretation, partial evaluation, logic programming, functional programming, and constraint programming.

Author : Ranjit Jhala
Publisher : Springer Science & Business Media
Page : 430 pages
File Size : 33,1 MB
Release : 2011-01-11
Category : Computers
ISBN : 3642182747

GET BOOK

This book constitutes the refereed proceedings of the 12th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2011, held in Austin, TX, USA, in January 2011, co-located with the Symposium on Principles of Programming Languages, POPL 2011. The 24 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 71 initial submissions. The papers showcases state-of-the-art research in areas such as verification, model checking, abstract interpretation and address any programming paradigm, including concurrent, constraint, functional, imperative, logic and object-oriented programming. Further topics covered are static analysis, deductive methods, program certification, debugging techniques, abstract domains, type systems, and optimization.