Full metadata record
DC FieldValueLanguage
dc.contributor.authorChoi, Chiu Wo-
dc.description.abstractA widely adopted approach to solving constraint satisfaction problems combines backtracking 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 and may offer extra information to enhance constraint propagation. However, some redundant constraints are propagation redundant and hence do not contribute additional propagation information to the constraint solver. In this thesis, we propose propagation rules as a tool to compare the propagation strength of constraints, and establish results relating logical and propagation redundancy. Redundant constraints arise naturally in the process of redundant modeling, where two models of the same problem are connected and combined through channeling constraints. We characterize channeling constraints in terms of restrictive and unrestrictive channel function and give general theorems for proving propagation redundancy of constraints in the combined model. We illustrate, on problems from CSPLib, how detecting and re-moving propagation redundant constraints can often significantly speed up constraint-solving.
dc.publisherThe Hong Kong University of Science and Technology
dc.relation.ispartofseriesDoctor of Philosophy
dc.subjectTin học
dc.titlePropagation redundancy in finite domain constraint satisfaction
Appears in Collections
CL – ProQuest

  • 3222669.PDF
    • Size : 4,86 MB

    • Format : Adobe PDF

    • Views : 
    • Downloads :