Finite Domain Bounds Consistency Revisited

Simple item page
dc.creatorChoi, Chiu Wo
dc.creatorHarvey, Warwick
dc.creatorLee, Jimmy Ho-Man
dc.creatorStuckey, Peter J.
dc.date2004-12-06
dc.date.accessioned2026-07-07T03:22:08Z
dc.date.available2026-07-07T03:22:08Z
dc.descriptionA widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagation is performed by propagators implementing a certain notion of consistency. Bounds consistency is the method of choice for building propagators for arithmetic constraints and several global constraints in the finite integer domain. However, there has been some confusion in the definition of bounds consistency. In this paper we clarify the differences and similarities among the three commonly used notions of bounds consistency.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/cs/0412021
dc.identifierhttp://arxiv.org/abs/cs/0412021
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32480
dc.subjectArtificial Intelligence
dc.subjectLogic in Computer Science
dc.titleFinite Domain Bounds Consistency Revisited
dc.typetext

Files

Collections

arXiv