{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:38:48Z","timestamp":1648723128157},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,12,13]],"date-time":"2008-12-13T00:00:00Z","timestamp":1229126400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s10479-008-0492-1","type":"journal-article","created":{"date-parts":[[2008,12,12]],"date-time":"2008-12-12T20:30:14Z","timestamp":1229113814000},"page":"233-263","source":"Crossref","is-referenced-by-count":2,"title":["Discovering implied constraints in precedence graphs with alternatives"],"prefix":"10.1007","volume":"180","author":[{"given":"Roman","family":"Bart\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"\u010cepek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Surynek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,13]]},"reference":[{"key":"492_CR1","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/978-3-540-73580-9_7","volume-title":"Abstraction, reformulation, and approximation (SARA 2007)","author":"R. Bart\u00e1k","year":"2007","unstructured":"Bart\u00e1k, R. (2007). Generating implied Boolean constraints via singleton consistency. In LNAI : Vol. 4612. Abstraction, reformulation, and approximation (SARA 2007) (pp. 50\u201364). New York: Springer."},{"key":"492_CR2","series-title":"Technical Report WS-07-12","first-page":"1","volume-title":"Papers from the 2007 AAAI workshop on spatial and temporal reasoning","author":"R. Bart\u00e1k","year":"2007","unstructured":"Bart\u00e1k, R., & \u010cepek, O. (2007). Nested temporal networks with alternatives. In Technical Report WS-07-12. Papers from the 2007 AAAI workshop on spatial and temporal reasoning (pp. 1\u20138). Menlo Park: AAAI Press."},{"key":"492_CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/SCIS.2007.367680","volume-title":"Proceedings of the 2007 IEEE symposium on computational intelligence in scheduling (CI-Sched 2007)","author":"R. Bart\u00e1k","year":"2007","unstructured":"Bart\u00e1k, R., \u010cepek, O., & Surynek, P. (2007). Modelling alternatives in temporal networks. In Proceedings of the 2007 IEEE symposium on computational intelligence in scheduling (CI-Sched 2007) (pp. 129\u2013136). New York: IEEE Press."},{"key":"492_CR4","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0004-3702(00)00035-7","volume":"121","author":"J. Ch. Beck","year":"2000","unstructured":"Beck, J. Ch., & Fox, M. S. (2000). Constraint-directed techniques for scheduling alternative activities. Artificial Intelligence, 121, 211\u2013250.","journal-title":"Artificial Intelligence"},{"key":"492_CR5","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., & Yannakakis, M. (1983). On the desirability of acyclic database schemes. Journal of the ACM, 30, 479\u2013513.","journal-title":"Journal of the ACM"},{"key":"492_CR6","unstructured":"Bessiere, C., Coletta, R., & Petit, T. (2007) Learning implied global constraints, In Proceedings of twentieth international conference on artificial intelligence (IJCAI 07) (pp. 44\u201349)."},{"key":"492_CR7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D. (1979). New methods to color the vertices of a graph. Communications of the ACM, 22, 251\u2013256.","journal-title":"Communications of the ACM"},{"key":"492_CR8","unstructured":"Charnley, J., Colton, S., & Miguel, I. (2006) Automatic generation of implied constraints, In Proceedings of 17th European conference on artificial intelligence (ECAI 06) (pp. 73\u201377)."},{"key":"492_CR9","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1287\/opre.15.3.407","volume":"15","author":"W. Crowston","year":"1967","unstructured":"Crowston, W., & Thompson, G. L. (1967). Decision CPM: A method for simultaneous planning, scheduling, and control of projects. Operations Research, 15, 407\u2013426.","journal-title":"Operations Research"},{"key":"492_CR10","volume-title":"Constraint processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R. (2003). Constraint processing. Los Altos: Kaufmann."},{"key":"492_CR11","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., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49, 61\u201395.","journal-title":"Artificial Intelligence"},{"key":"492_CR12","first-page":"1123","volume-title":"Proceedings of AAAI-94","author":"K. Erol","year":"1994","unstructured":"Erol, K., Nau, D., & Hendler, J. (1994). HTN planning: Complexity and expressivity. In Proceedings of AAAI-94 (pp. 1123\u20131128). Menlo Park: AAAI Press."},{"key":"492_CR13","unstructured":"Focacci, F., Laborie, P., & Nuijten, W. (2000) Solving scheduling problems with setup times and alternative resources, In Proceedings of AIPS 2000."},{"key":"492_CR14","unstructured":"Frisch, A. M., Miguel, I., & Walsh, T. (2001) Generating implied constraints via proof planning, In Proceedings of the IJCAR-01 workshop on future directions in automated reasoning (pp. 48\u201355)."},{"key":"492_CR15","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman."},{"key":"492_CR16","unstructured":"Horling, B., Leader, V., Vincent, R., Wagner, T., Raja, A., Zhang, S., Decker, K., & Harvey, A. (1999) The taems white paper. University of Massachusetts, http:\/\/mas.cs.umass.edu\/research\/taems\/white\/taemswhite.pdf ."},{"key":"492_CR17","unstructured":"Kim, P., Williams, B., & Abrahmson, M. (2001) Executing reactive, model-based programs through graph-based temporal planning, In Proceedings of IJCAI-2001 (pp. 487\u2013493)."},{"key":"492_CR18","unstructured":"Kuster, J., Jannach, D., & Friedrich, G. (2007) Handling alternative activities in resource-constrained project scheduling problems, In Proceedings of twentieth international joint conference on artificial intelligence (IJCAI-07) (pp. 1960\u20131965)."},{"key":"492_CR19","unstructured":"Nuijten, W., Bousonville, T., Focacci, F., Godard, D., & Le Pape, C. (2003) MaScLib: Problem description and test bed design. http:\/\/www2.ilog.com\/masclib ."},{"issue":"4","key":"492_CR20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1023\/A:1025894003623","volume":"8","author":"I. Tsamardinos","year":"2003","unstructured":"Tsamardinos, I., Vidal, T., & Pollack, M. E. (2003). CTP: A new constraint-based formalism for conditional temporal planning. Constraints, 8(4), 365\u2013388.","journal-title":"Constraints"},{"key":"492_CR21","doi-asserted-by":"crossref","unstructured":"Van Beek, P., & Dechter, R. (1994) Constraint tightness versus global consistency, In Proceedings of knowledge representation (KR-94) (pp. 572\u2013582).","DOI":"10.1016\/B978-1-4832-1452-8.50148-2"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0492-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0492-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0492-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:52Z","timestamp":1559153272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0492-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,13]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["492"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0492-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,13]]}}}