Switch to: Citations

Add references

You must login to add references.
  1. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems.Alan K. Mackworth & Eugene C. Freuder - 1985 - Artificial Intelligence 25 (1):65-74.
    Download  
     
    Export citation  
     
    Bookmark   71 citations  
  • Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
    Download  
     
    Export citation  
     
    Bookmark   55 citations  
  • Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition.Rina Dechter - 1990 - Artificial Intelligence 41 (3):273-312.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • REF-ARF: A system for solving problems stated as procedures.Richard E. Fikes - 1970 - Artificial Intelligence 1 (1-2):27-120.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Tree clustering for constraint networks.Rina Dechter & Judea Pearl - 1989 - Artificial Intelligence 38 (3):353-366.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • On seeing things.M. B. Clowes - 1971 - Artificial Intelligence 2 (1):79-116.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • Arc and path consistency revisited.Roger Mohr & Thomas C. Henderson - 1986 - Artificial Intelligence 28 (2):225-233.
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • On the parallel complexity of discrete relaxation in constraint satisfaction networks.Simon Kasif - 1990 - Artificial Intelligence 45 (3):275-286.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
    Download  
     
    Export citation  
     
    Bookmark   109 citations