Temporal patterns: Smart-type reasoning and applications

Conference item


Chuckravanen, Dineshen, Daykin, Jacqueline, Hunsdale, Karen and Seeam, Amar 2017. Temporal patterns: Smart-type reasoning and applications. International Academy, Research, and Industry Association (IARIA).
AuthorsChuckravanen, Dineshen, Daykin, Jacqueline, Hunsdale, Karen and Seeam, Amar
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

KeywordsAllen's interval algebra, artificial intelligence, qualitative temporal reasoning, scheduling, smart-type reasoning
Year2017
PublisherInternational Academy, Research, and Industry Association (IARIA)
Web address (URL)http://hdl.handle.net/10545/624182
hdl:10545/624182
ISBN9781612085340
File
File Access Level
Open
File
File Access Level
Open
Publication datesFeb 2017
Publication process dates
Deposited07 Oct 2019, 09:28
AcceptedMay 2016
ContributorsAberythwyth University (Mauritius Branch Campus)
Permalink -

https://repository.derby.ac.uk/item/93918/temporal-patterns-smart-type-reasoning-and-applications

Download files


File
license.txt
File access level: Open

patterns_2017_7_10_78020 (1).pdf
File access level: Open

  • 2
    total views
  • 3
    total downloads
  • 1
    views this month
  • 1
    downloads this month

Export as