Constraint-based modeling of discrete event dynamic systems

Journal of Intelligent Manufacturing

Volumn 21, Issue 1, 2010, Pages 31-47

  Verfaillie, Gérard ^a   Pralet, Cédric ^a   Lemaître, Michel ^a  

^a ONERA   (France)

Author keywords

Constraint based modeling; Discrete event dynamic systems; Timelines

Indexed keywords

CONSTRAINT NETWORKS; CONSTRAINT-BASED; CONSTRAINT-BASED MODELING; DECISION TASK; DISCRETE EVENT DYNAMIC SYSTEMS; GENERIC FRAMEWORKS; MARKOV CHAIN; PLANNING AND SCHEDULING; SYNCHRONOUS LANGUAGES; TIMED AUTOMATA;

BIOMINERALIZATION; COMPUTER SIMULATION LANGUAGES; DYNAMIC PROGRAMMING; GRAPH THEORY; MARKOV PROCESSES; PETRI NETS; ROBOTS; TEMPORAL LOGIC; TRANSLATION (LANGUAGES);

DYNAMICAL SYSTEMS;

EID: 74849117704     PISSN: 09565515     EISSN: 15728145     Source Type: Journal    
DOI: 10.1007/s10845-008-0176-3     Document Type: Article

References (39)

1. R. Alur D. Dill 1994 A theory of timed automata Journal of Theoretical Computer Science 126 2 183 235 10.1016/0304-3975(94)90010-8
2. Arnold, A., & Nivat, M. (1982). Comportements de processus. In Actes du Colloque AFCET "Les MathTmatiques de l'Informatique" (pp. 35-68). Paris.
3. Baptiste, P., Pape, C. L., & Nuijten, W. (2001). Constraint-based scheduling: Applying constraint programming to scheduling problems. Kluwer Academic Publishers.
4. Barták, R. (1999). Dynamic constraint models for complex production environments. In Proceedings of the Joint ERCIM/Compulog-Net Workshop. Cyprus.
5. A. Benveniste P. Caspi S. Edwards N. Halbwachs P.L. Guernic R. de Simone 2003 The synchronous languages twelve years later Proceedings of the IEEE 91 1 64 83 10.1109/JPROC.2002.805826 (Pubitemid 43758699)
6. E. Clarke A. Biere R. Raimi Y. Zhu 2001 Bounded model checking using satisfiability solving Formal Methods in System Design, 19 1 7 34 10.1023/A:1011276507260
7. R. Dechter 1999 Bucket elimination: a unifying framework for reasoning Artificial Intelligence 113 41 85 10.1016/S0004-3702(99)00059-4 (Pubitemid 30542742)
8. Dechter, R. (2003). Constraint Processing. Morgan Kaufmann.
9. Dechter, R., & Dechter, A. (1988). Belief maintenance in dynamic constraint networks. In Proceedings of the 7th National Conference on Artificial Intelligence (AAAI-88)(pp. 37-42). St. Paul, MN, USA.
10. R. Dechter I. Meiry J. Pearl 1991 Temporal constraint networks Artificial Intelligence 49 61 95 10.1016/0004-3702(91)90006-6
11. R. Fikes N. Nilsson 1971 STRIPS: a new approach to the application of theorem proving Artificial Intelligence 2 189 208 10.1016/0004-3702(71)90010-5
12. M. Fox D. Long 2003 PDDL2.1: An extension to PDDL for expressing temporal planning domains Journal of Artificial Intelligence Research 20 61 124
13. J. Frank A. Jónsson 2003 Constraint-based attribute and interval planning Constraints 8 4 339 364 10.1023/A:1025842019552
14. E. Gelle B. Faltings 2003 Solving mixed and conditional constraint satisfaction problems Constraints 8 2 107 141 10.1023/A:1022394531132
15. Ghallab, M. (1996). On chronicles: representation, on-line recognition and learning. In Proceedings of the 5th International Conference on the Principles of Knowledge Representation and Reasoning (KR-96) (pp. 597-606). Boston, MA, USA.
16. Ghallab, M., Nau, D., & Traverso, P. (2004). Automated Planning: Theory and Practice. Morgan Kaufmann.
17. Hickmott, S., Rintanen, J., ThiTbaux, S., & White, L. (2007). Planning via petri net unfolding. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07) (pp. 1904-1911). Hyderabad, India.
18. Kautz, H., & Selman, B. (1992). Planning as satisfiability. In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI-92) (pp. 359-363). Vienna, Austria.
19. R. Kowalski M. Sergot 1986 A Logic-based calculus of events New Generation Computing 4 67 95 10.1007/BF03037383
20. N. Kushmerick S. Hanks D. Weld 1995 An algorithm for probabilistic planning Artificial Intelligence 76 239 286 10.1016/0004-3702(94)00087-H
21. Laborie, P., Ghallab, M. (1995). IxTeT: An integrated approach for plan generation and scheduling. In Proceedings of the 4th INRIA/IEEE Symposium on Emerging Technologies and Factory Automation (ETFA-95) (pp. 485-495). Paris, France.
22. H. Levesque R. Reiter Y. Lesperance F. Lin R. Scherl 1997 GOLOG: a logic programming language for dynamic domains Journal of Logic Programming 31 1-3 59 83 10.1016/S0743-1066(96)00121-5
23. McDermott, D. (1998). PDDL-the planning domain definition language.
24. I. Miguel Q. Shen P. Jarvis 2001 Efficient flexible planning via dynamic flexible constraint satisfaction Engineering Applications of Artificial Intelligence 14 3 301 327 10.1016/S0952-1976(01)00014-8 (Pubitemid 32529288)
25. Mittal, S., Falkenhainer, B. (1990). Dynamic constraint satisfaction problems. In Proceedings of the 8th National Conference on Artificial Intelligence (AAAI-90) (pp. 25-32). Boston, MA, USA.
26. Muscettola N. (1994). HSTS: integrating planning and scheduling. In M. Zweden, & M. Fox (Eds.), Intelligent Scheduling (pp. 169-212). Morgan Kaufmann.
27. N. Muscettola P. Nayak B. Pell B. Williams 1998 Remote agent: to boldly go where no AI system has gone before Artificial Intelligence 103 1-2 5 48 10.1016/S0004-3702(98)00068-X
28. Nareyek, A. (2001). Constraints-based agents-an architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds. Springer.
29. Nareyek, A., Freuder, E., Fourer, R., Giunchiglia, E., Goldman, R., Kautz, H., Rintanen, J., & Tate, A. (2005). Constraints and AI Planning. IEEE Intelligent Systems.
30. Penberthy, J., & Weld, D. (1994). Temporal planning with continuous change. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94) (pp. 1010-1015). Seattle, WA, USA.
31. Pnueli, A. (1977). The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science (FOCS-77) (pp. 46-57). Providence, RI, USA.
32. C. Pralet G. Verfaillie T. Schiex 2007 An algebraic graphical model for decision with uncertainties, feasibilities, and utilities Journal of Artificial Intelligence Research 29 421 489
33. Puterman, M. (1994). Markov Decision Processes, Discrete Stochastic Dynamic Programming. Wiley.
34. Rossi, R., Beek, P. V., & Walsh, T. (Eds.). (2006). Handbook of Constraint Programming. Elsevier.
35. Sabin, M., Freuder, E., Wallace, R. (2003). Greater efficiency for conditional constraint satisfaction. In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP-03) (pp. 649-663). Cork, Ireland.
36. Schiex, T., Fargier, H., Verfaillie, G. (1995). Valued constraint satisfaction problems: Hard and easy problems. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95) (pp. 631-637). Montréal, Canada.
37. Trinquart, R., & Ghallab, M. (2001). An extended functional representation in temporal plannning: towards continuous change. In Proceedings of the 6th European Conference on Planning (ECP-01). Toledo, Spain.
38. van Beek, P., & Chen, X. (1999). CPlan: A constraint programming approach to planning. In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99) (pp 585-590). Orlando, FL, USA.
39. G. Verfaillie N. Jussien 2005 Constraint solving in uncertain and dynamic environments: A survey Constraints 10 3 253 281 10.1007/s10601-005-2239-9 (Pubitemid 41118933)