Removing Propagation Redundant Constraints in Redundant Modeling

Simple item page
dc.creatorChoi, Chiu Wo
dc.creatorLee, Jimmy Ho-Man
dc.creatorStuckey, Peter J.
dc.date2004-12-07
dc.date.accessioned2026-07-07T03:22:09Z
dc.date.available2026-07-07T03:22:09Z
dc.descriptionA widely adopted approach to solving constraint satisfaction problems combines systematic tree search with various degrees of constraint propagation for pruning the search space. One common technique to improve the execution efficiency is to add redundant constraints, which are constraints logically implied by others in the problem model. However, some redundant constraints are propagation redundant and hence do not contribute additional propagation information to the constraint solver. Redundant constraints arise naturally in the process of redundant modeling where two models of the same problem are connected and combined through channeling constraints. In this paper, we give general theorems for proving propagation redundancy of one constraint with respect to channeling constraints and constraints in the other model. We illustrate, on problems from CSPlib (http://www.csplib.org/), how detecting and removing propagation redundant constraints in redundant modeling can significantly speed up constraint solving.
dc.description30 pages, submitted to ACM Transactions on Computational Logic (TOCL)
dc.identifierhttps://arxiv.org/abs/cs/0412026
dc.identifierhttp://arxiv.org/abs/cs/0412026
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32483
dc.subjectLogic in Computer Science
dc.subjectArtificial Intelligence
dc.subjectD.3.3; F.4.1
dc.titleRemoving Propagation Redundant Constraints in Redundant Modeling
dc.typetext

Files

Collections

arXiv