Abstract
This paper is originally motivated by an application where the objective is to generate a video summary, built using intervals extracted from a video source. In this application, the constraints used to select the relevant pieces of intervals are based on Allen’s algebra. The best state-of-the-art results are obtained with a small set of ad hoc solution techniques, each specific to one combination of the 13 Allen’s relations. Such techniques require some expertise in Constraint Programming. This is a critical issue for video specialists. In this paper, we design a generic constraint, dedicated to a class of temporal problems that covers this case study, among others. ExistAllen takes as arguments a vector of tasks, a set of disjoint intervals and any of the \(2^{13}\) combinations of Allen’s relations. ExistAllen holds if and only if the tasks are ordered according to their indexes and for any task at least one relation is satisfied, between the task and at least one interval. We design a propagator that achieves bound-consistency in \(O(n+m)\), where n is the number of tasks and m the number of intervals. This propagator is suited to any combination of Allen’s relations, without any specific tuning. Therefore, using our framework does not require a strong expertise in Constraint Programming. The experiments, performed on real data, confirm the relevance of our approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832–843 (1983)
Berrani, S.-A., Boukadida, H., Gros, P.: Constraint satisfaction programming for video summarization. In: Proceedings of the 2013 IEEE International Symposium on Multimedia, ISM 2013, Washington, DC, USA, pp. 195–202. IEEE Computer Society (2013)
Bessière, C.: Constraint propagation. Research report 06020. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, LIRMM, chapter 3. Elsevier (2006)
Boukadida, H., Berrani, S.-A., Gros, P.: A novel modeling for video summarization using constraint satisfaction programming. In: Bebis, G., et al. (eds.) ISVC 2014, Part II. LNCS, vol. 8888, pp. 208–219. Springer, Heidelberg (2014)
Bramsen, P., Deshp, P., Lee, Y.K., Barzilay, R.: Finding temporal order in discharge summaries, pp. 81–85 (2006)
Choueiry, B.Y., Lin, X.: An efficient consistency algorithm for the temporal constraint satisfaction problem. AI Commun. 17(4), 213–221 (2004)
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artif. Intell. 49(1–3), 61–95 (1991)
Ibrahim, Z.A.A., Ferrane, I., Joly, P.: Temporal relation analysis in audiovisual documents for complementary descriptive information. In: Detyniecki, M., Jose, J.M., Nürnberger, A., van Rijsbergen, C.J.K. (eds.) AMR 2005. LNCS, vol. 3877, pp. 141–154. Springer, Heidelberg (2006)
Koubarakis, M.: From local to global consistency in temporal constraint networks. Theor. Comput. Sci. 173(1), 89–112 (1997)
Koubarakis, M., Skiadopoulos, S.: Querying temporal and spatial constraint networks in PTIME. Artif. Intell. 123(1–2), 223–263 (2000)
Satish Kumar, T.K., Cirillo, M., Koenig, S.: Simple temporal problems with taboo regions. In: des Jardins, M., Littman, M.L. (eds.) Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, July 14–18, 2013, Bellevue, Washington, USA. AAAI Press (2013)
Ladkin, P.B.: Satisfying first-order constraints about time intervals. In: Shrobe, H.E., Mitchell, T.M., Smith, R.G. (eds.) Proceedings of the 7th National Conference on Artificial Intelligence. St. Paul, MN, August 21–26, 1988, pp. 512–517. AAAI Press/The MIT Press (1988)
Michel, L., Van Hentenryck, P.: Activity-based search for black-box constraint programming solvers. In: Beldiceanu, N., Jussien, N., Pinson, É. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 228–243. Springer, Heidelberg (2012)
Perron, L., Shaw, P., Furnon, V.: Propagation guided large neighborhood search. In: Proceedings of the Principles and Practice of Constraint Programming - CP 2004, 10th International Conference, CP 2004, Toronto, Canada, pp. 468–481, September 27–October 1, 2004
Pralet, C., Verfaillie, G., Maillard, A., Hebrard, E., Jozefowiez, N., Huguet, M.-J., Desmousceaux, T., Blanc-Paques, P., Jaubert, J.: Satellite data download management with uncertainty about the generated volumes. In: Chien, S., Do, M.B., Fern, A., Ruml, W. (eds.) Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, ICAPS 2014, Portsmouth, New Hampshire, USA, June 21–26, 2014. AAAI (2014)
Prud’homme, C., Fages, J.-G., Lorca, X.: Choco3 Documentation. http://www.choco-solver.org. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S. (2014)
Schilder, F.: Event extraction and temporal reasoning in legal documents. In: Schilder, F., Katz, G., Pustejovsky, J. (eds.) Annotating, Extracting and Reasoning about Time and Events. LNCS (LNAI), vol. 4795, pp. 59–71. Springer, Heidelberg (2007)
van Beek, P., Cohen, R.: Exact and approximate reasoning about temporal relations. Computational Intelligence 6, 132–144 (1990)
Vilain, M., Kautz, H., van Beek, P.: Readings in qualitative reasoning about physical systems. In: Constraint Propagation Algorithms for Temporal Reasoning: A Revised Report, pp. 373–381. Morgan Kaufmann Publishers Inc., San Francisco (1990)
Zhou, L., Hripcsak, G.: Methodological review: Temporal reasoning with medical data-a review with emphasis on medical natural language processing. J. of Biomedical Informatics 40(2), 183–202 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Derrien, A., Fages, JG., Petit, T., Prud’homme, C. (2015). A Global Constraint for a Tractable Class of Temporal Optimization Problems. In: Pesant, G. (eds) Principles and Practice of Constraint Programming. CP 2015. Lecture Notes in Computer Science(), vol 9255. Springer, Cham. https://doi.org/10.1007/978-3-319-23219-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-23219-5_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23218-8
Online ISBN: 978-3-319-23219-5
eBook Packages: Computer ScienceComputer Science (R0)