Interval Temporal Logics over Strongly Discrete Linear Orders: the Complete Picture

Transcription

1 Interval Temporal Logics over Strongly Discrete Linear Orders: the Complete Picture D.Bresolin, D. Della Monica, A. Montanari, P. Sala, G. Sciavicco ICE-TCS, School of Computer Science, Reykjavik University, Iceland GandALF 2012 Napoli, September 7th, 2012

2 Outline Interval Temporal Logics: origin and motivations Halpern-Shoham s modal logic HS HS over strongly discrete linear orders

3 Outline Interval Temporal Logics: origin and motivations Halpern-Shoham s modal logic HS HS over strongly discrete linear orders

4 Temporal logics: origins and application fields Temporal logics play a major role in computer science automated system verification Temporal logics are (multi-)modal logics set of worlds primitive temporal entity time points/instants accessibility relations : next : finally

5 A different approach: from points to intervals worlds are intervals (time period pairs of points) set of worlds primitive temporal entity time intervals/periods accessibility relations all binary relations between pairs of intervals

6 Motivations properties intrinsically related to intervals (instead of points) points have no duration

7 Motivations properties intrinsically related to intervals (instead of points) points have no duration Example: traveling from Reykjavik to Napoli : true over a precise interval of time not true over all other intervals (starting/ending intervals, inner intervals, ecc.)

8 Motivations properties intrinsically related to intervals (instead of points) points have no duration Example: traveling from Reykjavik to Napoli : true over a precise interval of time not true over all other intervals (starting/ending intervals, inner intervals, ecc.) Several philosophical and logical paradoxes disappear: Zeno s flying arrow paradox ( if at each instant the flying arrow stands still, how is movement possible? )

9 Motivations properties intrinsically related to intervals (instead of points) points have no duration Example: traveling from Reykjavik to Napoli : true over a precise interval of time not true over all other intervals (starting/ending intervals, inner intervals, ecc.) Several philosophical and logical paradoxes disappear: Zeno s flying arrow paradox ( if at each instant the flying arrow stands still, how is movement possible? ) The dividing instant dilemma ( if the light is on and it is turned off, what is its state at the instant between the two events? )

10 Binary interval relations on linear orders J. F. Allen Maintaining knowledge about temporal intervals. Communications of the ACM, volume 26(11), pages , 1983.

11 Binary interval relations on linear orders Later J. F. Allen Maintaining knowledge about temporal intervals. Communications of the ACM, volume 26(11), pages , 1983.

12 Binary interval relations on linear orders Later After (right neighbour) J. F. Allen Maintaining knowledge about temporal intervals. Communications of the ACM, volume 26(11), pages , 1983.

13 Binary interval relations on linear orders Later After (right neighbour) Overlaps (to right) J. F. Allen Maintaining knowledge about temporal intervals. Communications of the ACM, volume 26(11), pages , 1983.

14 Binary interval relations on linear orders Later After (right neighbour) Overlaps (to right) Ends J. F. Allen Maintaining knowledge about temporal intervals. Communications of the ACM, volume 26(11), pages , 1983.

15 Binary interval relations on linear orders Later After (right neighbour) Overlaps (to right) Ends During (subinterval) J. F. Allen Maintaining knowledge about temporal intervals. Communications of the ACM, volume 26(11), pages , 1983.

16 Binary interval relations on linear orders Later After (right neighbour) Overlaps (to right) Ends During (subinterval) Begins J. F. Allen Maintaining knowledge about temporal intervals. Communications of the ACM, volume 26(11), pages , 1983.

17 Binary interval relations on linear orders Later After (right neighbour) Overlaps (to right) Ends During (subinterval) Begins 6 relations + their inverses + equality = 13 Allen s relations. J. F. Allen Maintaining knowledge about temporal intervals. Communications of the ACM, volume 26(11), pages , 1983.

18 Outline Interval Temporal Logics: origin and motivations Halpern-Shoham s modal logic HS HS over strongly discrete linear orders

19 Halpern-Shoham s modal logic of interval relations interval relations give rise to modal operators HS logic

20 Halpern-Shoham s modal logic of interval relations interval relations give rise to modal operators HS logic HS is undecidable over all significant classes of linear orders] HS91 J. Halpern and Y. Shoham A propositional modal logic of time intervals. Journal of the ACM, volume 38(4), pages , 1991.

21 Halpern-Shoham s modal logic of interval relations interval relations give rise to modal operators HS logic HS is undecidable over all significant classes of linear orders] HS91 J. Halpern and Y. Shoham A propositional modal logic of time intervals. Journal of the ACM, volume 38(4), pages , Syntax: ϕ ::= p ϕ ϕ ϕ X ϕ X { A, L, B, E, D, O, A, L, B, E, D, O }

22 Halpern-Shoham s modal logic of interval relations interval relations give rise to modal operators HS logic HS is undecidable over all significant classes of linear orders] HS91 J. Halpern and Y. Shoham A propositional modal logic of time intervals. Journal of the ACM, volume 38(4), pages , Syntax: Models: ϕ ::= p ϕ ϕ ϕ X ϕ X { A, L, B, E, D, O, A, L, B, E, D, O } M = I(D),V V : I(D) 2 AP AP atomic propositions (over intervals)

23 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 φ: φ φ

24 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 φ: φ φ

25 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 φ: φ φ

26 Formal semantics of HS - contd L : M,[d 0,d 1 ] L φ iff there exists d 2,d 3 such that 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 such that d 2 < d 3 < d 0 and M,[d 2,d 3 ] φ. current interval: L φ: L φ: φ φ

27 Formal semantics of HS - contd L : M,[d 0,d 1 ] L φ iff there exists d 2,d 3 such that 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 such that 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 such that 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 such that d 2 < d 0 < d 1 < d 3 and M,[d 2,d 3 ] φ. current interval: D φ: D φ: φ φ

28 Formal semantics of HS - contd L : M,[d 0,d 1 ] L φ iff there exists d 2,d 3 such that 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 such that 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 such that 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 such that 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 such that 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 such that d 2 < d 0 < d 3 < d 1 and M,[d 2,d 3 ] φ. current interval: O φ: O φ: φ φ

29 (Un)decidability of HS fragments: main parameters Research agenda: search for maximal decidable HS fragments; search for minimal undecidable HS fragments.

30 (Un)decidability of HS fragments: main parameters Research agenda: search for maximal decidable HS fragments; search for minimal undecidable HS fragments. Undecidability rules

31 (Un)decidability of HS fragments: main parameters Research agenda: search for maximal decidable HS fragments; search for minimal undecidable HS fragments. Undecidability rules... but meaningful exceptions exist.

32 (Un)decidability of HS fragments: main parameters Research agenda: search for maximal decidable HS fragments; search for minimal undecidable HS fragments. Undecidability rules... but meaningful exceptions exist. (Un)decidability of HS fragments depends on two factors:

33 (Un)decidability of HS fragments: main parameters Research agenda: search for maximal decidable HS fragments; search for minimal undecidable HS fragments. Undecidability rules... but meaningful exceptions exist. (Un)decidability of HS fragments depends on two factors: the set of interval modalities;

34 (Un)decidability of HS fragments: main parameters Research agenda: search for maximal decidable HS fragments; search for minimal undecidable HS fragments. Undecidability rules... but meaningful exceptions exist. (Un)decidability of HS fragments depends on two factors: the set of interval modalities; the class of interval structures (linear orders) over which the logic is interpreted.

35 Outline Interval Temporal Logics: origin and motivations Halpern-Shoham s modal logic HS HS over strongly discrete linear orders

36 Strong discreteness Strongly discrete linear orders There is a finite number of points between any pairs of points over the linear order Example natural numbers N integers Z Counterexample rational numbers Q Z+Z From now on we will talk about strongly discrete linear orders

37 The complete picture Main contributions of the paper To prove that the diagram is correct (assuming strong discreteness)

38 Relative expressive power L p A A p L p A A p Lemma The above set of inter-definabilities is sound and complete within the fragment AABB

39 Relative expressive power L p A A p L p A A p Lemma The above set of inter-definabilities is sound and complete within the fragment AABB Soundness: all equations are valid SIMPLE

40 Relative expressive power L p A A p L p A A p Lemma The above set of inter-definabilities is sound and complete within the fragment AABB Soundness: all equations are valid SIMPLE Completeness: there are no more inter-definability equations BISIMULATIONS

41 Relative expressive power L p A A p L p A A p Lemma The above set of inter-definabilities is sound and complete within the fragment AABB Soundness: all equations are valid SIMPLE Completeness: there are no more inter-definability equations BISIMULATIONS Theorem Invariance of modal formulae wrt bisimulations

42 Bisimulation between interval structures Z M 1 M 2 is a bisimulations wrt the fragment X 1 X 2...X n iff

43 Bisimulation between interval structures Z M 1 M 2 is a bisimulations wrt the fragment X 1 X 2...X n iff 1. Z-related intervals satisfy the same propositional letters, i.e.: (i 1,i 2 ) Z (p is true over i 1 p is true over i 2 )

44 Bisimulation between interval structures Z M 1 M 2 is a bisimulations wrt the fragment X 1 X 2...X n iff 1. Z-related intervals satisfy the same propositional letters, i.e.: (i 1,i 2 ) Z (p is true over i 1 p is true over i 2 ) 2. the bisimulation relation is preserved by modal operators, i.e., for every modal operator X : M 1 i 1 i 1 M 2 i 2

45 Bisimulation between interval structures Z M 1 M 2 is a bisimulations wrt the fragment X 1 X 2...X n iff 1. Z-related intervals satisfy the same propositional letters, i.e.: (i 1,i 2 ) Z (p is true over i 1 p is true over i 2 ) 2. the bisimulation relation is preserved by modal operators, i.e., for every modal operator X : (i 1,i 2 ) Z M 1 i 1 i 1 Z M 2 i 2

46 Bisimulation between interval structures Z M 1 M 2 is a bisimulations wrt the fragment X 1 X 2...X n iff 1. Z-related intervals satisfy the same propositional letters, i.e.: (i 1,i 2 ) Z (p is true over i 1 p is true over i 2 ) 2. the bisimulation relation is preserved by modal operators, i.e., for every modal operator X : (i 1,i 2 ) Z (i 1,i 1 ) X X M 1 i 1 i 1 Z M 2 i 2

47 Bisimulation between interval structures Z M 1 M 2 is a bisimulations wrt the fragment X 1 X 2...X n iff 1. Z-related intervals satisfy the same propositional letters, i.e.: (i 1,i 2 ) Z (p is true over i 1 p is true over i 2 ) 2. the bisimulation relation is preserved by modal operators, i.e., for every modal operator X : } (i 1,i 2 ) Z (i 1,i 1 ) X i 2 s.t. X M 1 i 1 i 1 Z M 2 i 2 i 2

48 Bisimulation between interval structures Z M 1 M 2 is a bisimulations wrt the fragment X 1 X 2...X n iff 1. Z-related intervals satisfy the same propositional letters, i.e.: (i 1,i 2 ) Z (p is true over i 1 p is true over i 2 ) 2. the bisimulation relation is preserved by modal operators, i.e., for every modal operator X : } { (i 1,i 2 ) Z (i 1,i 1 ) X i 2 (i s.t. 1,i 2 ) Z (i 2,i 2 ) X X M 1 i 1 i 1 Z Z M 2 i 2 X i 2

49 How to use bisimulations to disprove definability Suppose that we want to prove: X is not definable in terms of L

50 How to use bisimulations to disprove definability Suppose that we want to prove: X is not definable in terms of L We must provide: 1. two models M 1 and M 2

51 How to use bisimulations to disprove definability Suppose that we want to prove: We must provide: X is not definable in terms of L 1. two models M 1 and M 2 2. a bisimulation Z M 1 M 2 wrt fragment L

52 How to use bisimulations to disprove definability Suppose that we want to prove: We must provide: X is not definable in terms of L 1. two models M 1 and M 2 2. a bisimulation Z M 1 M 2 wrt fragment L 3. two interval i 1 M 1 and i 2 M 2 such that a. i 1 and i 2 are Z-related b. M 1,i 1 X p and M 2,i 2 X p

53 How to use bisimulations to disprove definability Suppose that we want to prove: We must provide: X is not definable in terms of L 1. two models M 1 and M 2 2. a bisimulation Z M 1 M 2 wrt fragment L 3. two interval i 1 M 1 and i 2 M 2 such that a. i 1 and i 2 are Z-related b. M 1,i 1 X p and M 2,i 2 X p By contradiction If X is definable in terms of L, then X p is.

54 How to use bisimulations to disprove definability Suppose that we want to prove: We must provide: X is not definable in terms of L 1. two models M 1 and M 2 2. a bisimulation Z M 1 M 2 wrt fragment L 3. two interval i 1 M 1 and i 2 M 2 such that a. i 1 and i 2 are Z-related b. M 1,i 1 X p and M 2,i 2 X p By contradiction If X is definable in terms of L, then X p is. Truth of X p should have been preserved by Z, but X p is true in i 1 (in M 1 ) and false in i 2 (in M 2 )

55 How to use bisimulations to disprove definability Suppose that we want to prove: We must provide: X is not definable in terms of L 1. two models M 1 and M 2 2. a bisimulation Z M 1 M 2 wrt fragment L 3. two interval i 1 M 1 and i 2 M 2 such that a. i 1 and i 2 are Z-related b. M 1,i 1 X p and M 2,i 2 X p By contradiction If X is definable in terms of L, then X p is. Truth of X p should have been preserved by Z, but X p is true in i 1 (in M 1 ) and false in i 2 (in M 2 ) contradiction

56 A is not definable in terms of ABBL A bisimulation wrt fragment ABBL but not A Bisimulation wrt ABBL (AP = {p}): models: M 1 = I({0,1,2}),V 1,M 2 = I({0,1,2}),V

57 A is not definable in terms of ABBL A bisimulation wrt fragment ABBL but not A Bisimulation wrt ABBL (AP = {p}): models: M 1 = I({0,1,2}),V 1,M 2 = I({0,1,2}),V 2 V1 (p) = {[1,2]} 0 1 p

58 A is not definable in terms of ABBL A bisimulation wrt fragment ABBL but not A Bisimulation wrt ABBL (AP = {p}): models: M 1 = I({0,1,2}),V 1,M 2 = I({0,1,2}),V 2 V1 (p) = {[1,2]} V2 (p) = 0 1 p p 2

59 A is not definable in terms of ABBL A bisimulation wrt fragment ABBL but not A Bisimulation wrt ABBL (AP = {p}): models: M 1 = I({0,1,2}),V 1,M 2 = I({0,1,2}),V 2 V1 (p) = {[1,2]} V2 (p) = bisimulation relation Z = { } 0 1 p p 2

60 A is not definable in terms of ABBL A bisimulation wrt fragment ABBL but not A Bisimulation wrt ABBL (AP = {p}): models: M 1 = I({0,1,2}),V 1,M 2 = I({0,1,2}),V 2 V1 (p) = {[1,2]} V2 (p) = bisimulation relation Z = {([0,1],[0,1]), } 0 1 p p 2

61 A is not definable in terms of ABBL A bisimulation wrt fragment ABBL but not A Bisimulation wrt ABBL (AP = {p}): models: M 1 = I({0,1,2}),V 1,M 2 = I({0,1,2}),V 2 V1 (p) = {[1,2]} V2 (p) = bisimulation relation Z = {([0,1],[0,1]),([0,2],[0,2])} 0 1 p p 2

62 A is not definable in terms of ABBL A bisimulation wrt fragment ABBL but not A Bisimulation wrt ABBL (AP = {p}): models: M 1 = I({0,1,2}),V 1,M 2 = I({0,1,2}),V 2 V1 (p) = {[1,2]} V2 (p) = bisimulation relation Z = {([0,1],[0,1]),([0,2],[0,2])} 0 1 p p 2 M 1,[0,1] A p and M 2,[0,1] A p

63 A is not definable in terms of ABBL A bisimulation wrt fragment ABBL but not A Bisimulation wrt ABBL (AP = {p}): models: M 1 = I({0,1,2}),V 1,M 2 = I({0,1,2}),V 2 V1 (p) = {[1,2]} V2 (p) = bisimulation relation Z = {([0,1],[0,1]),([0,2],[0,2])} 0 1 p p 2 M 1,[0,1] A p and M 2,[0,1] A p the thesis

64 Undecidability

65 Undecidability All fragments not displayed in diagram are undecidable AB, AB, AE, and AE are undecidable

66 Undecidability Reduction from the non-emptiness problem for incrementing counter automata over ω-words All fragments not displayed in diagram are undecidable AB, AB, AE, and AE are undecidable

67 Complexity of decidable fragments

68 Complexity of decidable fragments NP-completeness BBLL and EELL are in NP

69 Complexity of decidable fragments Other complexity results (membership and hardness) P. Sala, Decidability of Interval Temporal Logic, PhD Thesis, 2010 Bresolin et al., Interval Temporal Logics over Finite Linear Orders: the Complete Picture, ECAI, 2012 NP-completeness BBLL and EELL are in NP

70 Strongly discrete linear orders: recall the picture for

71 The complete picture over natural numbers

72 Conclusions and future work We identified all decidable HS fragments over the class of strongly discrete linear orders and we classified them in terms of both relative expressive power and complexity 44 expressively-different decidable fragments complexity ranges between NP and EXPSPACE

73 Conclusions and future work We identified all decidable HS fragments over the class of strongly discrete linear orders and we classified them in terms of both relative expressive power and complexity 44 expressively-different decidable fragments complexity ranges between NP and EXPSPACE We got the same classification for N 47 expressively-different decidable fragments complexity ranges between NP and non-primitive recursive

74 Conclusions and future work We identified all decidable HS fragments over the class of strongly discrete linear orders and we classified them in terms of both relative expressive power and complexity 44 expressively-different decidable fragments complexity ranges between NP and EXPSPACE We got the same classification for N 47 expressively-different decidable fragments complexity ranges between NP and non-primitive recursive Recently we provided the same classification for the class of finite linear orders [Bresolin et al., ECAI 2012]

75 Conclusions and future work We identified all decidable HS fragments over the class of strongly discrete linear orders and we classified them in terms of both relative expressive power and complexity 44 expressively-different decidable fragments complexity ranges between NP and EXPSPACE We got the same classification for N 47 expressively-different decidable fragments complexity ranges between NP and non-primitive recursive Recently we provided the same classification for the class of finite linear orders [Bresolin et al., ECAI 2012] Our goal: To provide the classification for all significant classes of linear orders (dense and all)

76 Conclusions and future work We identified all decidable HS fragments over the class of strongly discrete linear orders and we classified them in terms of both relative expressive power and complexity 44 expressively-different decidable fragments complexity ranges between NP and EXPSPACE We got the same classification for N 47 expressively-different decidable fragments complexity ranges between NP and non-primitive recursive Recently we provided the same classification for the class of finite linear orders [Bresolin et al., ECAI 2012] Our goal: To provide the classification for all significant classes of linear orders (dense and all) Thank you!