Allen’s Interval Algebra Makes the Difference

Tomi Janhunen*, Michael Sioutis

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Abstract

Allen’s Interval Algebra constitutes a framework for reasoning about temporal information in a qualitative manner. In particular, it uses intervals, i.e., pairs of endpoints, on the timeline to represent entities corresponding to actions, events, or tasks, and binary relations such as precedes and overlaps to encode the possible configurations between those entities. Allen’s calculus has found its way in many academic and industrial applications that involve, most commonly, planning and scheduling, temporal databases, and healthcare. In this paper, we present a novel encoding of Interval Algebra using answer-set programming (ASP) extended by difference constraints, i.e., the fragment abbreviated as ASP(DL), and demonstrate its performance via a preliminary experimental evaluation. Although our ASP encoding is presented in the case of Allen’s calculus for the sake of clarity, we suggest that analogous encodings can be devised for other point-based calculi, too.

Original languageEnglish
Title of host publicationDeclarative Programming and Knowledge Management - Conference on Declarative Programming, DECLARE 2019, Unifying INAP, WLP, and WFLP, Revised Selected Papers
EditorsPetra Hofstedt, Salvador Abreu, Ulrich John, Herbert Kuchen, Dietmar Seipel
PublisherSPRINGER
Pages89-98
Number of pages10
ISBN (Print)9783030467135
DOIs
Publication statusPublished - 1 Jan 2020
MoE publication typeA4 Article in a conference publication
Event22nd International Conference on Applications of Declarative Programming and Knowledge Management (INAP), the 33rd Workshop on Logic Programming (WLP), and the 27th Workshop on Functional and Constraint Logic Programming (WFLP) - Cottbus, Germany
Duration: 9 Sep 201912 Sep 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12057 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference22nd International Conference on Applications of Declarative Programming and Knowledge Management (INAP), the 33rd Workshop on Logic Programming (WLP), and the 27th Workshop on Functional and Constraint Logic Programming (WFLP)
CountryGermany
CityCottbus
Period09/09/201912/09/2019

Keywords

  • Answer set programming
  • Difference constraints
  • Qualitative constraints
  • Spatial and Temporal Reasoning
  • Symbolic AI

Fingerprint Dive into the research topics of 'Allen’s Interval Algebra Makes the Difference'. Together they form a unique fingerprint.

  • Cite this

    Janhunen, T., & Sioutis, M. (2020). Allen’s Interval Algebra Makes the Difference. In P. Hofstedt, S. Abreu, U. John, H. Kuchen, & D. Seipel (Eds.), Declarative Programming and Knowledge Management - Conference on Declarative Programming, DECLARE 2019, Unifying INAP, WLP, and WFLP, Revised Selected Papers (pp. 89-98). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12057 LNAI). SPRINGER . https://doi.org/10.1007/978-3-030-46714-2_6