Change search
ReferencesLink to record
Permanent link

Direct link
Range-consistent forbidden regions of Allen's relations
RISE, Swedish ICT, SICS. RISE, Swedish ICT, SICS, Computer Systems Laboratory.
Show others and affiliations
Number of Authors: 5
2016 (English)Report (Other academic)
Abstract [en]

For all 8192 combinations of Allen's 13 relations between one task with origin oi and fixed length li and another task with origin oj and fixed length lj, we give a formula F(min(oj), max(oj), li, lj), where min(oj) and max(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 are useful e.g. in a range-consistency maintaining propagator for an Allen constraint in finite domain constraint programming.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2016, 10.
Series
SICS Technical Report, ISSN 1100-3154 ; 2016:02
Keyword [en]
global constraint, Allen relation
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-24549OAI: oai:DiVA.org:ri-24549DiVA: diva2:1043633
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(5393 kB)9 downloads
File information
File name FULLTEXT01.pdfFile size 5393 kBChecksum SHA-512
42acc5d383c1c105dc9db3fcae1ba5e0f22f96542f46cead3f51f732bf5ae1dd9b67fd46e1127bdf813eb42722fe6bba70a9befaf3f0c35411dc51b62a842195
Type fulltextMimetype application/pdf

By organisation
SICSComputer Systems Laboratory
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 9 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 12 hits
ReferencesLink to record
Permanent link

Direct link