Conference Proceedings
Range-Consistent Forbidden Regions of Allen's Relations
Nicolas Beldiceanu, Mats Carlsson, Alban Derrien, Charles Prud'homme, Andreas Schutt, Peter J Stuckey, D Salvagnin (ed.), M Lombardi (ed.)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | SPRINGER INTERNATIONAL PUBLISHING AG | Published : 2017
Abstract
For all 8192 combinations of Allen’s 13 relations between one task with origin oi and fixed length ℓi and another task with origin oj and fixed length ℓj, this paper shows how to systematically derive a formula F (oj, oj, ℓi, ℓj), where oj and oj respectively denote the earliest and the latest origin of task j, evaluating to a set of integers which are infeasible for oi for the given combination. Such forbidden regions allow maintaining range-consistency for an Allen constraint.
Grants
Awarded by GRACeFUL project - European Union
Funding Acknowledgements
The Nantes authors were partially supported both by the INRIA TASCMELB associated team and by the GRACeFUL project, which has received funding from the European Union's Horizon 2020 research and innovation programme under grant agreement No 640954.