Principles and Practice of Constraint Programming – CP’99 | Zendy

Joxan Jaffar | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Principles and Practice of Constraint Programming – CP’99

Author(s) -

Joxan Jaffar

Publication year - 1999

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/b72297

Subject(s) - computer science , constraint programming , programming language , constraint (computer aided design) , constraint satisfaction , theoretical computer science , mathematical optimization , artificial intelligence , mathematics , stochastic programming , geometry , probabilistic logic

We provide here a simple, yet very general framework that allows us to explain several constraint propagation algorithms in a systematic way. In particular, using the notions commutativity and semi-commutativity, we show how the well-known AC-3, PC-2, DAC and DPC algorithms are instances of a single generic algorithm. The work reported here extends and simplifies that of Apt [1].

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research