University Library
  • Login
A gateway to Melbourne's research publications
Minerva Access is the University's Institutional Repository. It aims to collect, preserve, and showcase the intellectual output of staff and students of the University of Melbourne for a global audience.
View Item 
  • Minerva Access
  • Engineering and Information Technology
  • Computing and Information Systems
  • Computing and Information Systems - Research Publications
  • View Item
  • Minerva Access
  • Engineering and Information Technology
  • Computing and Information Systems
  • Computing and Information Systems - Research Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

    Removing propagation redundant constraints in redundant modeling

    Thumbnail
    Citations
    Scopus
    Web of Science
    Altmetric
    11
    6
    Author
    Choi, CW; Lee, JHM; Stuckey, PJ
    Date
    2007-01-01
    Source Title
    ACM Transactions on Computational Logic
    Publisher
    ASSOC COMPUTING MACHINERY
    University of Melbourne Author/s
    Stuckey, Peter
    Affiliation
    Computer Science and Software Engineering
    Metadata
    Show full item record
    Document Type
    Journal Article
    Citations
    Choi, 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.
    Access Status
    This item is currently not available from this repository
    URI
    http://hdl.handle.net/11343/29248
    DOI
    10.1145/1276920.1276925
    Abstract
    <jats:p> A 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 <jats:italic>propagation redundant</jats:italic> 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. </jats:p>
    Keywords
    Artificial Intelligence and Image Processing

    Export Reference in RIS Format     

    Endnote

    • Click on "Export Reference in RIS Format" and choose "open with... Endnote".

    Refworks

    • Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References


    Collections
    • Minerva Elements Records [52443]
    • Computing and Information Systems - Research Publications [1565]
    Minerva AccessDepositing Your Work (for University of Melbourne Staff and Students)NewsFAQs

    BrowseCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects
    My AccountLoginRegister
    StatisticsMost Popular ItemsStatistics by CountryMost Popular Authors