Improving backtrack search for solving the TCSP

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

Volumn 2833, Issue , 2003, Pages 754-768

  Xu, Lin ^a   Choueiry, Berthe Y ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

ARTICULATION POINTS; BACKTRACK SEARCH; EXPONENTIAL TIME; FILTERING ALGORITHM; PRE-PROCESSING STEP; SIMPLE TEMPORAL PROBLEMS; TEMPORAL CONSTRAINT SATISFACTION PROBLEMS; TEMPORAL NETWORKS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 21144440503     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_51     Document Type: Article

References (22)

1. th IJCAI, pages 309-315, 2001.
2. th IJCAI, pages 456-461, 1999.
3. B.Y. Choueiry and A.M. Davis. Dynamic Bundling: Less Effort for More Solutions. In Koenig and Holte, editors, 5th International Symposium on Abstraction, Reformulation and Approximation (SARA 2002), vol 2371 of LNAI, pages 64-82. Springer Verlag, 2002.
4. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. McGraw-Hill Book Co & MIT Press, 2001.
5. R. Dechter. Constraint Programming. Morgan Kaufmann, 2003.
6. R. Dechter, I. Meiri, and J. Pearl. Temporal Constraint Networks. Artificial Intelligence, 49:61-95, 1991.
7. R. Dechter and J. Pearl. Network-Based Heuristics for Constraint-Satisfaction Problems. Artificial Intelligence, 34:1-38, 1987.
8. R. Dechter and J. Pearl. The Cycle-Cutset Method for improving Search Performance in AI Applications. In Third IEEE Conference on AI Applications, pages 224-230, 1987.
9. S. Even. Graph Algorithm. Computer Science Press, 1979.
10. E.C. Freuder. A Sufficient Condition for Backtrack-Free Search. JACM, 29 (1):24-32, 1982.
11. E.C. Freuder. A Sufficient Condition for Backtrack-Bounded Search. JACM, 32 (4):755-761, 1985.
12. E.C. Freuder and P.D. Hubbe. A Disjunctive Decomposition Control Schema for Constraint Satisfaction. In Vijay Saraswat and Pascal Van Hentenryck, editors, Principles and Practice of Constraint Programming, pages 319-335. MIT Press, 1995.
13. R.M. Haralick and G.L. Elliott. Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence, 14:263-313, 1980.
14. R. Mohr and T.C. Henderson. Arc and Path Consistency Revisited. Artificial Intelligence, 28:225-233, 1986.
15. U. Montanari. Networks of Constraints: Fundamental Properties and Application to Picture Processing. Information Sciences, 7:95-132, 1974.
16. th ECAI, 2000.
17. U. Kjærulff. Triagulation of Graphs - Algorithms Giving Small Total State Space. Research Report R-90-09, Aalborg University, Denmark, 1990.
18. E. Schwalb and R. Dechter. Processing Disjunctions in Temporal Constraint Networks. Artificial Intelligence, 93:29-61, 1997.
19. K. Stergiou and M. Koubarakis. Backtracking Algorithms for Disjunctions of Temporal Constraints. Artificial Intelligence, 12-(1):81-117, 2000.
20. I. Tsamardinos and M.E. Pollack. Efficient Solution Techniques for Disjunctive Temporal Reasoning Problems. Artificial Intelligence, 2003. In press.
21. th TIME-ICTL, 2003. IEEE Computer Society Press.
22. L. Xu and B.Y. Choueiry. An Approximation of Generalized Arc-Consistency for TCSPs. In Working notes of the Workshop on Spatial and Temporal Reasoning (IJCAI 03), 2003.