{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T16:00:45Z","timestamp":1782316845604,"version":"3.54.5"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,11]],"date-time":"2008-11-11T00:00:00Z","timestamp":1226361600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s10845-008-0176-3","type":"journal-article","created":{"date-parts":[[2008,11,10]],"date-time":"2008-11-10T05:30:21Z","timestamp":1226295021000},"page":"31-47","source":"Crossref","is-referenced-by-count":9,"title":["Constraint-based modeling of discrete event dynamic systems"],"prefix":"10.1007","volume":"21","author":[{"given":"G\u00e9rard","family":"Verfaillie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C\u00e9dric","family":"Pralet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michel","family":"Lema\u00eetre","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,11,11]]},"reference":[{"issue":"2","key":"176_CR1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur R., Dill D. (1994) A theory of timed automata. Journal of Theoretical Computer Science 126(2): 183\u2013235","journal-title":"Journal of Theoretical Computer Science"},{"key":"176_CR2","unstructured":"Arnold, A., & Nivat, M. (1982). Comportements de processus. In Actes du Colloque AFCET \u201cLes MathTmatiques de l\u2019Informatique\u201d (pp. 35\u201368). Paris."},{"key":"176_CR3","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Pape, C. L., & Nuijten, W. (2001). Constraint-based scheduling: Applying constraint programming to scheduling problems. Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-1479-4"},{"key":"176_CR4","unstructured":"Bart\u00e1k, R. (1999). Dynamic constraint models for complex production environments. In Proceedings of the Joint ERCIM\/Compulog-Net Workshop. Cyprus."},{"issue":"1","key":"176_CR5","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/JPROC.2002.805826","volume":"91","author":"A. Benveniste","year":"2003","unstructured":"Benveniste A., Caspi P., Edwards S., Halbwachs N., Guernic P.L., de Simone R. (2003) The synchronous languages twelve years later. Proceedings of the IEEE 91(1): 64\u201383","journal-title":"Proceedings of the IEEE"},{"issue":"1","key":"176_CR6","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1011276507260","volume":"19","author":"E. Clarke","year":"2001","unstructured":"Clarke E., Biere A., Raimi R., Zhu Y. (2001) Bounded model checking using satisfiability solving. Formal Methods in System Design, 19(1): 7\u201334","journal-title":"Formal Methods in System Design,"},{"key":"176_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","volume":"113","author":"R. Dechter","year":"1999","unstructured":"Dechter R. (1999) Bucket elimination: a unifying framework for reasoning. Artificial Intelligence 113: 41\u201385","journal-title":"Artificial Intelligence"},{"key":"176_CR8","unstructured":"Dechter, R. (2003). Constraint Processing. Morgan Kaufmann."},{"key":"176_CR9","unstructured":"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\u201342). St. Paul, MN, USA."},{"key":"176_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"Dechter R., Meiry I., Pearl J. (1991) Temporal constraint networks. Artificial Intelligence 49: 61\u201395","journal-title":"Artificial Intelligence"},{"key":"176_CR11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"R. Fikes","year":"1971","unstructured":"Fikes R., Nilsson N. (1971) STRIPS: a new approach to the application of theorem proving. Artificial Intelligence 2: 189\u2013208","journal-title":"Artificial Intelligence"},{"key":"176_CR12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1613\/jair.1129","volume":"20","author":"M. Fox","year":"2003","unstructured":"Fox M., Long D. (2003) PDDL2.1 : An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research 20: 61\u2013124","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4","key":"176_CR13","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1023\/A:1025842019552","volume":"8","author":"J. Frank","year":"2003","unstructured":"Frank J., J\u00f3nsson A. (2003) Constraint-based attribute and interval planning. Constraints 8(4): 339\u2013364","journal-title":"Constraints"},{"issue":"2","key":"176_CR14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1022394531132","volume":"8","author":"E. Gelle","year":"2003","unstructured":"Gelle E., Faltings B. (2003) Solving mixed and conditional constraint satisfaction problems. Constraints 8(2): 107\u2013141","journal-title":"Constraints"},{"key":"176_CR15","unstructured":"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\u2013606). Boston, MA, USA."},{"key":"176_CR16","unstructured":"Ghallab, M., Nau, D., & Traverso, P. (2004). Automated Planning: Theory and Practice. Morgan Kaufmann."},{"key":"176_CR17","unstructured":"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\u20131911). Hyderabad, India."},{"key":"176_CR18","unstructured":"Kautz, H., & Selman, B. (1992). Planning as satisfiability. In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI-92) (pp. 359\u2013363). Vienna, Austria."},{"key":"176_CR19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF03037383","volume":"4","author":"R. Kowalski","year":"1986","unstructured":"Kowalski R., Sergot M. (1986) A Logic-based calculus of events. New Generation Computing 4: 67\u201395","journal-title":"New Generation Computing"},{"key":"176_CR20","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0004-3702(94)00087-H","volume":"76","author":"N. Kushmerick","year":"1995","unstructured":"Kushmerick N., Hanks S., Weld D. (1995) An algorithm for probabilistic planning. Artificial Intelligence 76: 239\u2013286","journal-title":"Artificial Intelligence"},{"key":"176_CR21","doi-asserted-by":"crossref","unstructured":"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\u2013495). Paris, France.","DOI":"10.1109\/ETFA.1995.496801"},{"issue":"1\u20133","key":"176_CR22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0743-1066(96)00121-5","volume":"31","author":"H. Levesque","year":"1997","unstructured":"Levesque H., Reiter R., Lesperance Y., Lin F., Scherl R. (1997) GOLOG: a logic programming language for dynamic domains. Journal of Logic Programming 31(1\u20133): 59\u201383","journal-title":"Journal of Logic Programming"},{"key":"176_CR23","unstructured":"McDermott, D. (1998). PDDL\u2014the planning domain definition language."},{"issue":"3","key":"176_CR24","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0952-1976(01)00014-8","volume":"14","author":"I. Miguel","year":"2001","unstructured":"Miguel I., Shen Q., Jarvis P. (2001) Efficient flexible planning via dynamic flexible constraint satisfaction. Engineering Applications of Artificial Intelligence 14(3): 301\u2013327","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"176_CR25","unstructured":"Mittal, S., Falkenhainer, B. (1990). Dynamic constraint satisfaction problems. In Proceedings of the 8th National Conference on Artificial Intelligence (AAAI-90) (pp. 25\u201332). Boston, MA, USA."},{"key":"176_CR26","unstructured":"Muscettola N. (1994). HSTS: integrating planning and scheduling. In M. Zweden, & M. Fox (Eds.), Intelligent Scheduling (pp. 169\u2013212). Morgan Kaufmann."},{"issue":"1\u20132","key":"176_CR27","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0004-3702(98)00068-X","volume":"103","author":"N. Muscettola","year":"1998","unstructured":"Muscettola N., Nayak P., Pell B., Williams B. (1998) Remote agent: to boldly go where no AI system has gone before. Artificial Intelligence 103(1\u20132): 5\u201348","journal-title":"Artificial Intelligence"},{"key":"176_CR28","unstructured":"Nareyek, A. (2001). Constraints-based agents\u2014an architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds. Springer."},{"key":"176_CR29","doi-asserted-by":"crossref","unstructured":"Nareyek, A., Freuder, E., Fourer, R., Giunchiglia, E., Goldman, R., Kautz, H., Rintanen, J., & Tate, A. (2005). Constraints and AI Planning. IEEE Intelligent Systems.","DOI":"10.1109\/MIS.2005.25"},{"key":"176_CR30","unstructured":"Penberthy, J., & Weld, D. (1994). Temporal planning with continuous change. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94) (pp. 1010\u20131015). Seattle, WA, USA."},{"key":"176_CR31","doi-asserted-by":"crossref","unstructured":"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\u201357). Providence, RI, USA.","DOI":"10.1109\/SFCS.1977.32"},{"key":"176_CR32","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1613\/jair.2151","volume":"29","author":"C. Pralet","year":"2007","unstructured":"Pralet C., Verfaillie G., Schiex T. (2007) An algebraic graphical model for decision with uncertainties, feasibilities, and utilities. Journal of Artificial Intelligence Research 29: 421\u2013489","journal-title":"Journal of Artificial Intelligence Research"},{"key":"176_CR33","unstructured":"Puterman, M. (1994). Markov Decision Processes, Discrete Stochastic Dynamic Programming. Wiley."},{"key":"176_CR34","unstructured":"Rossi, R., Beek, P. V., & Walsh, T. (Eds.). (2006). Handbook of Constraint Programming. Elsevier."},{"key":"176_CR35","doi-asserted-by":"crossref","unstructured":"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\u2013663). Cork, Ireland.","DOI":"10.1007\/978-3-540-45193-8_44"},{"key":"176_CR36","unstructured":"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\u2013637). Montr\u00e9al, Canada."},{"key":"176_CR37","unstructured":"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."},{"key":"176_CR38","unstructured":"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\u2013590). Orlando, FL, USA."},{"issue":"3","key":"176_CR39","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10601-005-2239-9","volume":"10","author":"G. Verfaillie","year":"2005","unstructured":"Verfaillie G., Jussien N. (2005) Constraint solving in uncertain and dynamic environments: A survey. Constraints 10(3): 253\u2013281","journal-title":"Constraints"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-008-0176-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-008-0176-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-008-0176-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:11:43Z","timestamp":1559268703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-008-0176-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,11]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["176"],"URL":"https:\/\/doi.org\/10.1007\/s10845-008-0176-3","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,11]]}}}