Switch to: References

Add citations

You must login to add citations.
  1. The complexity of soft constraint satisfaction.David A. Cohen, Martin C. Cooper, Peter G. Jeavons & Andrei A. Krokhin - 2006 - Artificial Intelligence 170 (11):983-1016.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • No more “Partial” and “Full Looking Ahead”.Edward Tsang - 1998 - Artificial Intelligence 98 (1-2):351-361.
    Download  
     
    Export citation  
     
    Bookmark  
  • Using constraint metaknowledge to reduce arc consistency computation.Christian Bessiére, Eugene C. Freuder & Jean-Charles Regin - 1999 - Artificial Intelligence 107 (1):125-148.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints.Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan & Toby Walsh - 2009 - Artificial Intelligence 173 (11):1054-1078.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Constraint propagation techniques for the disjunctive scheduling problem.Ulrich Dorndorf, Erwin Pesch & Toàn Phan-Huy - 2000 - Artificial Intelligence 122 (1-2):189-240.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Fast parallel constraint satisfaction.Lefteris M. Kirousis - 1993 - Artificial Intelligence 64 (1):147-160.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Constraints, consistency and closure.Peter Jeavons, David Cohen & Martin C. Cooper - 1998 - Artificial Intelligence 101 (1-2):251-265.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • STR3: A path-optimal filtering algorithm for table constraints.Christophe Lecoutre, Chavalit Likitvivatanavong & Roland H. C. Yap - 2015 - Artificial Intelligence 220 (C):1-27.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Arc-consistency and arc-consistency again.Christian Bessière - 1994 - Artificial Intelligence 65 (1):179-190.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Characterising tractable constraints.Martin C. Cooper, David A. Cohen & Peter G. Jeavons - 1994 - Artificial Intelligence 65 (2):347-361.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Image interpretation with a conceptual graph: Labeling over-segmented images and detection of unexpected objects.Aline Deruyver, Yann Hodé & Luc Brun - 2009 - Artificial Intelligence 173 (14):1245-1265.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Constraint satisfaction problem with bilevel constraint: application to interpretation of over-segmented images.A. Deruyver & Y. Hodé - 1997 - Artificial Intelligence 93 (1-2):321-335.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Backjump-based backtracking for constraint satisfaction problems.Rina Dechter & Daniel Frost - 2002 - Artificial Intelligence 136 (2):147-188.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • An optimal coarse-grained arc consistency algorithm.Christian Bessière, Jean-Charles Régin, Roland H. C. Yap & Yuanlin Zhang - 2005 - Artificial Intelligence 165 (2):165-185.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Tractable constraints on ordered domains.Peter G. Jeavons & Martin C. Cooper - 1995 - Artificial Intelligence 79 (2):327-339.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Decomposable constraints☆☆Supported by EPSRC award GR/L/24014. The authors wish to thank other members of the APES research group.Ian Gent, Kostas Stergiou & Toby Walsh - 2000 - Artificial Intelligence 123 (1-2):133-156.
    Download  
     
    Export citation  
     
    Bookmark