Abstract Domains in Constraint Programming 9781785480102

Варианты приобретения

Цена: 53010.00T
Кол-во:
о цене
Наличие: Невозможна поставка.

в Мои желания

Автор: Marie Pelleau
Название: Abstract Domains in Constraint Programming
ISBN: 9781785480102
Издательство: Elsevier Science
Классификация:

Оптимизация

Технология разработки программного обеспечения

Теория вычислительных машин и систем, кибернетика

Искусственный интеллект

Экспертные системы / системы баз знаний

ISBN-10: 1785480103
Обложка/Формат: Hardback
Страницы: 176
Вес: 0.41 кг.
Дата издания: 06.05.2015
Серия: Eng Electronics
Язык: English
Иллюстрации: Colour illustrations
Размер: 238 x 159 x 20
Читательская аудитория: Professional & vocational
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Европейский союз
Описание: 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.

Abstract Domains in Constraint Programming, Marie Pelleau