Partial constraint satisfaction of disjunctive temporal problems

Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005 - Recent Advances in Artifical Intelligence

Volumn , Issue , 2005, Pages 715-720

  Moffitt, Michael D ^a   Pollack, Martha E ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

METADATA; PROBLEM SOLVING;

DISJUNCTIVE TEMPORAL PROBLEMS (DTP); META-CSP APPROACH; OVERCONSTRAINED INSTANCES; PRUNING TECHNIQUES;

CONSTRAINT THEORY;

EID: 32844456699     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Armando, A.; Castellini, C.; Giunchiglia, E.; and Maratea, M. 2004. A SAT-based decision procedure for the boolean combination of difference constraints. In Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing (SAT-2004).
2. Armando, A.; Castellini, C.; and Giunchiglia, E. 1999. SAT-based procedures for temporal reasoning. In Proceedings of the 5th European Conference on Planning (ECP-1999), 97-108.
3. Beaumont, M.; Sattar, A.; Maher, M.; and Thornton, J. 2001. Solving overconstrained temporal reasoning problems. In Proceedings of the 14th Australian Joint Conference on Artificial Intelligence (AI-2001), 37-49.
4. Beaumont, M.; Thornton, J.; Sattar, A.; and Maher, M. 2004. Solving over-constrained temporal reasoning problems using local search. In Proceedings of the 8th Pacific Rim Conference on Artificial Intelligence (PRICAI-2004).
5. Choueiry, B. Y., and Xu, L. 2004. An efficient consistency algorithm for the temporal constraint satisfaction problem. AI Communications 17(4):213-221.
6. Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal constraint networks. Artificial Intelligence 49(1-3):61-95.
7. Freuder, E. C., and Wallace, R. J. 1992. Partial constraint satisfaction. Artificial Intelligence 58(1-3):21-70.
8. Harvey, W. D., and Ginsberg, M. L. 1995. Limited discrepancy search. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), 607-615.
9. Mouhoub, M. 2001. Analysis of approximation algorithms for maximal temporal constraint satisfaction problems. In The 2001 International Conference on Artificial Intelligence (ICAI-2001), 165-171.
10. Oddi, A., and Cesta, A. 2000. Incremental forward checking for the disjunctive temporal problem. In Proceedings of the 14th European Conference on Artificial Intelligence (ECAI-2000), 108-112.
11. Peintner, B., and Pollack, M. E. 2004. Low-cost addition of preferences to DTPs and TCSPs. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-2004), 723-728.
12. Stergiou, K., and Koubarakis, M. 1998. Backtracking algorithms for disjunctions of temporal constraints. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), 248-253.
13. Tsamardinos, I., and Pollack, M. E. 2003. Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence 151(1-2):43-90.
14. Tsamardinos, I.; Vidal, T.; and Pollack, M. E. 2003. CTP: A new constraint-based formalism for conditional, temporal planning. Constraints 8(4):365-388.
15. Vidal, T., and Fargier, H. 1999. Handling contingency in temporal constraint networks: From consistency to controllabilities. Journal of Experimental and Theoretical Artificial Intelligence 11(1):23-45.