Efficient solution techniques for disjunctive temporal reasoning problems

Artificial Intelligence

Volumn 151, Issue 1-2, 2003, Pages 43-89

  Tsamardinos, Ioannis ^a   Pollack, Martha E ^b  

^a VANDERBILT UNIVERSITY MEDICAL CENTER   (United States)

^b NONE

Author keywords

Constraint satisfaction; Constraint based temporal reasoning; Planning; Scheduling

Indexed keywords

ALGORITHMS; BENCHMARKING; PLANNING; PROBLEM SOLVING; SCHEDULING; SEMANTICS;

CONSTRAINT-BASED TEMPORAL REASONING;

ARTIFICIAL INTELLIGENCE;

EID: 0242334187     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(03)00113-9     Document Type: Article

References (34)

1. Armando A., Castellini C., Giunchiglia E. SAT-based procedures for temporal reasoning. Proc. 5th European Conference on Planning (ECP-99), Durham. Lecture Notes in Computer Science. 1809:1999;97-108 Springer, Berlin.
2. Barber F. Reasoning on interval and point-based disjunctive metric constraints in temporal contexts. J. Artificial Intelligence Res. 12:2000;35-86.
3. Bessière C. Non-binary constraints. Principles and Practice of Constraint Programming (CP'99), Alexandria, VA. 1999;Springer, Berlin.
4. Bessière C., Mesequer P., Larrosa J., Freuder E. On forward-checking for non-binary constraint satisfaction. Proc. CP'99, Alexandria, VA. 1999.
5. Bessière C., Regin J.C. Arc consistency for general constraint networks: Preliminary results. Proc. IJCAI-97, Nagoya, Japan. 1997.
6. Chen X., van Beek P. Conflict-directed backjumping revisited. J. Artificial Intelligence Res. 14:2001;53-81.
7. C. Cheng, S.F. Smith, Applying constraint satisfaction techniques to job-shop scheduling, Technical Report CMU-RI-TR-95-03, Carnegie Mellon University, Pittsburgh, PA, 1995.
8. Cheng C., Smith S.F. A constraint posting framework for scheduling under complex constraints. Proc. Joint IEEE/INRIA Conference on Emerging Technologies for Factory Automation, Paris, France. 1995.
9. Chleq N. Efficient algorithms for networks of quantitative temporal constraints. Constraints'95. 1995.
10. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;MIT Press, Cambridge, MA.
11. Dechter R. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence. 41:1990;273-312.
12. R. Dechter, D. Frost, Backtracking algorithms for constraint satisfaction problems, Technical Report, University of California at Irvine, 1999.
13. Dechter R., Meiri I., Pearl J. Temporal constraint networks. Artificial Intelligence. 49:1991;61-95.
14. Frost D., Dechter R. Dead-end driven learning. Proc. AAAI-94, Seattle, WA. 1994.
15. Ginsberg M. Dynamic backtracking. J. Artificial Intelligence Res. 1:1993;25-46.
16. Ginsberg M., McAllester D. GSAT and dynamic backtracking. Proc. KR-94, Bonn. 1994;226-237.
17. Gomez C.P., Selman B., Kautz H. Boosting combinatorial search through randomization. Proc. AAAI-98, Madison, WI. 1998.
18. Meiri I. Combining qualitative and quantitative constraints in temporal reasoning. Proc. AAAI-91, Anaheim, CA. 1991.
19. Mohr R., Henderson T.C. Arc-consistency and path-consistency revisited. Artificial Intelligence. 28:1986;225-233.
20. Oddi A., Cesta A. Incremental forward checking for the disjunctive temporal problem. Proc. European Conference on Artificial Intelligence, Berlin. 2000.
21. Pollack M.E. Planning technology for intelligent cognitive orthotics. Proc. 6th International Conference on AI Planning and Scheduling. 2002.
22. Pollack M.E., Horty J.F. There's more to life than making plans: Plan management in dynamic environments. AI Magazine. 20:(4):1999;71-83.
23. Prosser P. Hybrid algorithms for the constraint satisfaction problem. Comput. Intelligence. 9:1993;268-299.
24. E.T. Richards, Non-systematic search and no-good learning, Ph.D. Thesis, IC Parc. London, Imperial College, 1998.
25. Bayardo R.J., Schrag R.C. Using CSP look-back techniques to solve real-world SAT instances. Proc. AAAI-97, Providence, RI. 1977.
26. Schiex T., Verfaillie G. Nogood recording for static and dynamic constraint satisfaction problems. Internat. J. Artificial Intelligence Tools. 3:(2):1994;187-200.
27. Schiex T., Verfaillie G. Stubbornness: A possible enhancement for backjumping and no-good recording. Proc. European Conference in Artificial Intelligence (ECAI-94), Amsterdam. 1994.
28. Staab S. On non-binary temporal relations. Proc. European Conference on Artificial Intelligence, Brighton. 1998.
29. Stergiou K., Koubarakis M. Backtracking algorithms for disjunctions of temporal constraints. Proc. AAAI-98, Madison, WI. 1998.
30. Stergiou K., Koubarakis M. Backtracking algorithms for disjunctions of temporal constraints. Artificial Intelligence. 120:(1):2000;81-117.
31. I. Tsamardinos, Reformulating temporal plans for efficient execution, Masters Thesis, University of Pittsburgh, Pittsburgh, PA, 1998.
32. I. Tsamardinos, Constraint-based temporal reasoning algorithms with applications to planning, Ph.D. Thesis, Computer Science Department, University of Pittsburgh, Pittsburgh, PA, 2001.
33. Tsamardinos I., Vidal T., Pollack M.E. CTP: A new constraint-based formalism for conditional, temporal planning. Constraints. 8:2003;. to appear.
34. Yokoo M. Weak-commitment search for solving constraint satisfaction problems. Proc. AAAI-94, Seattle, WA. 1994.