Switch to: References

Add citations

You must login to add citations.
  1. Compiling constraint satisfaction problems.Rainer Weigel & Boi Faltings - 1999 - Artificial Intelligence 115 (2):257-287.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Backtracking algorithms for disjunctions of temporal constraints.Kostas Stergiou & Manolis Koubarakis - 2000 - Artificial Intelligence 120 (1):81-117.
  • Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem.Norman Sadeh & Mark S. Fox - 1996 - Artificial Intelligence 86 (1):1-41.
  • An empirical study of phase transitions in binary constraint satisfaction problems.Patrick Prosser - 1996 - Artificial Intelligence 81 (1-2):81-109.
  • Combining qualitative and quantitative constraints in temporal reasoning.Itay Meiri - 1996 - Artificial Intelligence 87 (1-2):343-385.
  • Backjump-based backtracking for constraint satisfaction problems.Rina Dechter & Daniel Frost - 2002 - Artificial Intelligence 136 (2):147-188.
  • An optimal backtrack algorithm for tree-structured constraint satisfaction problems.Roberto J. Bayardo & Daniel P. Miranker - 1994 - Artificial Intelligence 71 (1):159-181.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation