Propagation in constraints: How one thing leads to another

Ian P. Gent*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

At a conference such as CPAIOR, we have experts from many different approaches to searching huge combinatorial spaces. Much of what we all do is common, for example similar search methods, heuristics, and learning techniques. So what is it that is essentially different about Constraint Programming in particular? One answer is the power and diversity of constraint propagation algorithms. By contrast, other search disciplines often rely on just one propagation technique, such as unit propagation in SAT.

Original languageEnglish
Title of host publicationIntegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 8th International Conference, CPAIOR 2011, Proceedings
EditorsJ. Christopher Beck, Tobias Achterberg
PublisherSpringer-Verlag
Pages2
Number of pages1
ISBN (Print)9783642213106
DOIs
Publication statusPublished - 2011
Event8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2011 - Berlin, Germany
Duration: 23 May 201127 May 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6697 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2011
Country/TerritoryGermany
CityBerlin
Period23/05/1127/05/11

Fingerprint

Dive into the research topics of 'Propagation in constraints: How one thing leads to another'. Together they form a unique fingerprint.

Cite this