Show simple item record

dc.contributor.authorChoi, CW
dc.contributor.authorLee, JHM
dc.contributor.authorStuckey, PJ
dc.date.available2014-05-21T22:46:31Z
dc.date.issued2007-01-01
dc.identifierhttp://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000249658400005&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=d4d813f4571fa7d6246bdc0dfeca3a1c
dc.identifierARTN 23
dc.identifier.citationChoi, C. W., Lee, J. H. M. & Stuckey, P. J. (2007). Removing propagation redundant constraints in redundant modeling. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 8 (4), https://doi.org/10.1145/1276920.1276925.
dc.identifier.issn1529-3785
dc.identifier.urihttp://hdl.handle.net/11343/29248
dc.description.abstractA 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 speed up search by several order of magnitudes.
dc.languageEnglish
dc.publisherASSOC COMPUTING MACHINERY
dc.subjectArtificial Intelligence and Image Processing
dc.titleRemoving propagation redundant constraints in redundant modeling
dc.typeJournal Article
dc.identifier.doi10.1145/1276920.1276925
melbourne.peerreviewPeer Reviewed
melbourne.affiliationThe University of Melbourne
melbourne.affiliation.departmentComputer Science and Software Engineering
melbourne.source.titleACM Transactions on Computational Logic
melbourne.source.volume8
melbourne.source.issue4
dc.description.pagestart1
melbourne.publicationid85483
melbourne.elementsid293434
melbourne.contributor.authorStuckey, Peter
melbourne.internal.ingestnoteAbstract bulk upload (2017-07-20)
dc.identifier.eissn1557-945X
melbourne.accessrightsThis item is currently not available from this repository


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record