Metric Propositional Neighborhood Logics
|
|
- Owen Garrett
- 5 years ago
- Views:
Transcription
1 Metric Propositional Neighborhood Logics D. Bresolin, D. Della Monica, V. Goranko, A. Montanari, and G. Sciavicco University of Murcia Please notice: these slides have been mostly produced by Dario Della Monica (University of Udine), who, in turn, borrowed many ideas from Davide Bresolin s slides (University of Verona). ECAI Lisbon Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 1 / 40
2 Outline 1 Interval Temporal Logics 2 Extending PNL with Metric Features 3 Decidability of MPNL l 4 Expressive Completeness Results 5 Classification w.r.t. Expressive Power 6 Conclusions and Future Research Directions Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 2 / 40
3 Outline 1 Interval Temporal Logics 2 Extending PNL with Metric Features 3 Decidability of MPNL l 4 Expressive Completeness Results 5 Classification w.r.t. Expressive Power 6 Conclusions and Future Research Directions Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 3 / 40
4 Time and logics Studying time and its structure is of great importance in computer science: Artificial Intelligence. Planning, Natural Language Recognition,... Databases. Temporal Databases. Formal methods. Specification and Verification of Systems and Protocols, Model Checking,... Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 4 / 40
5 Points vs. intervals Usually, time is formalized as a (usually linearly ordered) set of points. In point-based temporal logics, formulas are interpreted directly over points. In interval-based ones, they are interpreted over intervals. In this case, intervals can also be given of a duration. It is well-known that interval-based logics are much more difficult to deal with. Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 5 / 40
6 What is an interval? Definition Given a linear order D = D,< : an interval in D is a pair [d 0, d 1 ] such that d 0 < d 1 (or d 0 d 1 ); I(D) is the set of all intervals on D; D, I(D) is an interval structure. We consider intervals as pairs of time points. A point d D belongs to [d 0, d 1 ] if d 0 d d 1. Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 6 / 40
7 Allen s binary relations There are 13 different binary relations between intervals: together with their inverses. Between points we have only three binary relations! Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 7 / 40
8 Allen s binary relations There are 13 different binary relations between intervals: later together with their inverses. Between points we have only three binary relations! Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 7 / 40
9 Allen s binary relations There are 13 different binary relations between intervals: later after/meets together with their inverses. Between points we have only three binary relations! Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 7 / 40
10 Allen s binary relations There are 13 different binary relations between intervals: later after/meets overlaps together with their inverses. Between points we have only three binary relations! Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 7 / 40
11 Allen s binary relations There are 13 different binary relations between intervals: later after/meets overlaps ends/finishes together with their inverses. Between points we have only three binary relations! Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 7 / 40
12 Allen s binary relations There are 13 different binary relations between intervals: later after/meets overlaps ends/finishes during together with their inverses. Between points we have only three binary relations! Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 7 / 40
13 Allen s binary relations There are 13 different binary relations between intervals: later after/meets overlaps ends/finishes during begins/starts together with their inverses. Between points we have only three binary relations! Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 7 / 40
14 Allen s binary relations There are 13 different binary relations between intervals: later after/meets overlaps ends/finishes during begins/starts L A O E D B together with their inverses. Between points we have only three binary relations! Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 7 / 40
15 Allen s binary relations There are 13 different binary relations between intervals: later after/meets overlaps ends/finishes during begins/starts L L A A O O E E D D B B together with their inverses. Between points we have only three binary relations! Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 7 / 40
16 Allen s binary relations There are 13 different binary relations between intervals: later after/meets overlaps ends/finishes during begins/starts L L A A O O E E D D B B together with their inverses. Between points we have only three binary relations! Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 7 / 40
17 Interval temporal logics Interval temporal logics, such as HS [Halpern and Shoham, 1991] and CDT [Venema, 1991], are very expressive (compared to point-based temporal logics) Most interval temporal logics are (highly) undecidable Problem Find expressive, yet decidable, interval temporal logics. Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 8 / 40
18 A simple path to decidability Interval logics make it possible to express properties of pairs of time points rather than of single time points. How has decidability been achieved? By imposing suitable syntactic and/or semantic restrictions that allow one to reduce interval logics to point-based ones: Constraining interval modalities B B and E E fragments of HS. Constraining temporal structures Split Logics: any interval can be chopped in at most one way (Split Structures). Constraining semantic interpretations Local QPITL: a propositional variable is true over an interval if and only if it is true over its starting point (Locality Principle). Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 9 / 40
19 An alternative path to decidability A major challenge Identify expressive enough, yet decidable, logics which are genuinely interval-based. What is a genuinely interval-based logic? A logic is genuinely interval-based if it cannot be directly translated into a point-based logic and does not invoke locality, or any other semantic restriction reducing the interval-based semantics to the point-based one. Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 10 / 40
20 Known decidability results The picture of decidable/undecidable non-metric interval logics is almost complete Propositional Neighborhood Logic (AA) is the first discovered decidable genuine interval logic (and maximal in most cases, including N) the logic ABBA is maximal decidable over finite DDBBLL is maximal decidable over dense the vast majority of all other fragments is undecidable no previous known results for metric extension of any interval logic We will present a family of metric extensions of PNL over natural numbers: Decidability proof of the most expressive fragment (MPNL l ) Expressive completeness and undecidable extension ( FO 2 [N,=,<,s]) Classification of all metric fragments w.r.t. expressive power Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 11 / 40
21 Outline 1 Interval Temporal Logics 2 Extending PNL with Metric Features 3 Decidability of MPNL l 4 Expressive Completeness Results 5 Classification w.r.t. Expressive Power 6 Conclusions and Future Research Directions Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 12 / 40
22 The logic PNL Semantics PNL is based on the neighborhood operators meets and met-by: A ϕ ϕ { }} {{ }} { meets : met by : d 0 d 1 d 2 ϕ A ϕ {}}{{}}{ Metric formulas can constrain the length of the current interval or the length of reachable intervals d 2 d 0 d 1 Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 13 / 40
23 The addition of a metric aspect Metric extensions of PNL over the integers 1 Extensions of the modal operators A ( r ) and A ( l ): =k r, >k r, [k,k ] l, (k,k ) l,... S: set of all possible metric extensions of PNL modalities 2 Introduction of atomic length constraints: len >k, len k, len =k,... L: set of all atomic length constraints Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 14 / 40
24 The addition of a metric aspect Metric extensions of PNL over the integers 1 Extensions of the modal operators A ( r ) and A ( l ): =k r, >k r, [k,k ] l, (k,k ) l,... S: set of all possible metric extensions of PNL modalities 2 Introduction of atomic length constraints: len >k, len k, len =k,... L: set of all atomic length constraints Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 14 / 40
25 The addition of a metric aspect Metric extensions of PNL over the integers 1 Extensions of the modal operators A ( r ) and A ( l ): =k r, >k r, [k,k ] l, (k,k ) l,... S: set of all possible metric extensions of PNL modalities 2 Introduction of atomic length constraints: len >k, len k, len =k,... L: set of all atomic length constraints Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 14 / 40
26 The addition of a metric aspect Metric extensions of PNL over the integers 1 Extensions of the modal operators A ( r ) and A ( l ): =k r, >k r, [k,k ] l, (k,k ) l,... S: set of all possible metric extensions of PNL modalities 2 Introduction of atomic length constraints: len >k, len k, len =k,... L: set of all atomic length constraints Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 14 / 40
27 The addition of a metric aspect Metric extensions of PNL over the integers 1 Extensions of the modal operators A ( r ) and A ( l ): =k r, >k r, [k,k ] l, (k,k ) l,... S: set of all possible metric extensions of PNL modalities 2 Introduction of atomic length constraints: len >k, len k, len =k,... L: set of all atomic length constraints MPNL = {MPNL S L S, S S, L L} set of all metric extenstions of PNL Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 14 / 40
28 MPNL l : a simple metric interval logic Propositional Neighborhood Logic with atomic length constraints Syntax of MPNL l ϕ ::= p ϕ ϕ ϕ A ϕ A ϕ len =k Proposition MPNL l is the most powerful logic in MPNL Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 15 / 40
29 The leaking gas burner Every time the flame is ignited, a small amount of gas can leak from the burner. The propositional letter Gas is used to indicate the gas is flowing. The propositional letter Flame is true when the gas is burning. Safety of the gas burner: 1 It is never the case that the gas is leaking for more than 2 seconds. 2 The gas burner will not leak for 30 seconds after the last leakage. Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 16 / 40
30 Safety of the gas burner in MPNL l Universal modality: ϕ holds everywhere in the future [G]ϕ ::= ϕ [A]ϕ [A][A]ϕ Leaking = gas flowing but not burning [G](Leak Gas Flame) Safety properties: 1 [G](Leak len 2 ) 2 [G](Leak A (len <30 A Leak)) Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 17 / 40
31 MPNL l is simple but powerful Metric Until MPNL l is expressive enough to encode a metric form of Until: p is true at a point in the future at distance k from the current interval and, until that point, q is true (pointwise) A (len =k A (len =0 p)) [A](len <k A (len =0 q)) Unbounded until is not expressible in MPNL l. Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 18 / 40
32 MPNL l is simple but powerful Metric version of Allen s relations MPNL l is expressive enough to encode some metric form of all (but one) Allen s relation: p holds over intervals of length l, with k l k [G](p len k len k ) Any p-interval begins a q-interval [G] k i=k (p len =i l r (len >i q)) Any p-interval contains a q-interval [G] k i=k (p len =i j 0,j+j <i ( l r (len =j r (len =j q)))) Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 19 / 40
33 Outline 1 Interval Temporal Logics 2 Extending PNL with Metric Features 3 Decidability of MPNL l 4 Expressive Completeness Results 5 Classification w.r.t. Expressive Power 6 Conclusions and Future Research Directions Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 20 / 40
34 Basic ingredients Definition An atom is a maximal, locally consistent set of subformulae of ϕ. A relation connecting atoms Connect every pair of atoms that can be associated with neighbor intervals preserving the universal quantifiers: A R ϕ B iff { 1 [A]ψ A ψ B 2 [A]ψ B ψ A Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 21 / 40
35 Labelled Interval Structures Definition A Labelled Interval Structure (LIS) is a pair I(D), L where: I(D) is the set of intervals over D; the labelling function L assigns an atom to every interval [d i, d j ]; atoms assigned to neighbor intervals are related by R ϕ. A LIS is fulfilling if: metric formulae in L([d i, d j ]) are consistent with respect to the interval length; for every [d i, d j ] and A ψ (resp., A ψ) L([d i, d j ]) there exists d k > d j (resp., d k < d i ) such that ψ L([d j, d k ]) (resp., L([d k, d i ])). Theorem A formula ϕ is satisfiable if and only if there exists a fulfilling LIS I(D), L and an interval [d i, d j ] such that ϕ L([d i, d j ]). Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 22 / 40
36 A small-model theorem for LIS We have reduced the satisfiability problem for MPNL l to the problem of finding a (fulfilling) LIS for ϕ. LIS can be of arbitrary size and even infinite! Problems How to bound the size of finite LIS? How to finitely represent infinite LIS? Solution Any large (resp., infinite) model can be turned into a bounded (resp., bounded periodic) one by progressively removing exceeding points Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 23 / 40
37 The set of requests of a point d j d i 2 d i 1 d i Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 24 / 40
38 The set of requests of a point d j d i 2 d i 1 d i REQ R (d i ) Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 24 / 40
39 The set of requests of a point d j d i 2 d i 1 d i REQ R (d i ) Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 24 / 40
40 The set of requests of a point d j d i 2 d i 1 d i REQ L (d j ) REQ R (d i ) Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 24 / 40
41 The set of requests of a point d j d i 2 d i 1 d i REQ L (d j ) REQ R (d i ) REQ(d i ) = REQ R (d i ) REQ L (d i ) Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 24 / 40
42 k-sequences of requests Given a formula ϕ, let k be the greatest constant that appears in ϕ. Definition Given a LIS, a k-sequence is a sequence of k consecutive points. Given a sequence σ, its sequence of requests REQ(σ) is defined as the sequence of temporal requests at the points in σ. σ { }} { d 1 d 2 d 3 d k REQ(d 1 ) } REQ(d 2 ) REQ(d 3 ) {{ REQ(d k ) } REQ(σ) Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 25 / 40
43 Removing k-sequences from a LIS Lemma Let m be the number of A -subformulae of ϕ and r the number of possible sets of requests REQ. Let I(D), L be a fulfilling LIS for ϕ and REQ(σ) be a k-sequence of request that occurs more than 2(m 2 + m)r + 1 times. We can remove one occurrence of REQ(σ) from the LIS in such a way that the resulting LIS is still fulfilling. Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 26 / 40
44 The removal process: fixing the length of intervals REQ(σ) {}}{ d d 1 d e d k { REQ(σ) }} { d 1 d e d k l > k l k Remove all points up to the next occurrence of REQ(σ) Some intervals became shorter, and do not respect metric formulas anymore Since REQ(d e ) = REQ(d e ), we can relabel problematic intervals Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 27 / 40
45 The removal process: fixing the length of intervals REQ(σ) {}}{ d d 1 d e d k { REQ(σ) }} { d 1 d e d k l > k l k Remove all points up to the next occurrence of REQ(σ) Some intervals became shorter, and do not respect metric formulas anymore Since REQ(d e ) = REQ(d e ), we can relabel problematic intervals Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 27 / 40
46 The removal process: fixing the length of intervals REQ(σ) {}}{ d d 1 d e d k { REQ(σ) }} { d 1 d e d k l > k l k Remove all points up to the next occurrence of REQ(σ) Some intervals became shorter, and do not respect metric formulas anymore Since REQ(d e ) = REQ(d e ), we can relabel problematic intervals Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 27 / 40
47 The removal process: fixing the length of intervals REQ(σ) {}}{ d d 1 d e d k { REQ(σ) }} { d 1 d e d k l > k l k l k Remove all points up to the next occurrence of REQ(σ) Some intervals became shorter, and do not respect metric formulas anymore Since REQ(d e ) = REQ(d e ), we can relabel problematic intervals Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 27 / 40
48 The removal process: fixing defects on A -formulae d d e A ψ 1 ψ 1,l > k m points on the right of d e with the same set of requests of d e Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 28 / 40
49 The removal process: fixing defects on A -formulae d d e A ψ 1 ψ 1,l > k m points on the right of d e with the same set of requests of d e Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 28 / 40
50 The removal process: fixing defects on A -formulae d d e A ψ 1 ψ 1,l > k A ψ 2 A ψ 3. A ψ m m points on the right of d e with the same set of requests of d e Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 28 / 40
51 The removal process: fixing defects on A -formulae d d e d 1 d 2 d m 1 d m A ψ 1 ψ 1,l > k A ψ 2 A ψ 3. A ψ m m points on the right of d e with the same set of requests of d e Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 28 / 40
52 The removal process: fixing defects on A -formulae d d e d 1 d 2 d m 1 d m A ψ 1 ψ 1,l > k A ψ 2 A ψ 3. A ψ m ψ 1,l > k m points on the right of d e with the same set of requests of d e Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 28 / 40
53 The small model theorem for MPNL l By taking advantage of such a removal process, we can prove the following theorem: Theorem (Small model theorem) A formula ϕ is satisfiable if and only if there exists a LIS I(D), L such that: if D is finite, then every k-sequence of requests occurs at most 2(m 2 + m)r + 1 times in D if D is infinite, then the LIS is ultimately periodic with prefix and period bounded by r k (2(m 2 + m)r + 1)k + k 1 Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 29 / 40
54 Decidability and complexity Plain RPNL is known to be NEXPTIME-complete NEXPTIME-hardness A model for an MPNL l formula ϕ can be obtained by a non-deterministic decision procedure that runs in time O(2 k n ). Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 30 / 40
55 Decidability and complexity Plain RPNL is known to be NEXPTIME-complete NEXPTIME-hardness A model for an MPNL l formula ϕ can be obtained by a non-deterministic decision procedure that runs in time O(2 k n ). The exact complexity class depends on how k is encoded: k is a constant: k = O(1) MPNL l is NEXPTIME-complete k is encoded in unary: k = O(n) MPNL l is NEXPTIME-complete k is encoded in binary: k = O(2 n ) MPNL l is in 2NEXPTIME but is EXPSPACE-hard (since RPNL+INT is EXPSPACE-complete) The exact complexity class is an open problem!!! Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 30 / 40
56 Outline 1 Interval Temporal Logics 2 Extending PNL with Metric Features 3 Decidability of MPNL l 4 Expressive Completeness Results 5 Classification w.r.t. Expressive Power 6 Conclusions and Future Research Directions Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 31 / 40
57 PNL and Two-Variable Fragment of First Order Logic Syntax of FO 2 [<,=]: α ::= A 0 A 1 α α α xα yα A 0 ::= x = x x = y y = x y = y x < y y < x A 1 ::= P(x, x) P(x, y) P(y, x) P(y, y) Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 32 / 40
58 PNL and Two-Variable Fragment of First Order Logic Syntax of FO 2 [<,=]: α ::= A 0 A 1 α α α xα yα A 0 ::= x = x x = y y = x y = y x < y y < x A 1 ::= P(x, x) P(x, y) P(y, x) P(y, y) Theorem (Bresolin et al., On Decidability and Expressiveness of PNL, LFCS 2007) PNL π+ FO 2 [<,=] PNL π+ FO 2 [N, =, <] Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 32 / 40
59 PNL and Two-Variable Fragment of First Order Logic Syntax of FO 2 [<,=]: α ::= A 0 A 1 α α α xα yα A 0 ::= x = x x = y y = x y = y x < y y < x A 1 ::= P(x, x) P(x, y) P(y, x) P(y, y) Theorem (Bresolin et al., On Decidability and Expressiveness of PNL, LFCS 2007) PNL π+ FO 2 [<,=] Theorem (Y. Venema, A Modal Logic for Chopping intervals, JLC, 1991) CDT FO 3 2 [=,<] CDT FO 3 2[=, <] PNL π+ FO 2 [N, =, <] Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 32 / 40
60 The logic FO 2 [N, <, =, s] Syntax of FO 2 [N,<,=, s]: t 1, t 2 = s k (z), z {x, y} α ::= A 0 α α α xα yα A 0 ::= t 1 = t 2 t 1 < t 2 P(t 1, t 2 ) Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 33 / 40
61 The logic FO 2 [N, <, =, s] Syntax of FO 2 [N,<,=, s]: t 1, t 2 = s k (z), z {x, y} α ::= A 0 α α α xα yα A 0 ::= t 1 = t 2 t 1 < t 2 P(t 1, t 2 ) Theorem The satisfiability problem for FO 2 [N,<,=, s] is undecidable Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 33 / 40
62 The logic MPNL + l : an extension of MPNL l Additional modalities +k e, +k b, +k be Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 34 / 40
63 The logic MPNL + l : an extension of MPNL l Additional modalities +k +k e ψ e, +k b, +k be Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 34 / 40
64 The logic MPNL + l : an extension of MPNL l Additional modalities +k +k e ψ ψ } {{ } k e, +k b, +k be Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 34 / 40
65 The logic MPNL + l : an extension of MPNL l Additional modalities +k +k e ψ e, +k b, +k be +k b ψ ψ } {{ } k Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 34 / 40
66 The logic MPNL + l : an extension of MPNL l Additional modalities +k +k e ψ e, +k b, +k be +k b ψ ψ ψ } {{ } k }{{} k Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 34 / 40
67 The logic MPNL + l : an extension of MPNL l Additional modalities +k +k e ψ ψ } {{ } k e, +k b, +k be +k b ψ } {{ ψ } k Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 34 / 40
68 The logic MPNL + l : an extension of MPNL l Additional modalities +k +k e ψ ψ } {{ } k e, +k b, +k be +k b ψ } {{ ψ } k +k be ψ Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 34 / 40
69 The logic MPNL + l : an extension of MPNL l Additional modalities +k +k e ψ ψ } {{ } k e, +k b, +k be +k b ψ } {{ ψ } k +k be ψ } ψ {{} k }{{ k } Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 34 / 40
70 The logic MPNL + l : an extension of MPNL l Additional modalities +k +k e ψ e, +k b, +k be ψ } {{ } k +k b ψ } {{ ψ } k +k be ψ } ψ {{} k }{{ k } Theorem MPNL + l FO 2 [N,<,=, s] Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 34 / 40
71 The logic MPNL + l : an extension of MPNL l Additional modalities +k +k e ψ e, +k b, +k be ψ } {{ } k +k b ψ } {{ ψ } k +k be ψ } ψ {{} k }{{ k } Theorem MPNL + l FO 2 [N,<,=, s] CDT FO 3 2[=, <] PNL π+ FO 2 [N, =, <] Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 34 / 40
72 The logic MPNL + l : an extension of MPNL l Additional modalities +k +k e ψ e, +k b, +k be ψ } {{ } k +k b ψ } {{ ψ } k +k be ψ } ψ {{} k }{{ k } Theorem MPNL + l FO 2 [N,<,=, s] CDT FO 3 2[=, <] + MPNL l FO 2 [N, =, <, s] PNL π+ FO 2 [N, =, <] Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 34 / 40
73 Expressive completeness of MPNL l The fragment FO 2 r [N, <,=, s] of FO 2 [N, <,=, s] If both variables x and y occur in the scope of a relation, then the successor function cannot appear in that scope. Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 35 / 40
74 Expressive completeness of MPNL l The fragment FO 2 r [N, <,=, s] of FO 2 [N, <,=, s] If both variables x and y occur in the scope of a relation, then the successor function cannot appear in that scope. Example R(x, y) and R(s(x), s(s(x))) belong to the logic R(s(x), y) does not Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 35 / 40
75 Expressive completeness of MPNL l The fragment FO 2 r [N, <,=, s] of FO 2 [N, <,=, s] If both variables x and y occur in the scope of a relation, then the successor function cannot appear in that scope. Example R(x, y) and R(s(x), s(s(x))) belong to the logic R(s(x), y) does not Theorem MPNL l FO 2 r [N,<,=, s] Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 35 / 40
76 Expressive completeness of MPNL l The fragment FO 2 r [N, <,=, s] of FO 2 [N, <,=, s] If both variables x and y occur in the scope of a relation, then the successor function cannot appear in that scope. Example R(x, y) and R(s(x), s(s(x))) belong to the logic R(s(x), y) does not Theorem MPNL l FO 2 r [N,<,=, s] CDT FO 3 2[=, <] + MPNL l FO 2 [N, =, <, s] PNL π+ FO 2 [N, =, <] Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 35 / 40
77 Expressive completeness of MPNL l The fragment FO 2 r [N, <,=, s] of FO 2 [N, <,=, s] If both variables x and y occur in the scope of a relation, then the successor function cannot appear in that scope. Example R(x, y) and R(s(x), s(s(x))) belong to the logic R(s(x), y) does not Theorem MPNL l FO 2 r [N,<,=, s] CDT FO 3 2[=, <] + MPNL l FO 2 [N, =, <, s] MPNL l FO 2 r[n, =, <, s] PNL π+ FO 2 [N, =, <] Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 35 / 40
78 Outline 1 Interval Temporal Logics 2 Extending PNL with Metric Features 3 Decidability of MPNL l 4 Expressive Completeness Results 5 Classification w.r.t. Expressive Power 6 Conclusions and Future Research Directions Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 36 / 40
79 Relative expressive power of logics in MPNL MPNL = l MPNL () l MPNL = MPNL () MPNL < MPNL > Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 37 / 40
80 Relative expressive power of logics in MPNL MPNL l MPNL = l MPNL [] MPNL () l MPNL =,ɛ MPNL <,> MPNL (),ɛ MPNL = MPNL <,ɛ MPNL >,ɛ MPNL () MPNL < MPNL ɛ PNL MPNL > Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 37 / 40
81 Relative expressive power of logics in MPNL MPNL l in 2NEXPTIME EXPSPACE-hard MPNL = l MPNL [] MPNL () l MPNL =,ɛ MPNL <,> MPNL (),ɛ MPNL = MPNL <,ɛ MPNL >,ɛ MPNL () MPNL < MPNL ɛ PNL MPNL > NEXPTIME-complete Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 37 / 40
82 Outline 1 Interval Temporal Logics 2 Extending PNL with Metric Features 3 Decidability of MPNL l 4 Expressive Completeness Results 5 Classification w.r.t. Expressive Power 6 Conclusions and Future Research Directions Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 38 / 40
83 Conclusions To do The class MPNL of metric logics based on PNL Decidability of the most expressive logic (MPNL l ) Undecidability of FO 2 [N,<,=, s] Expressive completeness results: MPNL + l FO 2 [N, <, =, s] undecidability of MPNL + l MPNLl FO 2 r [N, <, =, s] decidability of FO 2 r [N, <, =, s] Relative expressive power of logics in MPNL From N to Z and all linear orderings From standard distance functions to other distance functions From constant constraint to arithmetic constraints Where is the complexity jump? To identify the precise complexity class of MPNL l (2NEXPTIME or EXPSPACE?) Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 39 / 40
84 More research directions Decidability/undecidability of other (Metric) Interval Logics: the sub-interval logic D other combinations of Allen s relations Model Checking of (Metric) Interval logics: no known results; Tableau method for Metric Interval Logics in particular, the extension of the tableau method for PNL to the metric case; Metric PNL over dense orderings PNL is decidable even in the dense case (Q); can we extend the language with metric features in this case too? Guido Sciavicco (Univ. of Murcia) Metric Propositional Neighborhood Logics ECAI Lisbon 40 / 40
A Tableau-Based Decision Procedure for Right Propositional Neighborhood Logic (RPNL )
A Tableau-Based Decision Procedure for Right Propositional Neighborhood Logic (RPNL ) Davide Bresolin Angelo Montanari Dipartimento di Matematica e Informatica Università degli Studi di Udine {bresolin,
More informationExpressiveness, decidability, and undecidability of Interval Temporal Logic
University of Udine Department of Mathematics and Computer Science Expressiveness, decidability, and undecidability of Interval Temporal Logic ITL - Beyond the end of the light Ph.D. Defence Dario Della
More informationA tableau-based decision procedure for a branching-time interval temporal logic
A tableau-based decision procedure for a branching-time interval temporal logic Davide Bresolin Angelo Montanari Dipartimento di Matematica e Informatica Università degli Studi di Udine {bresolin, montana}@dimi.uniud.it
More informationOptimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders
Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders Davide Bresolin 1, Angelo Montanari 2, Pietro Sala 2, and Guido Sciavicco 3 1 Department of Computer Science, University of
More informationAn optimal tableau-based decision algorithm for Propositional Neighborhood Logic
An optimal tableau-based decision algorithm for Propositional Neighborhood Logic Davide Bresolin, Angelo Montanari, and Pietro Sala Department of Mathematics and Computer Science, University of Udine,
More informationOptimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders
Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders Davide Bresolin 1, Angelo Montanari 2, Pietro Sala 1, and Guido Sciavicco 34 1 Department of Computer
More informationTUTORIAL Temporal Representation and Reasoning in Interval Temporal Logics. ECAI 2014 Prague, August 18th, 2014
TUTORIAL Temporal Representation and Reasoning in Interval Temporal Logics Angelo Montanari Dept. of Mathematics and Computer Science, University of Udine, Italy Pietro Sala Dept. of Computer Science,
More informationInterval Temporal Logics over Strongly Discrete Linear Orders: the Complete Picture
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,
More informationA Guided Tour through Interval Temporal Logics Mid- and Long-Term Research Agenda
A Guided Tour through Interval Temporal Logics Mid- and Long-Term Research Agenda Angelo Montanari Department of Mathematics and Computer Science, University of Udine, Italy angelo.montanari@uniud.it Gargnano,
More informationBegin, After, and Later: a Maximal Decidable Interval Temporal Logic
Begin, After, and Later: a Maximal Decidable Interval Temporal Logic Davide Bresolin University of Verona Verona, Italy davide.bresolin@univr.it Pietro Sala University of Verona Verona, Italy pietro.sala@univr.it
More informationDario Della Monica Valentin Goranko Angelo Montanari Guido Sciavicco
INTERVAL TEMPORAL LOGICS: A JOURNEY Dario Della Monica Valentin Goranko Angelo Montanari Guido Sciavicco Abstract We discuss a family of modal logics for reasoning about relational structures of intervals
More informationThe dark side of Interval Temporal Logic: marking the undecidability border
Annals of Mathematics and Artificial Intelligence manuscript No. (will be inserted by the editor) The dark side of Interval Temporal Logic: marking the undecidability border Davide Bresolin Dario Della
More informationThe Ultimate Undecidability Result for the HalpernShoham Logic
The Ultimate Undecidability Result for the HalpernShoham Logic Jerzy Marcinkowski, Jakub Michaliszyn Instytut Informatyki University of Wrocªaw June 24, 2011 Intervals Given an arbitrary total order D,.
More informationWhat s decidable about Halpern and Shoham s interval logic? The maximal fragment AB B L
What s decidable about Halpern and Shoham s interval logic? The maximal fragment AB B L Davide Bresolin, Angelo Montanari, Pietro Sala, Guido Sciavicco Università degli Studi di Verona, Verona, Italy Università
More informationRelational dual tableaux for interval temporal logics *
Relational dual tableaux for interval temporal logics * Davide Bresolin * Joanna Golińska-Pilarek ** Ewa Orłowska ** * Department of Mathematics and Computer Science University of Udine (Italy) bresolin@dimi.uniud.it
More informationThe dark side of Interval Temporal Logic: sharpening the undecidability border
The dark side of Interval Temporal Logic: sharpening the undecidability border Davide Bresolin 1, Dario Della Monica 2,3, Valentin Goranko 4, Angelo Montanari 3, Guido Sciavicco 5,6 1 University of Verona,
More informationTableau-based decision procedures for the logics of subinterval structures over dense orderings
Tableau-based decision procedures for the logics of subinterval structures over dense orderings Davide Bresolin 1, Valentin Goranko 2, Angelo Montanari 3, and Pietro Sala 3 1 Department of Computer Science,
More informationPrompt Interval Temporal Logic
Prompt Interval Temporal Logic Dario Della Monica 1, Angelo Montanari 2, Aniello Murano 1, and Pietro Sala 3 1 Università degli Studi di Napoli Federico II, Napoli, Italy, dario.dellamonica@unina.it,murano@na.infn.it
More informationPrompt Interval Temporal Logic (extended version)
Prompt Interval Temporal Logic (extended version) Dario Della Monica 1, Angelo Montanari 2, Aniello Murano 1, and Pietro Sala 3 1 Università degli Studi di Napoli Federico II, Napoli, Italy, dario.dellamonica@unina.it,murano@na.infn.it
More informationMetric Propositional Neighborhood Logic with an Equivalence Relation
Noname manuscript No. (will be inserted by the editor) Metric Propositional Neighborhood Logic with an Equivalence Relation Angelo Montanari Marco Pazzaglia Pietro Sala Received: date / Accepted: date
More informationIntroduction to Temporal Logic. The purpose of temporal logics is to specify properties of dynamic systems. These can be either
Introduction to Temporal Logic The purpose of temporal logics is to specify properties of dynamic systems. These can be either Desired properites. Often liveness properties like In every infinite run action
More informationMonodic fragments of first-order temporal logics
Outline of talk Most propositional temporal logics are decidable. But the decision problem in predicate (first-order) temporal logics has seemed near-hopeless. Monodic fragments of first-order temporal
More informationTheoretical results around Electrum
Theoretical results around Electrum Julien Brunel David Chemouil Denis Kuperberg ONERA/DTIM - IRIT Séminaire DTIM 11/05/2015 Toulouse Introduction Alloy Language Specification language based on First-Order
More informationComplete and Terminating Tableau for the Logic of Proper Subinterval Structures Over Dense Orderings
Electronic Notes in Theoretical Computer Science 231 (2009) 131 151 www.elsevier.com/locate/entcs Complete and Terminating Tableau for the Logic of Proper Subinterval Structures Over Dense Orderings Davide
More informationDecidability of the Logics of the Reflexive Sub-interval and Super-interval Relations over Finite Linear Orders
Decidability of the Logics of the Reflexive Sub-interval and Super-interval Relations over Finite Linear Orders Angelo Montanari Dept. of Mathematics and Computer Science University of Udine, Italy angelo.montanari@uniud.it
More informationModal logics: an introduction
Modal logics: an introduction Valentin Goranko DTU Informatics October 2010 Outline Non-classical logics in AI. Variety of modal logics. Brief historical remarks. Basic generic modal logic: syntax and
More informationDeclarative modelling for timing
Declarative modelling for timing The real-time logic: Duration Calculus Michael R. Hansen mrh@imm.dtu.dk Informatics and Mathematical Modelling Technical University of Denmark 02153 Declarative Modelling,
More informationIntelligent Agents. Formal Characteristics of Planning. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University
Intelligent Agents Formal Characteristics of Planning Ute Schmid Cognitive Systems, Applied Computer Science, Bamberg University Extensions to the slides for chapter 3 of Dana Nau with contributions by
More informationA Decidable Spatial Logic with Cone-Shaped Cardinal Directions
A Decidable Spatial Logic with Cone-Shaped Cardinal Directions Angelo Montanari 1, Gabriele Puppis 2, and Pietro Sala 1 1 Department of Mathematics and Computer Science, Udine University, Italy {angelo.montanari,pietro.sala}@dimi.uniud.it
More informationLinear Temporal Logic and Büchi Automata
Linear Temporal Logic and Büchi Automata Yih-Kuen Tsay Department of Information Management National Taiwan University FLOLAC 2009 Yih-Kuen Tsay (SVVRL @ IM.NTU) Linear Temporal Logic and Büchi Automata
More informationChapter 4: Computation tree logic
INFOF412 Formal verification of computer systems Chapter 4: Computation tree logic Mickael Randour Formal Methods and Verification group Computer Science Department, ULB March 2017 1 CTL: a specification
More informationAbstract model theory for extensions of modal logic
Abstract model theory for extensions of modal logic Balder ten Cate Stanford, May 13, 2008 Largely based on joint work with Johan van Benthem and Jouko Väänänen Balder ten Cate Abstract model theory for
More informationDuration Calculus Introduction
Duration Calculus Introduction Michael R. Hansen mrh@imm.dtu.dk Informatics and Mathematical Modelling Technical University of Denmark 02240 Computability and Semantics, Spring 05, c Michael R. Hansen
More informationTheoretical Foundations of the UML
Theoretical Foundations of the UML Lecture 17+18: A Logic for MSCs Joost-Pieter Katoen Lehrstuhl für Informatik 2 Software Modeling and Verification Group moves.rwth-aachen.de/teaching/ws-1718/fuml/ 5.
More informationTrace Diagnostics using Temporal Implicants
Trace Diagnostics using Temporal Implicants ATVA 15 Thomas Ferrère 1 Dejan Nickovic 2 Oded Maler 1 1 VERIMAG, University of Grenoble / CNRS 2 Austrian Institute of Technology October 14, 2015 Motivation
More informationChapter 6: Computation Tree Logic
Chapter 6: Computation Tree Logic Prof. Ali Movaghar Verification of Reactive Systems Outline We introduce Computation Tree Logic (CTL), a branching temporal logic for specifying system properties. A comparison
More informationOn simulations and bisimulations of general flow systems
On simulations and bisimulations of general flow systems Jen Davoren Department of Electrical & Electronic Engineering The University of Melbourne, AUSTRALIA and Paulo Tabuada Department of Electrical
More informationA Theory of Duration Calculus with Application
A Theory of Duration Calculus with Application Michael R. Hansen 1 and Dang Van Hung 2 1 Informatics and Math. Modelling, Technical University of Denmark Ricard Petersens Plads, DK-2800 Lyngby, Denmark
More informationAn Algebraic Semantics for Duration Calculus
An Algebraic Semantics for Duration Calculus Peter Höfner Institut für Informatik, Universität Augsburg D-86135 Augsburg, Germany hoefner@informatik.uni-augsburg.de Abstract. We present an algebraic semantics
More informationA Road Map on Interval Temporal Logics and Duration Calculi
A Road Map on Interval Temporal Logics and Duration Calculi (Preliminary Version) Valentin Goranko +, Angelo Montanari, and Guido Sciavicco + Department of Mathematics, Rand Afrikaans University, South
More informationarxiv: v1 [cs.lo] 13 Jan 2016
The final publication is available at Springer via http://dx.doi.org/10.1007/s00236-015-0250-1 A. Molinari, A. Montanari, A. Murano, G. Perelli, A. Peron Checking interval properties of computations In
More informationModel Checking: the Interval Way
Dept. of Mathematics, Computer Science, and Physics University of Udine, Italy TCS Seminar Series Spring 2018 Department of Theoretical Computer Science KTH ROYAL INSTITUTE OF TECHNOLOGY June 4, 2018 Model
More informationAn Introduction to Modal Logic III
An Introduction to Modal Logic III Soundness of Normal Modal Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, October 24 th 2013 Marco Cerami
More informationCounter Automata and Classical Logics for Data Words
Counter Automata and Classical Logics for Data Words Amal Dev Manuel amal@imsc.res.in Institute of Mathematical Sciences, Taramani, Chennai, India. January 31, 2012 Data Words Definition (Data Words) A
More informationFinal Exam (100 points)
Final Exam (100 points) Honor Code: Each question is worth 10 points. There is one bonus question worth 5 points. In contrast to the homework assignments, you may not collaborate on this final exam. You
More informationDipartimento di Scienze dell Informazione
UNIVERSITÀ DEGLI STUDI DI MILANO Dipartimento di Scienze dell Informazione RAPPORTO INTERNO N 313-07 Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems Silvio Ghilardi,
More information03 Review of First-Order Logic
CAS 734 Winter 2014 03 Review of First-Order Logic William M. Farmer Department of Computing and Software McMaster University 18 January 2014 What is First-Order Logic? First-order logic is the study of
More informationUndecidable Problems. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science May 12, / 65
Undecidable Problems Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science May 12, 2018 1/ 65 Algorithmically Solvable Problems Let us assume we have a problem P. If there is an algorithm solving
More informationFirst-Order Predicate Logic. Basics
First-Order Predicate Logic Basics 1 Syntax of predicate logic: terms A variable is a symbol of the form x i where i = 1, 2, 3.... A function symbol is of the form fi k where i = 1, 2, 3... und k = 0,
More informationTemporal Logic. Stavros Tripakis University of California, Berkeley. We have designed a system. We want to check that it is correct.
EE 244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2016 Temporal logic Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 244, Fall 2016
More informationDeciding Safety and Liveness in TPTL
Deciding Safety and Liveness in TPTL David Basin a, Carlos Cotrini Jiménez a,, Felix Klaedtke b,1, Eugen Zălinescu a a Institute of Information Security, ETH Zurich, Switzerland b NEC Europe Ltd., Heidelberg,
More informationComputation Tree Logic (CTL) & Basic Model Checking Algorithms
Computation Tree Logic (CTL) & Basic Model Checking Algorithms Martin Fränzle Carl von Ossietzky Universität Dpt. of Computing Science Res. Grp. Hybride Systeme Oldenburg, Germany 02917: CTL & Model Checking
More informationDense-Timed Pushdown Automata
Dense-Timed Pushdown Automata Parosh Aziz Abdulla Uppsala University Sweden Mohamed Faouzi Atig Uppsala University Sweden Jari Stenman Uppsala University Sweden Abstract We propose a model that captures
More informationAn On-the-fly Tableau Construction for a Real-Time Temporal Logic
#! & F $ F ' F " F % An On-the-fly Tableau Construction for a Real-Time Temporal Logic Marc Geilen and Dennis Dams Faculty of Electrical Engineering, Eindhoven University of Technology P.O.Box 513, 5600
More informationTemporal logics and explicit-state model checking. Pierre Wolper Université de Liège
Temporal logics and explicit-state model checking Pierre Wolper Université de Liège 1 Topics to be covered Introducing explicit-state model checking Finite automata on infinite words Temporal Logics and
More informationLTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems
This space is reserved for the EPiC Series header, do not use it LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems Rachel Faran and Orna Kupferman The Hebrew University,
More informationPredicate Calculus. Formal Methods in Verification of Computer Systems Jeremy Johnson
Predicate Calculus Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. Motivation 1. Variables, quantifiers and predicates 2. Syntax 1. Terms and formulas 2. Quantifiers, scope
More informationFuzzy Description Logics
Fuzzy Description Logics 1. Introduction to Description Logics Rafael Peñaloza Rende, January 2016 Literature Description Logics Baader, Calvanese, McGuinness, Nardi, Patel-Schneider (eds.) The Description
More informationTemporal Logic. M φ. Outline. Why not standard logic? What is temporal logic? LTL CTL* CTL Fairness. Ralf Huuck. Kripke Structure
Outline Temporal Logic Ralf Huuck Why not standard logic? What is temporal logic? LTL CTL* CTL Fairness Model Checking Problem model, program? M φ satisfies, Implements, refines property, specification
More informationModel Checking for Modal Intuitionistic Dependence Logic
1/71 Model Checking for Modal Intuitionistic Dependence Logic Fan Yang Department of Mathematics and Statistics University of Helsinki Logical Approaches to Barriers in Complexity II Cambridge, 26-30 March,
More informationModel Theory of Modal Logic Lecture 1: A brief introduction to modal logic. Valentin Goranko Technical University of Denmark
Model Theory of Modal Logic Lecture 1: A brief introduction to modal logic Valentin Goranko Technical University of Denmark Third Indian School on Logic and its Applications Hyderabad, 25 January, 2010
More informationComputation Tree Logic
Computation Tree Logic Computation tree logic (CTL) is a branching-time logic that includes the propositional connectives as well as temporal connectives AX, EX, AU, EU, AG, EG, AF, and EF. The syntax
More informationModal and Temporal Logics
Modal and Temporal Logics Colin Stirling School of Informatics University of Edinburgh July 23, 2003 Why modal and temporal logics? 1 Computational System Modal and temporal logics Operational semantics
More informationA Resolution Method for Modal Logic S5
EPiC Series in Computer Science Volume 36, 2015, Pages 252 262 GCAI 2015. Global Conference on Artificial Intelligence A Resolution Method for Modal Logic S5 Yakoub Salhi and Michael Sioutis Université
More informationModel Checking in the Propositional µ-calculus
Model Checking in the Propositional µ-calculus Ka I Violet Pun INF 9140 - Specification and Verification of Parallel Systems 13 th May, 2011 Overview Model Checking is a useful means to automatically ascertain
More informationTeam Semantics and Recursive Enumerability
Team Semantics and Recursive Enumerability Antti Kuusisto University of Wroc law, Poland, Technical University of Denmark Stockholm University, Sweden antti.j.kuusisto@uta.fi Abstract. It is well known
More informationA Journey through the Possible Worlds of Modal Logic Lecture 1: Introduction to modal logics
A Journey through the Possible Worlds of Modal Logic Lecture 1: Introduction to modal logics Valentin Goranko Department of Philosophy, Stockholm University ESSLLI 2016, Bolzano, August 22, 2016 Outline
More informationOverview. CS389L: Automated Logical Reasoning. Lecture 7: Validity Proofs and Properties of FOL. Motivation for semantic argument method
Overview CS389L: Automated Logical Reasoning Lecture 7: Validity Proofs and Properties of FOL Agenda for today: Semantic argument method for proving FOL validity Işıl Dillig Important properties of FOL
More informationApplied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018
More informationReasoning about Time and Reliability
Reasoning about Time and Reliability Probabilistic CTL model checking Daniel Bruns Institut für theoretische Informatik Universität Karlsruhe 13. Juli 2007 Seminar Theorie und Anwendung von Model Checking
More informationFirst Order Logic (FOL) 1 znj/dm2017
First Order Logic (FOL) 1 http://lcs.ios.ac.cn/ znj/dm2017 Naijun Zhan March 19, 2017 1 Special thanks to Profs Hanpin Wang (PKU) and Lijun Zhang (ISCAS) for their courtesy of the slides on this course.
More informationTemporal & Modal Logic. Acronyms. Contents. Temporal Logic Overview Classification PLTL Syntax Semantics Identities. Concurrency Model Checking
Temporal & Modal Logic E. Allen Emerson Presenter: Aly Farahat 2/12/2009 CS5090 1 Acronyms TL: Temporal Logic BTL: Branching-time Logic LTL: Linear-Time Logic CTL: Computation Tree Logic PLTL: Propositional
More informationQuery Reasoning on Data Trees with Counting
Query Reasoning on Data Trees with Counting Everardo Bárcenas 1,2, Edgard Benítez-Guerrero 2, and Jesús Lavalle 3,4 1 CONACYT 2 Universidad Veracruzana 3 Benemérita Universidad Autónoma de Puebla 4 Instituto
More informationChapter 3: Linear temporal logic
INFOF412 Formal verification of computer systems Chapter 3: Linear temporal logic Mickael Randour Formal Methods and Verification group Computer Science Department, ULB March 2017 1 LTL: a specification
More informationClassical First-Order Logic
Classical First-Order Logic Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) First-Order Logic (Classical) MFES 2008/09
More informationDeveloping Modal Tableaux and Resolution Methods via First-Order Resolution
Developing Modal Tableaux and Resolution Methods via First-Order Resolution Renate Schmidt University of Manchester Reference: Advances in Modal Logic, Vol. 6 (2006) Modal logic: Background Established
More informationFirst-order resolution for CTL
First-order resolution for Lan Zhang, Ullrich Hustadt and Clare Dixon Department of Computer Science, University of Liverpool Liverpool, L69 3BX, UK {Lan.Zhang, U.Hustadt, CLDixon}@liverpool.ac.uk Abstract
More informationDiscrete Mathematics
Discrete Mathematics Yi Li Software School Fudan University March 13, 2017 Yi Li (Fudan University) Discrete Mathematics March 13, 2017 1 / 1 Review of Lattice Ideal Special Lattice Boolean Algebra Yi
More informationRelations to first order logic
An Introduction to Description Logic IV Relations to first order logic Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, November 6 th 2014 Marco
More informationSyntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.
First-Order Logic Syntax The alphabet of a first-order language is organised into the following categories. Logical connectives:,,,,, and. Auxiliary symbols:.,,, ( and ). Variables: we assume a countable
More informationOn the Satisfiability of Two-Variable Logic over Data Words
On the Satisfiability of Two-Variable Logic over Data Words Claire David, Leonid Libkin, and Tony Tan School of Informatics, University of Edinburgh Abstract. Data trees and data words have been studied
More informationTemporal Logic Model Checking
18 Feb, 2009 Thomas Wahl, Oxford University Temporal Logic Model Checking 1 Temporal Logic Model Checking Thomas Wahl Computing Laboratory, Oxford University 18 Feb, 2009 Thomas Wahl, Oxford University
More informationRecent results on Timed Systems
Recent results on Timed Systems Time Petri Nets and Timed Automata Béatrice Bérard LAMSADE Université Paris-Dauphine & CNRS berard@lamsade.dauphine.fr Based on joint work with F. Cassez, S. Haddad, D.
More informationA Tableau Calculus for Minimal Modal Model Generation
M4M 2011 A Tableau Calculus for Minimal Modal Model Generation Fabio Papacchini 1 and Renate A. Schmidt 2 School of Computer Science, University of Manchester Abstract Model generation and minimal model
More informationSyntax and Semantics of Propositional Linear Temporal Logic
Syntax and Semantics of Propositional Linear Temporal Logic 1 Defining Logics L, M, = L - the language of the logic M - a class of models = - satisfaction relation M M, ϕ L: M = ϕ is read as M satisfies
More informationBounded Timed Propositional Temporal Logic with Past Captures Timeline-based Planning with Bounded Constraints
Bounded Timed Propositional Temporal Logic with Past Captures Timeline-based Planning with Bounded Constraints Dario Della Monica *, Nicola Gigante, Angelo Montanari, Pietro Sala, Guido Sciavicco * Universidad
More informationFixpoint Extensions of Temporal Description Logics
Fixpoint Extensions of Temporal Description Logics Enrico Franconi Faculty of Computer Science Free University of Bozen-Bolzano, Italy franconi@inf.unibz.it David Toman School of Computer Science University
More informationA Little Logic. Propositional Logic. Satisfiability Problems. Solving Sudokus. First Order Logic. Logic Programming
A Little Logic International Center for Computational Logic Technische Universität Dresden Germany Propositional Logic Satisfiability Problems Solving Sudokus First Order Logic Logic Programming A Little
More informationValentin Goranko Stockholm University. ESSLLI 2018 August 6-10, of 33
ESSLLI 2018 course Logics for Epistemic and Strategic Reasoning in Multi-Agent Systems Lecture 4: Logics for temporal strategic reasoning with complete information Valentin Goranko Stockholm University
More informationFirst-Order Logic First-Order Theories. Roopsha Samanta. Partly based on slides by Aaron Bradley and Isil Dillig
First-Order Logic First-Order Theories Roopsha Samanta Partly based on slides by Aaron Bradley and Isil Dillig Roadmap Review: propositional logic Syntax and semantics of first-order logic (FOL) Semantic
More informationModel Checking with CTL. Presented by Jason Simas
Model Checking with CTL Presented by Jason Simas Model Checking with CTL Based Upon: Logic in Computer Science. Huth and Ryan. 2000. (148-215) Model Checking. Clarke, Grumberg and Peled. 1999. (1-26) Content
More informationLecture 05: Duration Calculus III
Real-Time Systems Lecture 05: Duration Calculus III 2014-05-20 Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: DC Syntax and Semantics: Formulae This Lecture:
More informationProseminar on Semantic Theory Fall 2013 Ling 720 First Order (Predicate) Logic: Syntax and Natural Deduction 1
First Order (Predicate) Logic: Syntax and Natural Deduction 1 A Reminder of Our Plot I wish to provide some historical and intellectual context to the formal tools that logicians developed to study the
More informationClassical First-Order Logic
Classical First-Order Logic Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2009/2010 Maria João Frade (DI-UM) First-Order Logic (Classical) MFES 2009/10
More informationReasoning about Strategies: From module checking to strategy logic
Reasoning about Strategies: From module checking to strategy logic based on joint works with Fabio Mogavero, Giuseppe Perelli, Luigi Sauro, and Moshe Y. Vardi Luxembourg September 23, 2013 Reasoning about
More informationLogic Part I: Classical Logic and Its Semantics
Logic Part I: Classical Logic and Its Semantics Max Schäfer Formosan Summer School on Logic, Language, and Computation 2007 July 2, 2007 1 / 51 Principles of Classical Logic classical logic seeks to model
More informationOptimal Decision Procedures for Satisfiability in Fragments of Alternating-time Temporal Logics
Optimal Decision Procedures for Satisfiability in Fragments of Alternating-time Temporal Logics Valentin Goranko a,b Steen Vester a 1 a Department of Applied Mathematics and Computer Science Technical
More informationT Reactive Systems: Temporal Logic LTL
Tik-79.186 Reactive Systems 1 T-79.186 Reactive Systems: Temporal Logic LTL Spring 2005, Lecture 4 January 31, 2005 Tik-79.186 Reactive Systems 2 Temporal Logics Temporal logics are currently the most
More informationTheTwo-VariableGuardedFragmentwith Transitive Guards Is 2EXPTIME-Hard
TheTwo-VariableGuardedFragmentwith Transitive Guards Is 2EXPTIME-Hard Emanuel Kieroński Institute of Computer Science University of Wroc law ul. Przesmyckiego 20, 51-151 Wroc law, Poland kiero@ii.uni.wroc.pl
More informationOn the Decidability of Verifying LTL Properties of GOLOG Programs
On the Decidability of Verifying LTL Properties of GOLOG Programs Benjamin Zarrieß Theoretical Computer Science TU Dresden, Germany zarriess@tcs.inf.tu-dresden.de Jens Claßen Knowledge-Based Systems Group
More information