Two-sorted Point-Interval Temporal Logics
Publication: Research - peer-review › Conference article – Annual report year: 2011
Standard
Two-sorted Point-Interval Temporal Logics. / Balbiani, Philippe; Goranko, Valentin; Sciavicco, Guido.
In: Electronic Notes in Theoretical Computer Science, Vol. 278, No. 1, 2011, p. 31-45.Publication: Research - peer-review › Conference article – Annual report year: 2011
Harvard
APA
CBE
MLA
Vancouver
Author
Bibtex
}
RIS
TY - CONF
T1 - Two-sorted Point-Interval Temporal Logics
A1 - Balbiani,Philippe
A1 - Goranko,Valentin
A1 - Sciavicco,Guido
AU - Balbiani,Philippe
AU - Goranko,Valentin
AU - Sciavicco,Guido
PB - Elsevier BV
PY - 2011
Y1 - 2011
N2 - There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points as particular, duration-less intervals. Here we develop explicitly two-sorted point-interval temporal logical framework whereby time instants (points) and time periods (intervals) are considered on a par, and the perspective can shift between them within the formal discourse. We focus on fragments involving only modal operators that correspond to the inter-sort relations between points and intervals. We analyze their expressiveness, comparative to interval-based logics, and the complexity of their satisfiability problems. In particular, we identify some previously not studied and potentially interesting interval logics. © 2011 Elsevier B.V.
AB - There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points as particular, duration-less intervals. Here we develop explicitly two-sorted point-interval temporal logical framework whereby time instants (points) and time periods (intervals) are considered on a par, and the perspective can shift between them within the formal discourse. We focus on fragments involving only modal operators that correspond to the inter-sort relations between points and intervals. We analyze their expressiveness, comparative to interval-based logics, and the complexity of their satisfiability problems. In particular, we identify some previously not studied and potentially interesting interval logics. © 2011 Elsevier B.V.
KW - Complexity
KW - Point and interval temporal logics
KW - Decidability
U2 - 10.1016/j.entcs.2011.10.004
DO - 10.1016/j.entcs.2011.10.004
JO - Electronic Notes in Theoretical Computer Science
JF - Electronic Notes in Theoretical Computer Science
SN - 1571-0661
IS - 1
VL - 278
SP - 31
EP - 45
ER -