Some Observations on Durations, Scheduling and Allen's Algebra
2000 (English)In: Principles and Practice of Constraint Programming, 6th International Conference CP-2000,2000, Heidelberg: Springer Berlin/Heidelberg, 2000, Vol. 1894, 484-489 p.Conference paper (Refereed)
Representing and reasoning about time has for a long time been acknowledged as one of the core areas of artificial intelligence and a large number of formalisms for temporal constraint reasoning (TCR) have been proposed in the literature. Important examples are the time point algebra, Allen's algebra, simple temporal constraints, and the qualitative algebra. These formalisms are almost exclusively dealing with the relative positions of time points (qualitative information) and/or the absolute position of time points on the time line (quantitative or metric information).
Place, publisher, year, edition, pages
Heidelberg: Springer Berlin/Heidelberg, 2000. Vol. 1894, 484-489 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 1894
scheduling, allen's algebra
IdentifiersURN: urn:nbn:se:liu:diva-24614DOI: 10.1007/3-540-45349-0_35Local ID: 6790ISBN: 978-3-540-41053-9 (print)ISBN: 978-3-540-45349-9 (online)OAI: oai:DiVA.org:liu-24614DiVA: diva2:244936
6th International Conference on Principles and Practice of Constraint Programming, 18-21 September 2000, Singapore