Switch to: References

Add citations

You must login to add citations.
  1. Reasoning about qualitative temporal information.Peter van Beek - 1992 - Artificial Intelligence 58 (1-3):297-326.
  • Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard.Bernd S. W. Schröder - 2001 - Artificial Intelligence 132 (1):105-117.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • A theoretical evaluation of selected backtracking algorithms.Grzegorz Kondrak & Peter van Beek - 1997 - Artificial Intelligence 89 (1-2):365-387.
  • The combinatorics of object recognition in cluttered environments using constrained search.W. Eric L. Grimson - 1990 - Artificial Intelligence 44 (1-2):121-165.
  • Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.
  • Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
  • Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition.Rina Dechter - 1990 - Artificial Intelligence 41 (3):273-312.
  • Experimental evaluation of preprocessing algorithms for constraint satisfaction problems.Rina Dechter & Itay Meiri - 1994 - Artificial Intelligence 68 (2):211-241.
  • Backjump-based backtracking for constraint satisfaction problems.Rina Dechter & Daniel Frost - 2002 - Artificial Intelligence 136 (2):147-188.