Ways of maintaining arc consistency in search using the cartesian representation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1865, Issue , 2000, Pages 173-187

  Silaghi, Marius Călin ^a   Haroud, Djamila Sam ^a   Faltings, Boi ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGORITHM FOR SOLVING; ALL SOLUTIONS; BACKTRACKING ALGORITHM; CARTESIAN PRODUCTS; CARTESIAN REPRESENTATION; HARD PROBLEMS; MAINTAINING ARC CONSISTENCIES; SEARCH SPACES;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35048833482     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44654-0_9     Document Type: Conference Paper

References (11)

1. Bessiére C, Freuder E.C., and Régin J.-C.: Using constraint metaknowledge to reduce arc consistency computation. AI, (107):125-148, 99.
2. Bessiére C. and Régin J.-C.: MAC and combined heuristics: Two reasons to forsake FC(and CBJ?) on hard problems. In CP96, pages 61-75. CP, 96.
3. Bliek C.: Generalizing partial order and dynamic backtracking. In AAAI-98 Proceedings, pages 319-325, Madison,Wisconsin, July 98. AAAI.
4. Choueiry B.Y. and Noubir G.: On the computation of local interchangeability in discrete constraint satisfaction problems. Technical Report KSL-98-24, Standford, 98.
5. Freuder E.C.: Eliminating interchangeable values in constraint satisfaction problems. In Proceedings of AAAI'91, pages 227-233, 91.
6. Ginsberg M. and McAllester D.: Gsat and dynamic backtracking. In J.Doyle, editor, Proceedings of the 4th IC on PKRR, pages 226-237. KR, 94.
7. Haselböck A.: Exploiting interchangeabilities in constraint satisfaction problems. In Proceedings of IJCAI'93, pages 282-287, 93.
8. Hubbe P.D. and Freuder E.C.: An ecient cross product representation of the constraint satisfaction problem search space. In Proc. of AAAI-92, pages 421-427, July 92.
9. Kondrak G.: A theoretical evaluation of selected backtracking algorithms. Master's thesis, Univ. of Alberta, 94.
10. Lesaint D.: Maximal Sets of Solutions for Constraint Satisfaction Problems. In A. Cohn, editor, Proceedings of ECAI'94, pages 110-114. John Wiley & Sons,Ltd, 94.
11. Sabin D. and Freuder E.C.: Contradicting conventional wisdom in constraint satisfaction. In Proceedings ECAI-94, pages 125-129, 94.