{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T05:40:01Z","timestamp":1733636401716,"version":"3.30.1"},"reference-count":20,"publisher":"Informa UK Limited","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Experimental &amp; Theoretical Artificial Intelligence"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1080\/095281398146914","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T16:21:47Z","timestamp":1027700507000},"page":"63-76","source":"Crossref","is-referenced-by-count":1,"title":["Constraint propagation for ordering, abstraction, and aggregation relations"],"prefix":"10.1080","volume":"10","author":[{"given":"CLAUDE LE","family":"PAPE","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","unstructured":"Brachman, R. J. and Levesque, H. J. The tractability of subsumption in frame-based description languages. Proceedings of the Fourth National Conference on Artificial Intelligence. Austin, TX. pp.34\u201337. Cambridge, MA: AAAI Press\/MIT Press."},{"volume-title":"Probl\u00e8mes d'Ordonnancement \u00e0 Contraintes de Ressources: Algorithmes et Complexit\u00e9","year":"1984","author":"Carlier J.","key":"CIT0002"},{"key":"CIT0003","unstructured":"Cheng, C.C. and Smith, S. F. Generating feasible schedules under complex metric constraints. Proceedings of the Twelfth National Conference on Artificial Intelligence. Seattle, WA. pp.1086\u20131091. Cambridge, MA: AAAI Press\/MIT Press."},{"volume-title":"Technical Report","year":"1995","author":"Cheng C.-C.","key":"CIT0004"},{"key":"CIT0005","unstructured":"Collinot, A. and Le Pape, C. Controlling constraint propagation. Proceedings of the Tenth International Joint Conference on Artificial Intelligence. Milan, Italy. pp.1032\u20131034. Los Altos, CA: Morgan Kaufmann."},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9236(91)90063-H"},{"volume-title":"An Approach to Reasoning about Time for Planning and Problem Solving","year":"1986","author":"Dean T.","key":"CIT0007"},{"volume-title":"Analyse sous Contraintes et Aide \u00e0 la D\u00e9cision pour Certains Probl\u00e8mes d'Ordonnancement","year":"1976","author":"Erschler J.","key":"CIT0008"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey M. R.","key":"CIT0009"},{"key":"CIT0010","doi-asserted-by":"crossref","unstructured":"Gerevini, A., Schubert, L. and Schaeffer, S. The temporal reasoning tools time graph I-II. Proceedings of the Sixth IEEE International Conference on Tools with Artificial Intelligence. New Orleans, LA, USA. pp.513\u2013520.","DOI":"10.1109\/TAI.1994.346448"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00016-T"},{"volume-title":"Graphs and Algorithms","year":"1984","author":"Gondran M.","key":"CIT0012"},{"key":"CIT0013","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Maher, M. J., Stuckey, P. J. and Yap, R. H. C. Beyond finite domains. Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming. Rosario, WA, USA. pp.77\u201384. Heidelberg: Springer.","DOI":"10.1007\/3-540-58601-6_92"},{"key":"CIT0014","first-page":"32","volume":"13","author":"Kumar V.","year":"1992","journal-title":"AI Magazine"},{"volume-title":"Technical Report","year":"1985","author":"Le Pape C.","key":"CIT0015"},{"volume-title":"Des Syst\u00e8mes d'Ordonnancement Flexibles et Opportunistes","year":"1988","author":"Le Pape C.","key":"CIT0016"},{"volume-title":"Readings in Computer Architectures for Intelligent Systems","year":"1992","author":"Le Pape C.","key":"CIT0017"},{"key":"CIT0018","first-page":"67","volume-title":"Intelligent Scheduling","author":"Le Pape C.","year":"1994"},{"key":"CIT0019","unstructured":"van Beek, P. Approximation algorithms for temporal reasoning. Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Detroit, MI, USA. pp.1291\u20131296. Los Altos, CA: Morgan Kaufmann."},{"key":"CIT0020","doi-asserted-by":"crossref","unstructured":"van Beek, P. Reasoning about qualitative temporal information. Proceedings of the Eighth National Conference on Artificial Intelligence. Boston, MA, USA. pp.728\u2013734. Cambridge, MA: AAAI Press\/MIT Press.","DOI":"10.1016\/0004-3702(92)90011-L"}],"container-title":["Journal of Experimental &amp; Theoretical Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/095281398146914","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T05:12:19Z","timestamp":1733634739000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/095281398146914"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["10.1080\/095281398146914"],"URL":"https:\/\/doi.org\/10.1080\/095281398146914","relation":{},"ISSN":["0952-813X","1362-3079"],"issn-type":[{"type":"print","value":"0952-813X"},{"type":"electronic","value":"1362-3079"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}