{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T04:58:14Z","timestamp":1773637094786,"version":"3.50.1"},"reference-count":25,"publisher":"Maximum Academic Press","issue":"3","license":[{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Knowledge Engineering Review"],"published-print":{"date-parts":[[2010,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    The CNT framework (\n                    <jats:italic>Constraint Network on Timelines<\/jats:italic>\n                    ) has been designed to model discrete event dynamic systems and the properties one knows, one wants to verify, or one wants to enforce on them. In this article, after a reminder about the CNT framework, we show its modeling power and its ability to support various modeling styles, coming from the planning, scheduling, and constraint programming communities. We do that by producing and comparing various models of two mission management problems in the aerospace domain: management of a team of unmanned air vehicles and of an Earth observing satellite.\n                  <\/jats:p>","DOI":"10.1017\/s0269888910000172","type":"journal-article","created":{"date-parts":[[2010,8,23]],"date-time":"2010-08-23T09:25:48Z","timestamp":1282555548000},"page":"319-336","source":"Crossref","is-referenced-by-count":21,"title":["How to model planning and scheduling problems using constraint networks on timelines"],"prefix":"10.48130","volume":"25","author":[{"given":"G\u00e9rard","family":"Verfaillie","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"C\u00e9dric","family":"Pralet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Michel","family":"Lema\u00eetre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"27968","published-online":{"date-parts":[[2010,9,1]]},"reference":[{"key":"S0269888910000172_ref23","first-page":"585","volume-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI)","author":"van Beek","year":"1999"},{"key":"S0269888910000172_ref9","first-page":"61","volume-title":"Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (AIPS)","author":"Ghallab","year":"1994"},{"key":"S0269888910000172_ref22","volume-title":"Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (ICAPS)","author":"Smith","year":"2008"},{"key":"S0269888910000172_ref18","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1613\/jair.2151","article-title":"An algebraic graphical model for decision with uncertainties, feasibilities, and utilities","volume":"29","author":"Pralet","year":"2007","journal-title":"Journal of Artificial Intelligence Research"},{"key":"S0269888910000172_ref11","first-page":"177","volume-title":"Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (AIPS)","author":"J\u00f3nsson","year":"2000"},{"key":"S0269888910000172_ref17","first-page":"272","volume-title":"Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (ICAPS)","author":"Pralet","year":"2008b."},{"key":"S0269888910000172_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00128-X"},{"key":"S0269888910000172_ref13","first-page":"25","volume-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI)","author":"Mittal","year":"1990"},{"key":"S0269888910000172_ref21","unstructured":"Schiex T. , Fargier H. , Verfaillie G. 1995. Valued constraint satisfaction problems: hard and easy problems. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), Morgan Kaufman, 631\u2013637."},{"key":"S0269888910000172_ref6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1613\/jair.1129","article-title":"PDDL2.1: an extension to PDDL for expressing temporal planning domains","volume":"20","author":"Fox","year":"2003","journal-title":"Journal of Artificial Intelligence Research"},{"key":"S0269888910000172_ref8","first-page":"5","article-title":"Unifying planning and scheduling as timelines in a component-based perspective","volume":"18","author":"Fratini","year":"2008","journal-title":"Archives of Control Sciences"},{"key":"S0269888910000172_ref16","volume-title":"Proceedings of the International Symposium on Artificial Intelligence, Robotics, and Automation for Space (iSAIRAS)","author":"Pralet","year":"2008a."},{"key":"S0269888910000172_ref24","article-title":"Constraint-based modeling of discrete event dynamic systems","author":"Verfaillie","year":"2008","journal-title":"Journal of Intelligent Manufacturing, Special Issue on \u201cPlanning, Scheduling, and Constraint Satisfaction\u201d"},{"key":"S0269888910000172_ref20","volume-title":"Handbook of Constraint Programming","author":"Rossi","year":"2006"},{"key":"S0269888910000172_ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2002.805826"},{"key":"S0269888910000172_ref10","volume-title":"Automated Planning: Theory and Practice","author":"Ghallab","year":"2004"},{"key":"S0269888910000172_ref14","first-page":"169","volume-title":"Intelligent Scheduling","author":"Muscettola","year":"1994"},{"key":"S0269888910000172_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2005.08.004"},{"key":"S0269888910000172_ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2005.25"},{"key":"S0269888910000172_ref4","volume-title":"New Directions in AI Planning","author":"Cesta","year":"1996"},{"key":"S0269888910000172_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1479-4"},{"key":"S0269888910000172_ref2","first-page":"587","volume-title":"Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP)","volume":"2470","author":"Bart\u00e1k","year":"2002"},{"key":"S0269888910000172_ref12","first-page":"359","volume-title":"Proceedings of the European Conference on Artificial Intelligence (ECAI)","author":"Kautz","year":"1992"},{"key":"S0269888910000172_ref19","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes, Discrete Stochastic Dynamic Programming","author":"Puterman","year":"1994"},{"key":"S0269888910000172_ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025842019552"}],"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0269888910000172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:43:57Z","timestamp":1767624237000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0269888910000172\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["S0269888910000172"],"URL":"https:\/\/doi.org\/10.1017\/s0269888910000172","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"value":"0269-8889","type":"print"},{"value":"1469-8005","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}