Temporal Patterns: Smart-type Reasoning and Applications

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

Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion CynhadleddTrafodion Cynhadledd (Nid-Cyfnodolyn fathau)


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
Iaith wreiddiolSaesneg
TeitlPATTERNS 2017: The Ninth International Conferences on Pervasive Patterns and Applications
CyhoeddwrInternational Academy, Research, and Industry Association (IARIA)
ISBN (Argraffiad)978-1-61208-534-0
StatwsCyhoeddwyd - 19 Chwef 2017
DigwyddiadNinth International Conferences on Pervasive Patterns and Applications - Athens, Groeg
Hyd: 19 Chwef 201723 Chwef 2017


CynhadleddNinth International Conferences on Pervasive Patterns and Applications
Cyfnod19 Chwef 201723 Chwef 2017

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'Temporal Patterns: Smart-type Reasoning and Applications'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn