Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Range-consistent forbidden regions of allen’s relations
IMT Atlantique, France.
RISE - Research Institutes of Sweden, ICT, SICS. (Computer Systems Laboratory)ORCID iD: 0000-0003-3079-8095
Université de Bretagne-Sud, France.
IMT Atlantique, France.
Show others and affiliations
2017 (English)Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Springer, 2017. p. 21-29
Series
LNCS ; 10335
Keywords [en]
Computer programming, Operations research, Forbidden region, Constraint theory
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-31152DOI: 10.1007/978-3-319-59776-8_2Scopus ID: 2-s2.0-85020804195ISBN: 9783319597751 (print)OAI: oai:DiVA.org:ri-31152DiVA, id: diva2:1135634
Conference
14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, CPAIOR 2017. 5-8 June 2017
Note

Funding details: 640954, Horizon 2020; Funding text: 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.

Available from: 2017-08-23 Created: 2017-08-23 Last updated: 2018-08-24Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Carlsson, Mats

Search in DiVA

By author/editor
Carlsson, Mats
By organisation
SICS
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 16 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.35.4