Handling contingency in temporal constraint networks: From consistency to controllabilities

Journal of Experimental and Theoretical Artificial Intelligence

Volumn 11, Issue 1, 1999, Pages 23-45

  Vidal, Thierry ^a   Fargier, HÉLÉNE ^a  

^a IRIT   (France)

Author keywords

Temporal constraints uncertainty planning and scheduling dynamic domains tractability issues

Indexed keywords

EID: 0442314380     PISSN: 0952813X     EISSN: 13623079     Source Type: Journal    
DOI: 10.1080/095281399146607     Document Type: Article

References (35)

1. Allen, J., 1983, Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11): 509-521.
2. Alur, R., and Dill, D., 1994, A theory of timed automata. Theoretical Computer Science, 126: 183-235.
3. Bessie re, C., Isli, A., and Ligozat, G., 1996, Global consistency in interval algebra networks: tractable subclasses. Proceedings of the 12th European Conference on Artificial Intelligence (ECAI-96), Budapest, Hungary, pp. 3-7.
4. Brusoni, V., Console, L., Pernici, B., and Terenziani, P., 1994, LaTeR: a general purpose manager of temporal information. Methodologies for Intelligent Systems 8, Lecture Notes in Computer Science, Vol. 869 (Berlin: Springer Verlag), pp. 255-264.
5. Cervoni, R., Cesta, A., and Oddi, A., 1994, Managing dynamical temporal constraint networks. Proceedings of the 2nd International Conference on AI Planning Systems (AIPS-94), Chicago, Illinois, USA, pp. 13-17.
6. Dean, T., and McDermott, D., 1987, Temporal data-base management. Artificial Intelligence, 32: 1-55.
7. Dechter, R., Meiri, I., and Pearl, J., 1991, Temporal constraint networks. Artificial Intelligence, 49: 1-95.
8. Dorn, J., 1994, Hybrid temporal reasoning. Proceedings of the 11th European Conference on Artificial Intelligence (ECAI-94), Amsterdam, Netherlands, pp. 625-629.
9. Dousson, C., Gaborit, P., and Ghallab, M., 1993, Situation recognition: representation and algorithms. Proceedings of the 13th International Joint Conference on AI (IJCAI-93), Chambe'ry, France.
10. Drabble, B., and Kirby, R., 1991, Associating AI planner entities with an underlying time point network. Proceedings of the 1st European WorkShop on Planning (EWSP-91), Sankt Augustin, Germany, pp. 27-38.
11. Drakengren, T., and Jonsson, P., 1997, Eight maximal subclasses of Allen's interval algebra with metric time. Journal of Artificial Intelligence Research (JAIR), 7: 25-45.
12. Dubois, D., Fargier, H., and Prade, H., 1993, The use of fuzzy constraints in job-shop scheduling. IJCAI-93 Workshop on Knowledge-Based Planning, Scheduling and Control, Chambery, France.
13. Fargier, H., Jourdan, M., Laya'ida, N., and Vidal, T., 1998, Using temporal constraint networks to manage temporal scenario of multimedia documents. ECAI-98 Workshop on Spatio-Temporal Reasoning, Brighton, UK.
14. Fargier, H., Lang, J., and Schiex, T., 1996, Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge. Proceedings of the 12th National Conference on AI (AAAI-96), Portland, Oregon, USA, pp. 175-180.
15. Freuder, E., 1978, Synthetizing constraint expressions. Communications of the ACM, 21(11): 958-966.
16. Frhhwirth, T., Herold, A., Kiichenhoff, V., Provost, T. L., Lim, P., Monfroy, E., and Wallace, M., 1992, Constraint logic programming-an informal introduction. Chapter in Logic Programming in Action, edited by G. Comya et al., Lecture Notes in Computer Science, Vol. 636 (Berlin: Springer Verlag).
17. Garey, M., and Johnson, D., 1979, Computers and Intractability-A Guide to the Theory of NP-Completeness (San Francisco, USA: W. H. Freeman and cie).
18. Ghallab, M., and Mounir-Alaoui, A., 1989, Managing efficiently temporal relations through indexed spanning trees. Proceedings of the 11th International Joint Conference on AI (IJCAI-89), Detroit, USA, pp. 1297-1303.
19. Ghallab, M., and Vidal, T., 1995, Focusing on a sub-graph for managing efficiently numerical temporal constraints. Florida AI Research Symposium (FLAIRS-95), Melbourne Beach, FL, USA.
20. Jonsson, P., and Backstrom, C., 1996, A linear programming approach to temporal reasoning. Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), Portland, OR, USA, pp. 1235-1240.
21. Jourdan, M., Layaida, N., and Sabry-Ismail, L., 1997, Time representation and management in MADEUS: an authorizing environment for multimedia documents. Multimedia Computing and Networking 1997, edited by M. Freeman, P. Jardetzky and H. Vin, Proceedings SPIE 3020, San Jose, USA, pp. 68-79.
22. Kumar, V., 1992, Algorithms for constraint satisfaction problems: a survey. AI Magazine, 13(1): 32-44.
23. Mackworth, A., 1992, The logic of constraint satisfaction. Artificial Intelligence, 58: 3-20.
24. Mackworth, A., and Freuder, E., 1985, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25(1): 65-74.
25. Meiri, I., 1991, Combining qualitative and quantitative constraints in temporal reasoning. Proceedings of the 9th National Conference on AI (AAAI-91), Anaheim, CA, USA, pp. 260-267.
26. Nebel, B., and Biirckert, H., 1995, Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra. Journal of the ACM, 42(1): 43-66.
27. Pearl, J., 1984, Heuristics: Intelligent Search Strategies for Computer Problem Solving (Reading, Mass, USA: Addison-Wesley).
28. Rutten, E., and Hertzberg, J., 1993, Temporal planner = nonlinear planner +time map manager. AI Communications, 6(1): 18-26.
29. Schrag, R., Boddy, M., and Carciofini, J., 1992, Managing disjunction for practical temporal reasoning. Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), edited by B. Nebel, C. Rich and W. Swartaut (San Francisco, CA: Morgan Kaufmann), pp. 36-46.
30. Schwalb, E., and Dechter, R., 1997, Processing disjunctions in temporal constraint networks. Artificial Intelligence, 93(1-2): 29-61.
31. Tsang, E., 1993, Foundations of Constraint Satisfaction (London: Academic Press).
32. van Beek, P., 1991, Temporal query processing with indefinite information. Artificial Intelligence in Medicine, 3: 325-339.
33. van Hentenryck, P., 1995, Constraint solving for combinatorial problems: a tutorial. 1st International Conference on Principles and Practice of Constraint Programming (CP-95), Cassis, France, pp. 564-587.
34. Vidal, T., and Ghallab, M., 1996, Dealing with uncertain durations in temporal constraint networks dedicated to planning. Proceedings of the 12th European Conference on Artificial Intelligence (ECAI-96), Budapest, Hungary, pp. 48-52.
35. Vilain, M., Kautz, H., and van Beek, P., 1989, Constraint propagation algorithms: a revised report. Readings in Qualitative Reasoning about Physical Systems (San Francisco, CA: Morgan Kaufmann).