Allen’s Interval Algebra Makes the Difference

Tomi Janhunen; Michael Sioutis

doi:10.1007/978-3-030-46714-2_6

Allen’s Interval Algebra Makes the Difference

Tomi Janhunen^*, Michael Sioutis

^*Tämän työn vastaava kirjoittaja

Tampere University

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference article in proceedings › Scientific › vertaisarvioitu

2 Sitaatiot (Scopus)

77 Lataukset (Pure)

Abstrakti

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.

Alkuperäiskieli	Englanti
Otsikko	Declarative Programming and Knowledge Management - Conference on Declarative Programming, DECLARE 2019, Unifying INAP, WLP, and WFLP, Revised Selected Papers
Toimittajat	Petra Hofstedt, Salvador Abreu, Ulrich John, Herbert Kuchen, Dietmar Seipel
Kustantaja	Springer
Sivut	89-98
Sivumäärä	10
ISBN (painettu)	9783030467135
DOI - pysyväislinkit	https://doi.org/10.1007/978-3-030-46714-2_6
Tila	Julkaistu - 1 tammik. 2020
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisussa
Tapahtuma	22nd 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, Saksa Kesto: 9 syysk. 2019 → 12 syysk. 2019

Julkaisusarja

Nimi	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Vuosikerta	12057 LNAI
ISSN (painettu)	0302-9743
ISSN (elektroninen)	1611-3349

Conference

Conference	22nd 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)
Maa/Alue	Saksa
Kaupunki	Cottbus
Ajanjakso	09/09/2019 → 12/09/2019

Rahoitus

This research was partially supported by the project Ethical AI for the Governance of Society (ETAIROS, grant #327352) funded by the Academy of Finland.

Pääsy asiakirjaan

10.1007/978-3-030-46714-2_6

Janhunen-Sioutis_Allen's_IntervalAccepted author manuscript, 328 KB

Muut tiedostot ja linkit

Link to publication in Scopus

Siteeraa tätä

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

Janhunen, Tomi ; Sioutis, Michael. / Allen’s Interval Algebra Makes the Difference. Declarative Programming and Knowledge Management - Conference on Declarative Programming, DECLARE 2019, Unifying INAP, WLP, and WFLP, Revised Selected Papers. Toimittaja / Petra Hofstedt ; Salvador Abreu ; Ulrich John ; Herbert Kuchen ; Dietmar Seipel. Springer, 2020. Sivut 89-98 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{12756fef39274c6f98530588ab4bd488,

title = "Allen{\textquoteright}s Interval Algebra Makes the Difference",

abstract = "Allen{\textquoteright}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{\textquoteright}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{\textquoteright}s calculus for the sake of clarity, we suggest that analogous encodings can be devised for other point-based calculi, too.",

keywords = "Answer set programming, Difference constraints, Qualitative constraints, Spatial and Temporal Reasoning, Symbolic AI",

author = "Tomi Janhunen and Michael Sioutis",

year = "2020",

month = jan,

day = "1",

doi = "10.1007/978-3-030-46714-2\_6",

language = "English",

isbn = "9783030467135",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "89--98",

editor = "Petra Hofstedt and Salvador Abreu and Ulrich John and Herbert Kuchen and Dietmar Seipel",

booktitle = "Declarative Programming and Knowledge Management - Conference on Declarative Programming, DECLARE 2019, Unifying INAP, WLP, and WFLP, Revised Selected Papers",

address = "Germany",

note = "22nd 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) ; Conference date: 09-09-2019 Through 12-09-2019",

}

Janhunen, T & Sioutis, M 2020, Allen’s Interval Algebra Makes the Difference. julkaisussa P Hofstedt, S Abreu, U John, H Kuchen & D Seipel (toim), Declarative Programming and Knowledge Management - Conference on Declarative Programming, DECLARE 2019, Unifying INAP, WLP, and WFLP, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vuosikerta 12057 LNAI, Springer, Sivut 89-98, 22nd 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, Saksa, 09/09/2019. https://doi.org/10.1007/978-3-030-46714-2_6

Allen’s Interval Algebra Makes the Difference. / Janhunen, Tomi; Sioutis, Michael.
Declarative Programming and Knowledge Management - Conference on Declarative Programming, DECLARE 2019, Unifying INAP, WLP, and WFLP, Revised Selected Papers. toim. / Petra Hofstedt; Salvador Abreu; Ulrich John; Herbert Kuchen; Dietmar Seipel. Springer, 2020. s. 89-98 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vuosikerta 12057 LNAI).

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference article in proceedings › Scientific › vertaisarvioitu

TY - GEN

T1 - Allen’s Interval Algebra Makes the Difference

AU - Janhunen, Tomi

AU - Sioutis, Michael

PY - 2020/1/1

Y1 - 2020/1/1

N2 - 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.

AB - 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.

KW - Answer set programming

KW - Difference constraints

KW - Qualitative constraints

KW - Spatial and Temporal Reasoning

KW - Symbolic AI

UR - https://www.scopus.com/pages/publications/85084701202

U2 - 10.1007/978-3-030-46714-2_6

DO - 10.1007/978-3-030-46714-2_6

M3 - Conference article in proceedings

AN - SCOPUS:85084701202

SN - 9783030467135

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 89

EP - 98

BT - Declarative Programming and Knowledge Management - Conference on Declarative Programming, DECLARE 2019, Unifying INAP, WLP, and WFLP, Revised Selected Papers

A2 - Hofstedt, Petra

A2 - Abreu, Salvador

A2 - John, Ulrich

A2 - Kuchen, Herbert

A2 - Seipel, Dietmar

PB - Springer

T2 - 22nd 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)

Y2 - 9 September 2019 through 12 September 2019

ER -

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

Allen’s Interval Algebra Makes the Difference

Abstrakti

Julkaisusarja

Conference

Rahoitus

Pääsy asiakirjaan

Muut tiedostot ja linkit

Sormenjälki

Siteeraa tätä