• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Short and Long Supports for Constraint Propagation

Cached

  • Download as a PDF

Download Links

  • [www.cs.st-andrews.ac.uk]
  • [www.dcs.st-and.ac.uk]
  • [www.cs.st-andrews.ac.uk]
  • [www.jair.org]
  • [jair.org]
  • [pn.host.cs.st-andrews.ac.uk]
  • [pn.host.cs.st-andrews.ac.uk]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Peter Nightingale , Ian P. Gent , Christopher Jefferson , Ian Miguel
Citations:3 - 1 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Nightingale_shortand,
    author = {Peter Nightingale and Ian P. Gent and Christopher Jefferson and Ian Miguel},
    title = {Short and Long Supports for Constraint Propagation},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Special-purpose constraint propagation algorithms frequently make implicit use of short supports — by examining a subset of the variables, they can infer support (a justification that a variable-value pair may still form part of an assignment that satisfies the constraint) for all other variables and values and save substantial work – but short supports have not been studied in their own right. The two main contributions of this paper are the identification of short supports as important for constraint propagation, and the introduction of HaggisGAC, an efficient and effective general purpose propagation algorithm for exploiting short supports. Given the complexity of HaggisGAC, we present it as an optimised version of a simpler algorithm ShortGAC. Although experiments demonstrate the efficiency of ShortGAC compared with other general-purpose propagation algorithms where a compact set of short supports is available, we show theoretically and experimentally that HaggisGAC is even better. We also find that HaggisGAC performs better than GAC-Schema on full-length supports. We also introduce a variant algorithm HaggisGAC-Stable, which is adapted to avoid work on backtracking and in some cases can be faster and have significant reductions in memory use. All the proposed algorithms are excellent for propagating disjunctions of constraints. In all experiments with disjunctions we found our algorithms to be faster than Constructive Or and GAC-Schema by at least an order of magnitude, and up to three orders of magnitude. 1.

Keyphrases

short support    constraint propagation    long support    significant reduction    substantial work    implicit use    simpler algorithm shortgac    memory use    variant algorithm haggisgac-stable    special-purpose constraint propagation    general-purpose propagation algorithm    full-length support    effective general purpose propagation algorithm    optimised version    variable-value pair    compact set    main contribution   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University