The Rough Guide to Constraint Propagation

Simple item page
dc.creatorApt, Krzysztof R.
dc.date1999-09-08
dc.date.accessioned2026-07-07T03:24:20Z
dc.date.available2026-07-07T03:24:20Z
dc.descriptionWe 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, cs.AI/9811024.
dc.description23 pages. To appear in the Proc. 5th International Conference on Principles and Practice of Constraint Programming as an invited talk
dc.identifierhttps://arxiv.org/abs/cs/9909009
dc.identifierhttp://arxiv.org/abs/cs/9909009
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33288
dc.subjectArtificial Intelligence
dc.subjectProgramming Languages
dc.subjectD.3.3; I.1.2; I.2.2
dc.titleThe Rough Guide to Constraint Propagation
dc.typetext

Files

Collections

arXiv