Home // PATTERNS 2017, The Ninth International Conferences on Pervasive Patterns and Applications // View article

Temporal Patterns: Smart-type Reasoning and Applications

Authors:
Dineshen Chuckravanen
Jacqueline W. Daykin
Karen Hunsdale
Amar Seem

Keywords: Allen’s interval algebra, artificial intelligence; qual- itative temporal reasoning; scheduling; smart-type reasoning

Abstract:
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.

Pages: 88 to 92

Copyright: Copyright (c) IARIA, 2017

Publication date: February 19, 2017

Published in: conference

ISSN: 2308-3557

ISBN: 978-1-61208-534-0

Location: Athens, Greece

Dates: from February 19, 2017 to February 23, 2017