Temporal Patterns: Smart-type Reasoning and Applications

Dineshen Chuckravanen, Jacqueline W. Daykin, Karen Hunsdale, Amar Seeam

Research output: Chapter in Book/Report/Conference proceedingConference Proceeding (Non-Journal item)


Allen’s interval algebra is a calculus for temporal reasoning that was introduced in 1983. Reasoning with quali- tative time in Allen’s full interval algebra is nondeterministic polynomial time (NP) complete. Research since 1995 identified maximal tractable subclasses of this algebra via exhaustive computer search and also other ad-hoc methods. In 2003, the full classification of complexity for satisfiability problems over con- straints in Allen’s interval algebra was established algebraically. Recent research proposed scheduling based on the Fishburn- Shepp correlation inequality for posets. We describe here three potential temporal-related application areas as candidates for scheduling using this inequality
Original languageEnglish
Title of host publicationPATTERNS 2017: The Ninth International Conferences on Pervasive Patterns and Applications
PublisherInternational Academy, Research, and Industry Association (IARIA)
ISBN (Print)978-1-61208-534-0
Publication statusPublished - 19 Feb 2017
EventNinth International Conferences on Pervasive Patterns and Applications - Athens, Greece
Duration: 19 Feb 201723 Feb 2017


ConferenceNinth International Conferences on Pervasive Patterns and Applications
Period19 Feb 201723 Feb 2017


  • Allen's interval algebra
  • artificial intelligence
  • qualitative temporal reasoning
  • scheduling
  • smart-type reasoning


Dive into the research topics of 'Temporal Patterns: Smart-type Reasoning and Applications'. Together they form a unique fingerprint.

Cite this