interval temporal logics a selective overview dedicated
play

Interval Temporal Logics: a selective overview Dedicated to the - PowerPoint PPT Presentation

Interval Temporal Logics: a selective overview Dedicated to the memory of Sasha Chagrov Valentin Goranko Department of Philosophy, Stockholm University Advances in Modal Logic 2016 Budapest, August 30, 2016 V Goranko Interval Temporal Logics:


  1. Interval Temporal Logics: a selective overview Dedicated to the memory of Sasha Chagrov Valentin Goranko Department of Philosophy, Stockholm University Advances in Modal Logic 2016 Budapest, August 30, 2016 V Goranko

  2. Interval Temporal Logics: a selective overview Dedicated to the memory of Sasha Chagrov Valentin Goranko Department of Philosophy, Stockholm University Advances in Modal Logic 2016 Budapest, August 30, 2016 V Goranko

  3. Outline Introduction. Interval structures and relations Interval temporal logics Halpern-Shoham’s logic HS and its fragments Relative expressiveness of the fragments of HS Undecidability Decidability Representation theorems and axiomatic systems V Goranko

  4. Interval-based temporal reasoning: origins and applications Interval-based temporal reasoning: reasoning about time, where the primary concept is ‘time interval’, rather than ‘time instant’. Origins: ◮ Philosophy, in particular philosophy and ontology of time. ◮ Linguistics: analysis of progressive tenses, semantics of natural languages. ◮ Artificial intelligence: temporal knowledge representation, temporal planning, theory of events, etc. ◮ Computer science: specification and design of hardware systems, concurrent real-time processes, temporal databases, etc. V Goranko

  5. Preliminaries: Intervals and interval structures D = � D , < � : partially ordered set. An interval in D : ordered pair [ a , b ] , where a , b ∈ D and a ≤ b . If a < b then [ a , b ] is a strict interval; [ a , a ] is a point interval. I + ( D ) : the (non-strict) interval structure over D , consisting of the set of all intervals over D . I − ( D ) the strict interval structure over D , consisting of the set of all strict intervals over D . We will use I ( D ) to denote either of these. In this talk I will restrict attention to linear interval structures, i.e. interval structures over linear orders. Many of the results extend to partial orders with the linear intervals property. V Goranko

  6. Binary interval relations on linear orders J. F. Allen: Maintaining knowledge about temporal intervals. Communications of the ACM , volume 26(11), pages 832-843, 1983. L ater A fter (right neighbour) O verlaps (on the right) E nds (the current interval) D uring (the current interval) B egins (the current interval) 6 relations + their inverses + equality = 13 Allen’s relations. V Goranko

  7. Ternary relations between intervals Splitting of an interval in two defines the ternary relation Chop: k i j i.e., Cijk if i meets j , i begins k , and j ends k . The relation Chop has 5 associated ‘residual’ relations, e.g.: Dijk iff Cikj , Tijk iff Ckij . V Goranko

  8. Outline Introduction. Interval structures and relations Interval temporal logics Halpern-Shoham’s logic HS and its fragments Relative expressiveness of the fragments of HS Undecidability Decidability Representation theorems and axiomatic systems V Goranko

  9. Halpern-Shoham’s modal logic of interval relations HS Every binary interval relation gives rise to a unary modal operator over relational interval structures. Thus, a multimodal logic arises: L ater � L � � L � A fter � A � � A � O verlaps � O � � O � E nds � E � � E � D uring � D � � D � B egins � B � � B � J. Halpern and Y. Shoham: A propositional modal logic of time intervals. Journal of the ACM , volume 38(4), pages 935-962, 1991. V Goranko

  10. Other important interval logics ✄ Moszkowski’s (1983) Propositional Interval Temporal Logic (PITL) Formulae: φ ::= p | ¬ φ | φ ∧ ψ | � φ | φ ; ψ , where � is Nexttime and ; is Chop. Models of PITL : based on discrete linear orderings. PITL -formulae are evaluated on discrete intervals: finite sequences of states σ = s 0 , s 1 , . . . , s n , with n ≥ 0. ✄ Zhou, Hoare, & Ravn’s Duration calculus (DC): extension of the PITL framework with the notions of state and state duration. ✄ Venema’s logic CDT involving binary modalities C , D , and T , associated with the relation Chop and its residuals. Hereafter I will focus on Halpern-Shoham’s logic HS and its fragments. Denoted by listing the occurring modalities, e.g. D , BE , OBAA , etc. V Goranko

  11. Main topics on fragments of HS and current state of the art ◮ Classification and relative expressiveness . Current state: almost completed. ◮ Decidability / undecidability of the validities. Current state: Most (>90%) of HS’ fragments are undecidable. But, there are several non-trivial decidability results. Decision methods: mainly tableau-based. ◮ Representation theorems for interval structures. Current state: A number of results, but many open cases, too. Not a systematic picture yet. ◮ Axiomatic systems and completeness results . Current state: Few results. Not much explored. ◮ Model checking . Current state: Still early stage. Some interesting developments. ◮ Extensions . Current state: mainly metric and two-sorted (point-interval). V Goranko

  12. Strict and non-strict models for propositional interval logics AP : a set of atomic propositions (over intervals). Non-strict interval model: M + = � I ( D ) + , V � , where V : AP �→ 2 I ( D ) + . Strict interval model: M − = � I ( D ) − , V � , where V : AP �→ 2 I ( D ) − . Thus, every V ( p ) can be viewed as a binary relation on D . Hereafter M will denote a strict or a non-strict interval model. V Goranko

  13. Formal semantics of HS � B � : M , [ d 0 , d 1 ] � � B � φ iff there exists d 2 such that d 0 ≤ d 2 < d 1 and M , [ d 0 , d 2 ] � φ . � B � : M , [ d 0 , d 1 ] � � B � φ iff there exists d 2 such that d 1 < d 2 and M , [ d 0 , d 2 ] � φ . current interval: φ � B � φ : φ � B � φ : V Goranko

  14. Formal semantics of HS � B � : M , [ d 0 , d 1 ] � � B � φ iff there exists d 2 such that d 0 ≤ d 2 < d 1 and M , [ d 0 , d 2 ] � φ . � B � : M , [ d 0 , d 1 ] � � B � φ iff there exists d 2 such that d 1 < d 2 and M , [ d 0 , d 2 ] � φ . � E � : M , [ d 0 , d 1 ] � � E � φ iff there exists d 2 such that d 0 < d 2 ≤ d 1 and M , [ d 2 , d 1 ] � φ . � E � : M , [ d 0 , d 1 ] � � E � φ iff there exists d 2 such that d 2 < d 0 and M , [ d 2 , d 1 ] � φ . current interval: φ � E � φ : φ � E � φ : V Goranko

  15. Formal semantics of HS � B � : M , [ d 0 , d 1 ] � � B � φ iff there exists d 2 such that d 0 ≤ d 2 < d 1 and M , [ d 0 , d 2 ] � φ . � B � : M , [ d 0 , d 1 ] � � B � φ iff there exists d 2 such that d 1 < d 2 and M , [ d 0 , d 2 ] � φ . � E � : M , [ d 0 , d 1 ] � � E � φ iff there exists d 2 such that d 0 < d 2 ≤ d 1 and M , [ d 2 , d 1 ] � φ . � E � : M , [ d 0 , d 1 ] � � E � φ iff there exists d 2 such that d 2 < d 0 and M , [ d 2 , d 1 ] � φ . � A � : M , [ d 0 , d 1 ] � � A � φ iff there exists d 2 such that d 1 < d 2 and M , [ d 1 , d 2 ] � φ . � A � : M , [ d 0 , d 1 ] � � A � φ iff there exists d 2 such that d 2 < d 0 and M , [ d 2 , d 0 ] � φ . current interval: φ � A � φ : φ � A � φ : V Goranko

  16. Formal semantics of HS - contd’ � L � : M , [ d 0 , d 1 ] � � L � φ iff there exists d 2 , d 3 s.t. d 1 < d 2 < d 3 and M , [ d 2 , d 3 ] � φ . � L � : M , [ d 0 , d 1 ] � � L � φ iff there exists d 2 , d 3 s.t. d 2 < d 3 < d 0 and M , [ d 2 , d 3 ] � φ . current interval: φ � L � φ : φ � L � φ : V Goranko

  17. Formal semantics of HS - contd’ � L � : M , [ d 0 , d 1 ] � � L � φ iff there exists d 2 , d 3 s.t. d 1 < d 2 < d 3 and M , [ d 2 , d 3 ] � φ . � L � : M , [ d 0 , d 1 ] � � L � φ iff there exists d 2 , d 3 s.t. d 2 < d 3 < d 0 and M , [ d 2 , d 3 ] � φ . � D � : M , [ d 0 , d 1 ] � � D � φ iff there exists d 2 , d 3 s.t. d 0 < d 2 < d 3 < d 1 and M , [ d 2 , d 3 ] � φ . � D � : M , [ d 0 , d 1 ] � � D � φ iff there exists d 2 , d 3 s.t. d 2 < d 0 < d 1 < d 3 and M , [ d 2 , d 3 ] � φ . current interval: φ � D � φ : φ � D � φ : V Goranko

  18. Formal semantics of HS - contd’ � L � : M , [ d 0 , d 1 ] � � L � φ iff there exists d 2 , d 3 s.t. d 1 < d 2 < d 3 and M , [ d 2 , d 3 ] � φ . � L � : M , [ d 0 , d 1 ] � � L � φ iff there exists d 2 , d 3 s.t. d 2 < d 3 < d 0 and M , [ d 2 , d 3 ] � φ . � D � : M , [ d 0 , d 1 ] � � D � φ iff there exists d 2 , d 3 s.t. d 0 < d 2 < d 3 < d 1 and M , [ d 2 , d 3 ] � φ . � D � : M , [ d 0 , d 1 ] � � D � φ iff there exists d 2 , d 3 s.t. d 2 < d 0 < d 1 < d 3 and M , [ d 2 , d 3 ] � φ . � O � : M , [ d 0 , d 1 ] � � O � φ iff there exists d 2 , d 3 s.t. d 0 < d 2 < d 1 < d 3 and M , [ d 2 , d 3 ] � φ . � O � : M , [ d 0 , d 1 ] � � O � φ iff there exists d 2 , d 3 s.t. d 2 < d 0 < d 3 < d 1 and M , [ d 2 , d 3 ] � φ . current interval: φ � O � φ : φ � O � φ : V Goranko

Recommend


More recommend