formal semantics of cypher
play

Formal semantics of Cypher: towards a standard language for querying - PowerPoint PPT Presentation

Jun 18, 2023 •342 likes •1.46k views

Formal semantics of Cypher: towards a standard language for querying property graphs N. Francis 1 A. Green 2 M. Rydberg 2 P. Guagliardo 3 V. Marsault 1 T. Lindaaker 2 P. Selmer 2 L. Libkin 3 S. Plantikow 2 A. Taylor 2 M. Schuster 3 1. Univ.

  1. Regular Path Query (RPQ) – Example 1 8 User , Admin Query: User name :"Charlie" POSTED . ( ANSWERS ) ∗ r 8 y x N 6 N 3 follows Answers: r 4 r 3 User User follows F 1 : x �→ N 1 y �→ N 4 name :"Alice" name :"Bob" r 2 x �→ N 2 y �→ N 5 F 2 : N 1 N 2 F 3 : x �→ N 2 y �→ N 4 r 1 posted posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers answers Message Message id :22 id :25 text :"Hello" text :"World"

  2. Regular Path Query (RPQ) – Example 1 8 User , Admin Query: User name :"Charlie" POSTED . ( ANSWERS ) ∗ r 8 y x N 6 N 3 follows Answers: r 4 r 3 User User follows F 1 : x �→ N 1 y �→ N 4 name :"Alice" name :"Bob" r 2 x �→ N 2 y �→ N 5 F 2 : N 1 N 2 F 3 : x �→ N 2 y �→ N 4 r 1 posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  3. Regular Path Query (RPQ) – Example 2 9 User , Admin Query: User name :"Charlie" ( FOLLOWS ) ∗ r 8 y x N 6 N 3 follows r 4 r 3 User User follows name :"Alice" name :"Bob" r 2 N 1 N 2 r 1 posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  4. Regular Path Query (RPQ) – Example 2 9 User , Admin Query: User name :"Charlie" ( FOLLOWS ) ∗ r 8 y x N 6 N 3 follows r 4 r 3 User User follows follows name :"Alice" name :"Bob" r 2 N 1 N 2 r 1 posted posted r 5 follows follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  5. Regular Path Query (RPQ) – Example 2 9 User , Admin Query: User name :"Charlie" ( FOLLOWS ) ∗ r 8 y x N 6 N 3 follows Answers: r 4 r 3 User User follows F 1 : x �→ N 1 y �→ N 1 name :"Alice" name :"Bob" r 2 x �→ N 1 y �→ N 2 F 2 : N 1 N 2 F 3 : x �→ N 1 y �→ N 3 r 1 . . . . . . posted . . . posted r 5 follows r 6 x �→ N 3 y �→ N 3 F 9 : on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  6. Regular Path Query (RPQ) – Example 2 9 User , Admin Query: User name :"Charlie" ( FOLLOWS ) ∗ r 8 y x N 6 N 3 follows Answers: r 4 r 3 User User follows F 1 : x �→ N 1 y �→ N 1 name :"Alice" name :"Bob" r 2 x �→ N 1 y �→ N 2 F 2 : N 1 N 2 F 3 : x �→ N 1 y �→ N 3 r 1 . . . . . . posted . . . posted r 5 follows r 6 x �→ N 3 y �→ N 3 F 9 : on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  7. Regular Path Query (RPQ) – Example 2 9 User , Admin Query: User name :"Charlie" ( FOLLOWS ) ∗ r 8 y x N 6 N 3 follows Answers: r 4 r 3 User User follows follows F 1 : x �→ N 1 y �→ N 1 name :"Alice" name :"Bob" r 2 x �→ N 1 y �→ N 2 F 2 : N 1 N 2 F 3 : x �→ N 1 y �→ N 3 r 1 . . . . . . posted . . . posted r 5 follows follows r 6 x �→ N 3 y �→ N 3 F 9 : on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  8. Regular Path Query (RPQ) – Example 2 9 User , Admin Query: User name :"Charlie" ( FOLLOWS ) ∗ r 8 y x N 6 N 3 follows Answers: r 4 r 3 User User follows follows F 1 : x �→ N 1 y �→ N 1 name :"Alice" name :"Bob" r 2 x �→ N 1 y �→ N 2 F 2 : N 1 N 2 F 3 : x �→ N 1 y �→ N 3 r 1 . . . . . . posted . . . posted r 5 follows follows r 6 x �→ N 3 y �→ N 3 F 9 : on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  9. Regular Path Query (RPQ) – Example 2 9 User , Admin Query: User name :"Charlie" ( FOLLOWS ) ∗ r 8 y x N 6 N 3 follows Answers: r 4 r 3 User User follows F 1 : x �→ N 1 y �→ N 1 name :"Alice" name :"Bob" r 2 x �→ N 1 y �→ N 2 F 2 : N 1 N 2 F 3 : x �→ N 1 y �→ N 3 r 1 . . . . . . posted . . . posted r 5 follows r 6 x �→ N 3 y �→ N 3 F 9 : on :"05-14" on :"05-15" → ∞ -many path realise F 1 N 4 r 7 N 5 → RPQ follows set-semantics answers Message Message id :22 id :25 text :"Hello" text :"World"

  10. Conjunction of RPQs (CRPQ) – Definition 10 A : alphabet (of relation types) N : nodes in the graph Example: Definition (a CRPQ C): y C = ( R 1 ∧ R 2 ∧ · · · ∧ R n ) ( a + b ) ∗ ( ab ) ∗ where R 1 ,, . . ., R n are RPQs x z c Answer to C: Set of the functions F : var ( C ) → N such that ∀ i , F | var ( R i ) is an answer to R i

  11. Conjunction of RPQs (CRPQ) – Example 11 User , Admin Query: User name :"Charlie" r 8 POSTED N 6 N 3 y x z follows ( ANSWERS ) ∗ r 4 r 3 User User follows name :"Alice" name :"Bob" r 2 Answers: N 1 N 2 r 1 x z y posted posted �→ �→ �→ r 5 follows r 6 on :"05-14" on :"05-15" F 1 : N 1 N 4 N 4 F 2 : N 2 N 5 N 4 N 4 r 7 N 5 F 3 : N 2 N 5 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  12. Union of CRPQs (UCRPQ) – Defintion 12 A : alphabet (of relation types) N : nodes in the graph Definition (UCRPQ Q) Q = ( C 1 ∪ C 2 ∪ · · · ∪ C n ) where C 1 , C 2 , . . ., C n are CRPQs Answer to Q: Set of partial functions: � var ( C 1 ) ∪ · · · ∪ var ( C n ) � → N � n F i , i = 1 where, ∀ i , F i is the answer to C i .

  13. Outline 13 1 Introduction 2 Property graphs 3 Regular Path Queries 4 Cypher by example 5 Principles of the semantics 6 Towards a standard language for querying property graphs

  14. Evaluating a Cypher query 13 User , Admin Example of Cypher query: User name :"Charlie" MATCH ✭ u1 ✮✲❬ p1 ✿ POSTED ❪✲❃✭ m1 ✮ r 8 WITH u1, p1, m1 ✳ text AS t1 N 6 N 3 follows WHERE t1 ❂ "Hello" r 4 r 3 User User follows A Cypher statement name :"Alice" name :"Bob" r 2 is a sequence of clauses N 1 N 2 r 1 posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  15. Evaluating a Cypher query 13 User , Admin Example of Cypher query: User name :"Charlie" MATCH ✭ u1 ✮✲❬ p1 ✿ POSTED ❪✲❃✭ m1 ✮ r 8 WITH u1, p1, m1 ✳ text AS t1 N 6 N 3 follows WHERE t1 ❂ "Hello" r 4 r 3 User User follows A Cypher statement name :"Alice" name :"Bob" r 2 is a sequence of clauses N 1 N 2 queries a graph r 1 returns a table posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  16. Matching nodes (1) 14 User User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✿ User ✮ r 8 N 6 N 3 follows r 4 r 3 User User User User follows name :"Alice" name :"Bob" r 2 N 1 N 2 r 1 posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  17. Matching nodes (1) 14 User User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✿ User ✮ r 8 N 6 N 3 follows Result: r 4 r 3 User User User User follows u1 name :"Alice" name :"Bob" r 2 N 1 N 1 N 2 N 2 r 1 N 3 posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  18. Matching nodes (2) 15 User User , Admin Admin Query: User name :"Charlie" MATCH ✭ u1 ✿ User ✿ Admin ✮ r 8 N 6 N 3 follows Result: r 4 r 3 User User follows u1 name :"Alice" name :"Bob" r 2 N 3 N 1 N 2 r 1 posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  19. Matching nodes (3) 16 User , Admin Query: User name :"Charlie" MATCH ✭ u1{id ✿ 22} ✮ r 8 N 6 N 3 follows Result: r 4 r 3 User User follows u1 name :"Alice" name :"Bob" r 2 N 4 N 1 N 2 r 1 posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :22 id :25 text :"Hello" text :"World"

  20. Matching relations (1) 17 User , Admin Query: User name :"Charlie" MATCH ✭✮✲❬ p1 ❪✲❃✭✮ r 8 N 6 N 3 follows Result: r 4 r 3 User User follows p1 name :"Alice" name :"Bob" r 2 r 1 N 1 N 2 r 2 r 1 r 3 posted posted r 5 follows r 6 r 4 on :"05-14" on :"05-15" r 5 r 6 N 4 r 7 N 5 r 7 answers Message Message id :22 id :25 text :"Hello" text :"World"

  21. Matching relation (2) 18 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬ p1 ✿ POSTED ❪✲❃✭ m1 ✮ r 8 N 6 N 3 follows Result: r 4 r 3 User User follows u1 p1 m1 name :"Alice" name :"Bob" r 2 N 1 r 5 N 4 N 1 N 2 N 2 r 6 N 5 r 1 posted posted posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  22. Matching relationships (3) 19 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬✿ FOLLOWS ❪✲❃✭✮ r 8 N 6 N 3 follows Result: r 4 r 3 User User follows follows u1 name :"Alice" name :"Bob" r 2 N 1 N 1 N 2 N 2 r 1 N 2 posted posted r 5 follows follows r 6 N 3 on :"05-14" on :"05-15" N 4 r 7 N 5 Cypher has bag semantics: N 2 has two outgoing follows answers Message Message relations ⇒ two lines N 2 id :22 id :25 text :"Hello" text :"World"

  23. Matching paths (1) 20 User , Admin Admin Query: User name :"Charlie" MATCH ✭ u1 ✿ Admin ✮ r 8 ✲❬ l1 ✿ FOLLOWS* ❪✲❃✭ m1 ✮ N 6 N 3 follows r 4 r 3 User User Result: follows follows name :"Alice" name :"Bob" r 2 u1 l1 m1 N 1 N 2 N 3 [ r 4 ] N 1 r 1 N 3 [ r 4 , r 1 ] N 2 posted posted r 5 follows follows r 6 N 3 [ r 4 , r 1 , r 2 ] N 1 on :"05-14" on :"05-15" [ r 4 , r 1 , r 3 ] N 3 N 3 N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  24. Matching paths (1) 20 User , Admin Admin Query: User name :"Charlie" MATCH ✭ u1 ✿ Admin ✮ r 8 ✲❬ l1 ✿ FOLLOWS* ❪✲❃✭ m1 ✮ N 6 N 3 follows r 4 r 3 User User Result: follows follows name :"Alice" name :"Bob" r 2 u1 l1 m1 N 1 N 2 N 3 [ r 4 ] N 1 r 1 N 3 [ r 4 , r 1 ] N 2 posted posted r 5 follows follows r 6 N 3 [ r 4 , r 1 , r 2 ] N 1 on :"05-14" on :"05-15" [ r 4 , r 1 , r 3 ] N 3 N 3 N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  25. Matching paths (1) 20 User , Admin Admin Query: User name :"Charlie" MATCH ✭ u1 ✿ Admin ✮ r 8 ✲❬ l1 ✿ FOLLOWS* ❪✲❃✭ m1 ✮ N 6 N 3 follows r 4 r 3 User User Result: follows follows name :"Alice" name :"Bob" r 2 u1 l1 m1 N 1 N 2 N 3 [ r 4 ] N 1 r 1 N 3 [ r 4 , r 1 ] N 2 posted posted r 5 follows follows r 6 N 3 [ r 4 , r 1 , r 2 ] N 1 on :"05-14" on :"05-15" [ r 4 , r 1 , r 3 ] N 3 N 3 N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  26. Matching paths (1) 20 User , Admin Admin Query: User name :"Charlie" MATCH ✭ u1 ✿ Admin ✮ r 8 ✲❬ l1 ✿ FOLLOWS* ❪✲❃✭ m1 ✮ N 6 N 3 follows r 4 r 3 User User Result: follows follows name :"Alice" name :"Bob" r 2 u1 l1 m1 N 1 N 2 N 3 [ r 4 ] N 1 r 1 N 3 [ r 4 , r 1 ] N 2 posted posted r 5 follows follows r 6 N 3 [ r 4 , r 1 , r 2 ] N 1 on :"05-14" on :"05-15" [ r 4 , r 1 , r 3 ] N 3 N 3 N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  27. Matching paths (1) 20 User , Admin Admin Query: User name :"Charlie" MATCH ✭ u1 ✿ Admin ✮ r 8 ✲❬ l1 ✿ FOLLOWS* ❪✲❃✭ m1 ✮ N 6 N 3 follows r 4 r 3 User User Result: follows follows name :"Alice" name :"Bob" r 2 u1 l1 m1 N 1 N 2 N 3 [ r 4 ] N 1 r 1 N 3 [ r 4 , r 1 ] N 2 posted posted r 5 follows follows r 6 N 3 [ r 4 , r 1 , r 2 ] N 1 on :"05-14" on :"05-15" [ r 4 , r 1 , r 3 ] N 3 N 3 N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  28. Matching paths (1) 20 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✿ Admin ✮ r 8 ✲❬ l1 ✿ FOLLOWS* ❪✲❃✭ m1 ✮ N 6 N 3 follows r 4 r 3 User User Result: follows name :"Alice" name :"Bob" r 2 u1 l1 m1 N 1 N 2 N 3 [ r 4 ] N 1 r 1 N 3 [ r 4 , r 1 ] N 2 posted posted r 5 follows r 6 N 3 [ r 4 , r 1 , r 2 ] N 1 on :"05-14" on :"05-15" [ r 4 , r 1 , r 3 ] N 3 N 3 N 4 r 7 N 5 Cypher-Morphism answers Message Message Each rel. matched ≤ 1 time id :22 id :25 ⇒ Finitely many results text :"Hello" text :"World"

  29. Matching paths (2) 21 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬✿ FOLLOWS ❪✲❃✭✮ r 8 ✲❬✿ POSTED ❪✲❃✭ m1 ✮ N 6 N 3 follows r 4 r 3 User User Result: follows name :"Alice" name :"Bob" r 2 u1 m1 N 1 N 2 N 1 N 5 r 1 N 2 N 4 posted posted r 5 follows r 6 N 3 N 5 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  30. Matching paths (2) 21 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬✿ FOLLOWS ❪✲❃✭✮ r 8 ✲❬✿ POSTED ❪✲❃✭ m1 ✮ N 6 N 3 follows r 4 r 3 User User Result: follows name :"Alice" name :"Bob" r 2 u1 m1 N 1 N 2 N 1 N 5 r 1 N 2 N 4 posted posted posted r 5 follows follows r 6 N 3 N 5 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  31. Chaining clauses 22 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬✿ POSTED ❪✲❃✭ m1 ✮ r 8 MATCH ✭ u2 ✮❁✲❬✿ FOLLOWS ❪✲✭ u1 ✮ N 6 N 3 follows ✲❬✿ FOLLOWS ❪✲❃✭ u3 ✮ r 4 r 3 User User follows name :"Alice" name :"Bob" r 2 N 1 N 2 r 1 posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  32. Chaining clauses 22 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬✿ POSTED ❪✲❃✭ m1 ✮ r 8 MATCH ✭ u2 ✮❁✲❬✿ FOLLOWS ❪✲✭ u1 ✮ N 6 N 3 follows ✲❬✿ FOLLOWS ❪✲❃✭ u3 ✮ r 4 r 3 User User follows Table after first MATCH : name :"Alice" name :"Bob" r 2 u1 m1 N 1 N 2 r 1 N 1 N 4 N 2 N 5 posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  33. Chaining clauses 22 User , Admin Query: User name :"Charlie" MATCH ✭ u1 u1 ✮✲❬✿ POSTED ❪✲❃✭ m1 ✮ r 8 MATCH ✭ u2 ✮❁✲❬✿ FOLLOWS ❪✲✭ u1 u1 ✮ N 6 N 3 follows ✲❬✿ FOLLOWS ❪✲❃✭ u3 ✮ r 4 r 3 User User follows Table after first MATCH : name :"Alice" name :"Bob" r 2 u1 m1 N 1 N 2 r 1 N 1 N 4 N 2 N 5 posted posted r 5 follows r 6 on :"05-14" on :"05-15" Table after second MATCH : N 4 r 7 N 5 u1 u1 m1 u2 u3 answers Message N 1 N 4 · · Message N 2 N 5 · · id :22 id :25 text :"Hello" text :"World"

  34. Chaining clauses 22 User , Admin Query: User name :"Charlie" MATCH ✭ u1 u1 ✮✲❬✿ POSTED ❪✲❃✭ m1 ✮ r 8 MATCH ✭ u2 ✮❁✲❬✿ FOLLOWS ❪✲✭ u1 u1 ✮ N 6 N 3 follows ✲❬✿ FOLLOWS ❪✲❃✭ u3 ✮ r 4 r 3 User User follows Table after first MATCH : name :"Alice" name :"Bob" r 2 u1 m1 N 1 N 2 r 1 N 1 N 4 N 2 N 5 posted posted r 5 follows follows r 6 on :"05-14" on :"05-15" Table after second MATCH : N 4 r 7 N 5 u1 u1 m1 u2 u3 answers Message N 1 N 4 · · Message N 2 N 5 · · id :22 id :25 text :"Hello" text :"World"

  35. Chaining clauses 22 User , Admin Query: User name :"Charlie" MATCH ✭ u1 u1 ✮✲❬✿ POSTED ❪✲❃✭ m1 ✮ r 8 MATCH ✭ u2 ✮❁✲❬✿ FOLLOWS ❪✲✭ u1 u1 ✮ N 6 N 3 follows ✲❬✿ FOLLOWS ❪✲❃✭ u3 ✮ r 4 r 3 User User follows Table after first MATCH : name :"Alice" name :"Bob" r 2 u1 m1 N 1 N 2 r 1 N 1 N 4 N 2 N 5 posted posted r 5 follows follows r 6 on :"05-14" on :"05-15" Table after second MATCH : N 4 r 7 N 5 u1 u1 m1 u2 u3 answers Message N 1 N 4 · · Message N 2 N 5 · · id :22 id :25 text :"Hello" text :"World"

  36. Chaining clauses 22 User , Admin Query: User name :"Charlie" MATCH ✭ u1 u1 ✮✲❬✿ POSTED ❪✲❃✭ m1 ✮ r 8 MATCH ✭ u2 ✮❁✲❬✿ FOLLOWS ❪✲✭ u1 u1 ✮ N 6 N 3 follows ✲❬✿ FOLLOWS ❪✲❃✭ u3 ✮ r 4 r 3 User User follows follows Table after first MATCH : name :"Alice" name :"Bob" r 2 u1 m1 N 1 N 2 r 1 N 1 N 4 N 2 N 5 posted posted r 5 follows r 6 on :"05-14" on :"05-15" Table after second MATCH : N 4 r 7 N 5 u1 u1 m1 u2 u3 answers Message N 1 N 4 · · Message N 2 N 5 · · id :22 id :25 text :"Hello" text :"World"

  37. Chaining clauses 22 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬✿ POSTED ❪✲❃✭ m1 ✮ r 8 MATCH ✭ u2 ✮❁✲❬✿ FOLLOWS ❪✲✭ u1 ✮ N 6 N 3 follows ✲❬✿ FOLLOWS ❪✲❃✭ u3 ✮ r 4 r 3 User User follows follows Table after first MATCH : name :"Alice" name :"Bob" r 2 u1 m1 N 1 N 2 r 1 N 1 N 4 N 2 N 5 posted posted r 5 follows r 6 on :"05-14" on :"05-15" Table after second MATCH : N 4 r 7 N 5 u1 m1 u2 u3 answers Message N 2 N 5 N 1 N 3 Message N 2 N 5 N 3 N 1 id :22 id :25 text :"Hello" text :"World"

  38. Column manipulation ( WITH clause) 23 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬ p1 ✿ POSTED ❪✲❃✭ m1 ✮ r 8 WITH u1, p1, m1.text AS t1 N 6 N 3 follows r 4 r 3 User User After the MATCH clause follows name :"Alice" name :"Bob" r 2 u1 p1 m1 N 1 N 2 N 1 r 5 N 4 r 1 N 2 r 6 N 5 posted posted posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  39. Column manipulation ( WITH clause) 23 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬ p1 ✿ POSTED ❪✲❃✭ m1 ✮ r 8 WITH u1 u1, p1 p1, m1.text AS t1 t1 N 6 N 3 follows r 4 r 3 User User After the MATCH clause follows name :"Alice" name :"Bob" r 2 u1 u1 p1 p1 m1 N 1 N 2 N 1 r 5 N 4 r 1 N 2 r 6 N 5 posted posted r 5 follows r 6 on :"05-14" on :"05-15" Execution of the WITH clause N 4 r 7 N 5 u1 u1 p1 p1 t1 t1 answers Message Message N 1 r 5 id :22 id :25 N 2 r 6 text :"Hello" text :"World"

  40. Column manipulation ( WITH clause) 23 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬ p1 ✿ POSTED ❪✲❃✭ m1 ✮ r 8 WITH u1, p1, m1.text m1.text AS t1 N 6 N 3 follows r 4 r 3 User User After the MATCH clause follows name :"Alice" name :"Bob" r 2 u1 p1 m1 N 1 N 2 N 1 r 5 N 4 r 1 N 2 r 6 N 5 posted posted r 5 follows r 6 on :"05-14" on :"05-15" Execution of the WITH clause N 4 r 7 N 5 u1 p1 t1 answers Message Message N 1 r 5 id :22 id :25 N 2 r 6 text :"Hello" text :"World"

  41. Column manipulation ( WITH clause) 23 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬ p1 ✿ POSTED ❪✲❃✭ m1 ✮ r 8 WITH u1, p1, m1.text m1.text AS t1 N 6 N 3 follows r 4 r 3 User User After the MATCH clause follows name :"Alice" name :"Bob" r 2 u1 p1 m1 N 1 N 2 N 1 r 5 N 4 N 4 r 1 N 2 r 6 N 5 posted posted r 5 follows r 6 on :"05-14" on :"05-15" Execution of the WITH clause N 4 r 7 N 5 u1 p1 t1 answers Message Message N 1 r 5 "Hello" "Hello" id :22 id :25 N 2 r 6 text :"Hello" text :"Hello" text :"World"

  42. Column manipulation ( WITH clause) 23 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬ p1 ✿ POSTED ❪✲❃✭ m1 ✮ r 8 WITH u1, p1, m1.text AS t1 N 6 N 3 follows r 4 r 3 User User After the MATCH clause follows name :"Alice" name :"Bob" r 2 u1 p1 m1 N 1 N 2 N 1 r 5 N 4 r 1 N 2 r 6 N 5 N 5 posted posted r 5 follows r 6 on :"05-14" on :"05-15" Execution of the WITH clause N 4 r 7 N 5 u1 p1 t1 answers Message Message N 1 r 5 "Hello" id :22 id :25 N 2 r 6 "World" "World" text :"Hello" text :"World" text :"World"

  43. Column manipulation ( WITH clause) 23 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬ p1 ✿ POSTED ❪✲❃✭ m1 ✮ r 8 WITH u1, p1, m1.text AS t1 N 6 N 3 follows r 4 r 3 User User After the MATCH clause follows name :"Alice" name :"Bob" r 2 u1 p1 m1 N 1 N 2 N 1 r 5 N 4 r 1 N 2 r 6 N 5 posted posted r 5 follows r 6 on :"05-14" on :"05-15" Final result N 4 r 7 N 5 u1 p1 t1 answers Message Message N 1 r 5 "Hello" id :22 id :25 N 2 r 6 "World" text :"Hello" text :"World"

  44. Line filtering ( WHERE clause) 24 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬ p1 ✿ POSTED ❪✲❃✭ m1 ✮ r 8 WITH u1, p1, m1 ✳ text AS t1 N 6 N 3 follows WHERE t1 ❂ "Hello" r 4 r 3 User User follows After the WITH clause name :"Alice" name :"Bob" r 2 u1 p1 t1 N 1 N 2 r 1 N 1 r 5 "Hello" posted posted N 2 r 6 "World" r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  45. Line filtering ( WHERE clause) 24 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬ p1 ✿ POSTED ❪✲❃✭ m1 ✮ r 8 WITH u1, p1, m1 ✳ text AS t1 N 6 N 3 follows WHERE t1 ❂ "Hello" r 4 r 3 User User follows After the WITH clause name :"Alice" name :"Bob" r 2 u1 p1 t1 N 1 N 2 r 1 N 1 r 5 "Hello" posted posted N 2 r 6 "World" r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 Execution of the WHERE clause N 5 u1 p1 t1 answers Message Message id :22 id :25 N 1 r 5 "Hello" text :"Hello" text :"World" N 2 r 6 "World"

  46. Line filtering ( WHERE clause) 24 User , Admin Query: User name :"Charlie" MATCH ✭ u1 ✮✲❬ p1 ✿ POSTED ❪✲❃✭ m1 ✮ r 8 WITH u1, p1, m1 ✳ text AS t1 N 6 N 3 follows WHERE t1 ❂ "Hello" r 4 r 3 User User follows After the WITH clause name :"Alice" name :"Bob" r 2 u1 p1 t1 N 1 N 2 r 1 N 1 r 5 "Hello" posted posted N 2 r 6 "World" r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 Final result N 5 u1 p1 t1 answers Message Message id :22 id :25 N 1 r 5 "Hello" text :"Hello" text :"World"

  47. A last read-only example 25 User , Admin Query: User name :"Charlie" MATCH ✭ a{name ✿ "Bob"} ✮ r 8 ✲❬ * ❪✲❃✭ b{id ✿ 22} ✮ N 6 N 3 follows ❁✲❬ * ❪✲✭ a ✮ r 4 r 3 User User follows Question name :"Alice" name :"Bob" name :"Bob" r 2 What does this computes ? N 1 N 2 r 1 posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :22 id :25 text :"Hello" text :"World"

  48. A last read-only example 25 User , Admin Query: User name :"Charlie" MATCH ✭ a{name ✿ "Bob"} ✮ r 8 ✲❬ * ❪✲❃✭ b{id ✿ 22} ✮ N 6 N 3 follows ❁✲❬ * ❪✲✭ a ✮ r 4 r 3 User User follows Question name :"Alice" name :"Bob" name :"Bob" r 2 What does this computes ? N 1 N 2 r 1 Answer posted posted r 5 follows r 6 The # of pairs of disjoint paths on :"05-14" on :"05-15" from N 2 to N 4 . N 4 r 7 N 5 answers Message Message id :22 id :22 id :25 text :"Hello" text :"World"

  49. A last read-only example 25 User , Admin Query: User name :"Charlie" MATCH ✭ a{name ✿ "Bob"} ✮ r 8 ✲❬ * ❪✲❃✭ b{id ✿ 22} ✮ N 6 N 3 follows ❁✲❬ * ❪✲✭ a ✮ r 4 r 3 User User follows Question name :"Alice" name :"Bob" name :"Bob" r 2 What does this computes ? N 1 N 2 r 1 Answer posted posted r 5 follows r 6 The # of pairs of disjoint paths on :"05-14" on :"05-15" from N 2 to N 4 . N 4 r 7 N 5 ⇒ Evaluation of one constant answers Message Message MATCH is NP-HARD id :22 id :22 id :25 text :"Hello" text :"World"

  50. Node and relation creation ( CREATE ) 26 User , Admin Query: User name :"Charlie" name :"Charlie" MATCH ✭ a{name ✿ "Charlie"} ✮ r 8 CREATE ✭ a ✮✲❬✿ FOLLOWS ❪✲❃ N 6 N 3 follows ✭ b ✿ User ✮ r 4 r 3 User User follows Table after MATCH clause: name :"Alice" name :"Bob" r 2 a N 1 N 2 r 1 N 3 posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  51. Node and relation creation ( CREATE ) 26 User , Admin Query: User User name :"Charlie" name :"Charlie" MATCH ✭ a{name ✿ "Charlie"} ✮ r 8 CREATE ✭ a ✮✲❬✿ FOLLOWS ❪✲❃ N 6 N 3 follows follows ✭ b ✿ User ✮ r 4 r 3 User User follows Table after MATCH clause: name :"Alice" name :"Bob" r 2 a N 1 N 2 r 1 N 3 posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  52. Node and relation creation ( CREATE ) 26 User , Admin Query: User name :"Charlie" MATCH ✭ a{name ✿ "Charlie"} ✮ r 8 CREATE ✭ a ✮✲❬✿ FOLLOWS ❪✲❃ N 6 N 3 follows ✭ b ✿ User ✮ r 4 r 3 User User follows Table after MATCH clause: name :"Alice" name :"Bob" r 2 a N 1 N 2 r 1 N 3 posted posted r 5 follows r 6 on :"05-14" on :"05-15" Table after CREATE clause: a b N 4 r 7 N 5 N 3 N 6 answers Message Message id :22 id :25 text :"Hello" text :"World"

  53. The example graph stored as CREATE clauses 27 User , Admin Query: User name :"Charlie" CREATE r 8 ✭ n1 ✿ User{name ✿ "Alice"} ✮ , N 6 N 3 follows ✭ n2 ✿ User{name ✿ "Bob"} ✮ , ✭ n3 ✿ User ✿ Admin r 4 r 3 User User follows {name ✿ "Charlie"} ✮ , name :"Alice" name :"Bob" ✭ n4 ✿ Message {id ✿ 22, r 2 text ✿ "Hello"} ✮ , N 1 N 2 ✭ n5 ✿ Message {id ✿ 25, r 1 text ✿ "World"} ✮ CREATE posted posted r 5 follows r 6 ✭ n1 ✮✲❬✿ FOLLOWS ❪✲❃✭ n2 ✮ , on :"05-14" on :"05-15" ✭ n1 ✮✲❬✿ POSTED {on ✿ "05-04"} ❪✲❃✭ n4 ✮ , N 4 r 7 ✭ n2 ✮✲❬✿ FOLLOWS ❪✲❃✭ n1 ✮ , N 5 ✭ n2 ✮✲❬✿ FOLLOWS ❪✲❃✭ n3 ✮ , ✭ n2 ✮✲❬✿ POSTED answers Message Message {on ✿ "05-04"} ❪✲❃✭ n5 ✮ , id :22 id :25 ✭ n3 ✮✲❬✿ FOLLOWS ❪✲❃✭ n1 ✮ , text :"Hello" text :"World" ✭ n5 ✮✲❬✿ ANSWERS ❪✲❃✭ n4 ✮ ,

  54. Node/Relation modification ( SET clause) 28 User , Admin Query: User name :"Charlie" MATCH ✭ a{name ✿ "Charlie"} ✮ r 8 CREATE ✭ a ✮✲❬✿ FOLLOWS ❪✲❃ N 6 N 3 follows ✭ b ✿ User ✮ SET b ✿ Admin, b ✳ name ❂ "Eve" r 4 r 3 User User follows name :"Alice" name :"Bob" Table after CREATE clause: r 2 N 1 N 2 a b r 1 N 3 N 6 posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  55. Node/Relation modification ( SET clause) 28 User , Admin Admin User , Admin Query: name :"Eve" name :"Eve" name :"Charlie" MATCH ✭ a{name ✿ "Charlie"} ✮ r 8 CREATE ✭ a ✮✲❬✿ FOLLOWS ❪✲❃ N 6 N 3 follows ✭ b ✿ User ✮ SET b ✿ Admin, b ✳ name ❂ "Eve" r 4 r 3 User User follows name :"Alice" name :"Bob" Table after CREATE clause: r 2 N 1 N 2 a b r 1 N 3 N 6 posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers Message Message id :22 id :25 text :"Hello" text :"World"

  56. The MERGE clause : MATCH else CREATE 29 User , Admin Input table: User name :"Charlie" r 8 a n N 6 N 3 follows N 3 "Alice" N 3 "Eve" r 4 r 3 User User follows name :"Alice" name :"Bob" r 2 Query: N 1 N 2 r 1 MERGE ✭ a ✮✲❬✿ FOLLOWS ❪✲❃ ✭ b ✿ User {name ✿ n} ✮ posted posted r 5 follows r 6 on :"05-14" on :"05-15" Output table: a n c N 4 r 7 N 5 N 3 "Alice" answers Message Message N 3 "Eve" id :22 id :25 text :"Hello" text :"World"

  57. The MERGE clause : MATCH else CREATE 29 User , Admin Input table: User name :"Charlie" r 8 a n N 6 N 3 follows N 3 "Alice" N 3 "Eve" r 4 r 3 User User User follows follows name :"Alice" name :"Alice" name :"Bob" r 2 Query: N 1 N 2 r 1 MERGE ✭ a ✮✲❬✿ FOLLOWS ❪✲❃ ✭ b ✿ User {name ✿ n} ✮ posted posted r 5 follows r 6 on :"05-14" on :"05-15" Output table: a n c N 4 r 7 N 5 N 3 "Alice" N 1 answers Message Message N 3 "Eve" id :22 id :25 text :"Hello" text :"World"

  58. The MERGE clause : MATCH else CREATE 29 User User User , Admin Input table: name :"Eve" name :"Eve" name :"Charlie" r 8 a n N 6 N 3 follows follows N 3 "Alice" N 3 "Eve" r 4 r 3 User User follows name :"Alice" name :"Bob" r 2 Query: N 1 N 2 r 1 MERGE ✭ a ✮✲❬✿ FOLLOWS ❪✲❃ ✭ b ✿ User {name ✿ n} ✮ posted posted r 5 follows r 6 on :"05-14" on :"05-15" Output table: a n c N 4 r 7 N 5 N 3 "Alice" N 1 answers Message Message N 3 "Eve" N 6 id :22 id :25 text :"Hello" text :"World"

  59. The MERGE clause : MATCH else CREATE 29 User User , Admin Input table: name :"Eve" name :"Charlie" r 8 a n N 6 N 3 follows N 3 "Alice" N 3 "Eve" r 4 r 3 User User follows name :"Alice" name :"Bob" r 2 Query: N 1 N 2 r 1 MERGE ✭ a ✮✲❬✿ FOLLOWS ❪✲❃ ✭ b ✿ User {name ✿ n} ✮ posted posted r 5 follows r 6 on :"05-14" on :"05-15" Output table: a n c N 4 r 7 N 5 N 3 "Alice" N 1 answers Message Message N 3 "Eve" N 6 id :22 id :25 text :"Hello" text :"World"

  60. Other constructs 30 DELETE deletes node and relations. Ex: MATCH ✭ a{name ✿ "Eve"} ✮ DELETE a REMOVE removes labels or properties. Ex: MATCH ✭ a{name ✿ "Charlie"} ✮ REMOVE a ✿ Admin,a ✳ name WITH allows to perform aggregations. Ex: MATCH ✭ a ✮✲❬✿ FOLLOWS ❪✲❃✭ b ✮ WITH a, count ✭ b ✮ as c ORDER BY limits size of table. Ex: MATCH ✭ a ✿ User ✮ ORDER BY a ✳ name LIMIT 1

  61. Outline 31 1 Introduction 2 Property graphs 3 Regular Path Queries 4 Cypher by example 5 Principles of the semantics 6 Towards a standard language for querying property graphs

  62. Modelling Tables 31 Record (table row) A record is a partial function from variables to values. Example: ( x �→ "Bob" ; y �→ 1 )

  63. Modelling Tables 31 Record (table row) A record is a partial function from variables to values. Example: ( x �→ "Bob" ; y �→ 1 ) Table A table is a multi-set (or bag) of records with the same domain. Example: x y "Bob" 1 999 "Alice" 1 "Bob"

  64. Modelling Tables 31 Record (table row) A record is a partial function from variables to values. Example: ( x �→ "Bob" ; y �→ 1 ) Table A table is a multi-set (or bag) of records with the same domain. Example: x x y y "Bob" 1 999 "Alice" = 999 1 "Alice" "Bob" 1 1 "Bob" "Bob"

  65. Semantics brackets – Read-Only 32 G : a graph Semantics of expressions � � � � · u , G : expression �−→ value (where u is a record) Semantics of clauses � � � � · G : clause �−→ (function: Tables → Tables) Semantics of queries � � � � · G : query �−→ (function: Tables → Tables) output : (Graphs × Queries) �−→ Tables

  66. Principle of Read-Only Semantics 33 G : a graph Q : a query To compute the output of Q Q is a sequence of clauses Q = C 1 C 2 · · · C n

  67. Principle of Read-Only Semantics 33 G : a graph Q : a query To compute the output of Q Q is a sequence of clauses Q = C 1 C 2 · · · C n � � � � � � � � � � � � Compute C 1 C 2 C n G , G , . . . , G

  68. Principle of Read-Only Semantics 33 G : a graph Q : a query To compute the output of Q Q is a sequence of clauses Q = C 1 C 2 · · · C n � � � � � � � � � � � � Compute C 1 C 2 C n G , G , . . . , G � � � � � � � � � � � � � � � � Let Q C n G ◦ · · · ◦ C 2 G ◦ C 1 G = G

  69. Principle of Read-Only Semantics 33 G : a graph Q : a query To compute the output of Q Q is a sequence of clauses Q = C 1 C 2 · · · C n � � � � � � � � � � � � Compute C 1 C 2 C n G , G , . . . , G � � � � � � � � � � � � � � � � Let Q C n G ◦ · · · ◦ C 2 G ◦ C 1 G = G � � � � � � output ( G , Q ) = Q T unit G where T unit is the 1-line 0-column table.

  70. Excerpt of Read-Only semantics (2) 34 � � � � � � � � � � � � � WHERE e G ( T ) = u ∈ T e G , u = true � � � � � � { u · u ′ | u ′ ∈ match ( ¯ MATCH ¯ G ( T ) = π, G , u )} π u ∈ T � � � � � � � � �� � � � � G ( T ) = G ( T ) MATCH ¯ π WHERE e WHERE e MATCH ¯ π � � � � OPTIONAL MATCH ¯ π WHERE e G ( T ) � � � � � � � � � � G ({ u }) if G ({ u }) � ∅ MATCH ¯ π WHERE e MATCH ¯ π WHERE e = ( u , ( free ( u , ¯ π ) : null )) otherwise u ∈ T � � � � � � � � OPTIONAL MATCH ¯ G ( T ) = OPTIONAL MATCH ¯ π WHERE true G ( T ) π

  71. Excerpt of Read-Only semantics (2) 35 � � � � G ( T ) = T if T has at least one column WITH ∗ � � � � WITH ∗ , e 1 [ AS a 1 ] ,. . ., e m [ AS a m ] G ( T ) = � � � � WITH b 1 AS b 1 ,. . ., b q AS b q , e 1 [ AS a 1 ] ,. . ., e m [ AS a m ] G ( T ) � � � � WITH e 1 [ AS a 1 ] ,. . ., e m [ AS a m ] G ( T ) = � � � � � � � � � � � ( a ′ G , u ,. . ., a ′ G , u ) e 1 e m 1 : m : u ∈ T � � � � � � UNWIND e AS a G ( T ) = {( u , a : v )} , u ∈ T v ∈ E u � � � � �   0 ≤ i < m { v i } if G , u = list ( v 0 ,. . ., v m − 1 ) e    � � � �    {} if e G , u = list () with E u =  �� � � � �     otherwise e   G , u

  72. Semantics brackets – Read-Write 36 Semantics of expressions: (Nothing changes) � � � � · u , G : expression �−→ value (where u is a record) Semantics of clauses: � � � � · : clause �−→ (function: (Graphs × Tables) → (Graphs × Tables)) Semantics of queries: � � � � · : query �−→ (function: (Graphs × Tables) → (Graphs × Tables)) output : (Graphs × Queries) �−→ (Graphs × Tables) (Computed just like RO → composition of clause semantics)

  73. Desirable properties of the semantics at Clause-level 37 Atomicity: Each clause is executed as a single unit Consistency: Each clause should on valid Graph/Table pair General scheme of the semantics if a clause is: 1 Ensure that the input Graph/Table is valid w.r.t. clause 2 Compute output Table and all changes to graph 3 Apply all changes to Graph 4 Ensure validity of output Graph/Table If any fails, semantics is undefined.

  74. Desirable properties of the semantics at Clause-level 37 Atomicity: Each clause is executed as a single unit Consistency: Each clause should on valid Graph/Table pair General scheme of the semantics if a clause is: 1 Ensure that the input Graph/Table is valid w.r.t. clause 2 Compute output Table and all changes to graph 3 Apply all changes to Graph 4 Ensure validity of output Graph/Table If any fails, semantics is undefined. In Neo4j, Atomicity and Consistency are verified at query level only.

  75. In Neo4j, SET violate Atomicity 38 User , Admin Query: User name :"Charlie" MATCH ✭ m1 ✮✲❬✿ ANSWERS ❪✲❃✭ m2 ✮ r 8 SET m1 ✳ id ❂ m2 ✳ id, N 6 N 3 follows m2 ✳ id ❂ m1 ✳ id r 4 r 3 User User follows Table before SET clause: name :"Alice" name :"Bob" r 2 m1 m2 N 1 N 2 r 1 N 5 N 4 posted posted r 5 follows r 6 on :"05-14" on :"05-15" N 4 r 7 N 5 answers answers Message Message id :22 id :22 id :25 id :25 text :"Hello" text :"World"

  76. In Neo4j, SET violate Atomicity 38 User , Admin Query: User name :"Charlie" MATCH ✭ m1 ✮✲❬✿ ANSWERS ❪✲❃✭ m2 ✮ r 8 SET m1 ✳ id ❂ m2 ✳ id, N 6 N 3 follows m2 ✳ id ❂ m1 ✳ id r 4 r 3 User User follows Table before SET clause: name :"Alice" name :"Bob" r 2 m1 m2 N 1 N 2 r 1 N 5 N 4 posted posted r 5 follows r 6 on :"05-14" on :"05-15" Neo4j sets both id to 25. N 4 r 7 N 5 Semantics exchange id values answers answers Message Message id :22 id :22 id :25 id :25 text :"Hello" text :"World"

Recommend

Formal Semantics of SQL (and Cypher) Paolo Guagliardo SQL Standard query language for

Formal Semantics of SQL (and Cypher) Paolo Guagliardo SQL Standard query language for

Formal Semantics of SQL (and Cypher) Paolo Guagliardo SQL Standard query language for relational databases $30B/year business Implemented in all major RDBMSs (free and commercial) First standardized in 1986 (ANSI) and 1987 (ISO)

471 views • 13 slides
Formal Specification of Cypher Nadime Francis University of Edinburgh Wednesday, May, 10th 1 /

Formal Specification of Cypher Nadime Francis University of Edinburgh Wednesday, May, 10th 1 /

Semantics Overview Ambiguous and Edge Cases Incomplete and Inconsistent Cases Formal Specification of Cypher Nadime Francis University of Edinburgh Wednesday, May, 10th 1 / 16 Semantics Overview Ambiguous and Edge Cases Incomplete and

523 views • 38 slides
Introductory Notes Jigsaw Semantics or: Dynamic Semantics Put Together Again Formal semantics

Introductory Notes Jigsaw Semantics or: Dynamic Semantics Put Together Again Formal semantics

Jigsaw Semantics Introduction Introductory Notes Jigsaw Semantics or: Dynamic Semantics Put Together Again Formal semantics and formal pragmatics: the disciplines are much scattered and seriously challenged, or so it seems. Formal

164 views • 12 slides
Cypher.PL Prolog Cypher Implementation SoCIM, 10th of May 2017 London Jan Posiadaa

Cypher.PL Prolog Cypher Implementation SoCIM, 10th of May 2017 London Jan Posiadaa

Cypher.PL Prolog Cypher Implementation SoCIM, 10th of May 2017 London Jan Posiadaa janek@tiger.com.pl Prolog Implementation Cypher.PL Cypher implementation in SWI-Prolog: formal implementation... ...or rather executable

464 views • 15 slides
Lexical Semantics in Formal Semantics: History and Challenges . Barbara H. Partee

Lexical Semantics in Formal Semantics: History and Challenges . Barbara H. Partee

Lexical Semantics in Formal Semantics: History and Challenges . Barbara H. Partee partee@linguist.umass.edu ESSLLI RefSemPlus Workshop, August 2016 1. Introduction n The early important achievements of formal semantics that made it of

1.01k views • 36 slides
Introduction to formal semantics - Enrico Leonhardt Introduction to formal semantics 1 / 25

Introduction to formal semantics - Enrico Leonhardt Introduction to formal semantics 1 / 25

Introduction to formal semantics - Enrico Leonhardt Introduction to formal semantics 1 / 25 Enrico Leonhardt | Motivation | Semiotics | Formal semantics in CS | structure Motivation - Philosophy paradox antinomy

710 views • 25 slides
Formal Semantics in Modern Type Theories (and Event Semantics in MTT-Framework) Zhaohui Luo

Formal Semantics in Modern Type Theories (and Event Semantics in MTT-Framework) Zhaohui Luo

Formal Semantics in Modern Type Theories (and Event Semantics in MTT-Framework) Zhaohui Luo Royal Holloway University of London This talk I. Formal semantics in Modern Type Theories: overview MTT-semantics is both model-theoretic and

564 views • 30 slides
Cypher Knowledge Graphs slide 1 of 14 Cypher overview Cypher is a family of query languages for

Cypher Knowledge Graphs slide 1 of 14 Cypher overview Cypher is a family of query languages for

Cypher Knowledge Graphs slide 1 of 14 Cypher overview Cypher is a family of query languages for Property Graphs: Proprietary query language of the Neo4j graph database Subset supported by other tools as well: openCypher Might be an

333 views • 18 slides
More Theories, Formal semantics Jirka Hana Parts are based on slides by Carl Pollard Charles

More Theories, Formal semantics Jirka Hana Parts are based on slides by Carl Pollard Charles

More Theories Formal Semantics A Logical Grammar More Theories, Formal semantics Jirka Hana Parts are based on slides by Carl Pollard Charles University, 2011-11-12 Jirka Hana More Theories, Formal semantics More Theories Formal Semantics

732 views • 56 slides
11/19/10 Introduction Semantics can mean quite different things in different

11/19/10 Introduction Semantics can mean quite different things in different

11/19/10 Introduction Semantics can mean quite different things in different contexts; fields concerned with semantics are as diverse as psychology, law, Formal Semantics and Pragmatics: computer science, lexicography, logic,

393 views • 10 slides
Programming Languages Third Edition Chapter 12 Formal Semantics Objectives Become familiar

Programming Languages Third Edition Chapter 12 Formal Semantics Objectives Become familiar

Programming Languages Third Edition Chapter 12 Formal Semantics Objectives Become familiar with a sample small language for the purpose of semantic specification Understand operational semantics Understand denotational semantics

789 views • 48 slides
Towards a Formal Semantics for FHM, Part I FPL Away Days 2011 Henrik Nilsson Joint work with

Towards a Formal Semantics for FHM, Part I FPL Away Days 2011 Henrik Nilsson Joint work with

Towards a Formal Semantics for FHM, Part I FPL Away Days 2011 Henrik Nilsson Joint work with Joey Capper School of Computer Science University of Nottingham Towards a Formal Semantics for FHM, Part I p.1/31 Hybrid Systems Hybrid system:

511 views • 49 slides
A Formal Semantics for PLEX Johan Erikson; johan.erikson@idt.mdh.se Bjrn Lisper;

A Formal Semantics for PLEX Johan Erikson; johan.erikson@idt.mdh.se Bjrn Lisper;

A Formal Semantics for PLEX Johan Erikson; johan.erikson@idt.mdh.se Bjrn Lisper; bjorn.lisper@mdh.se Mlardalen University Department of Computer Science and Engineering Vsters Sweden A Formal Semantics for PLEX The AXE telephone

267 views • 9 slides
Bridging formal and conceptual semantics Tillmann Pross (joint work with Antje Rodeutscher)

Bridging formal and conceptual semantics Tillmann Pross (joint work with Antje Rodeutscher)

Bridging formal and conceptual semantics Tillmann Pross (joint work with Antje Rodeutscher) Institute for Natural Language Processing, University of Stuttgart IMS IV 28/10/2015 Formal vs. Conceptual Semantics: Over the last decades,

553 views • 29 slides
Formal, Executable Semantics of Web Languages: JavaScript and PHP Sergio Ma ff eis Imperial

Formal, Executable Semantics of Web Languages: JavaScript and PHP Sergio Ma ff eis Imperial

Formal, Executable Semantics of Web Languages: JavaScript and PHP Sergio Ma ff eis Imperial College London In collaboration with: J. Mitchell (Stanford), A. Taly (Google), K. Bhargavan, M. Bodin, A. Charugeraud, A. Delignat-Lavaud, A. Schmitt

784 views • 26 slides
Semantics 1 / 21 Outline What is semantics? Denotational semantics Semantics of naming What

Semantics 1 / 21 Outline What is semantics? Denotational semantics Semantics of naming What

Semantics 1 / 21 Outline What is semantics? Denotational semantics Semantics of naming What is semantics? 2 / 21 What is the meaning of a program? Recall: aspects of a language syntax : the structure of its programs semantics : the

551 views • 21 slides
Multiprocessor Memory Model Verification Paul Loewenstein, Shailender Chaudhry, Robert Cypher,

Multiprocessor Memory Model Verification Paul Loewenstein, Shailender Chaudhry, Robert Cypher,

Multiprocessor Memory Model Verification Paul Loewenstein, Shailender Chaudhry, Robert Cypher, Chaiyasit Manovit 21 August 2006 Federated Logic Conference 2006 Automated Formal Methods 1 21 August 2006 Summary Introduction. Related Work.

541 views • 20 slides
Logic and Natural Language Semantics: Formal Semantics Raffaella Bernardi DISI, University of

Logic and Natural Language Semantics: Formal Semantics Raffaella Bernardi DISI, University of

Logic and Natural Language Semantics: Formal Semantics Raffaella Bernardi DISI, University of Trento e-mail: bernardi@disi.unitn.it Contents First Last Prev Next Contents 1 Logic . . . . . . . . . . . . . . . . . . . . . . . . . . .

952 views • 45 slides
Why formalize? ! ML is tricky, particularly in corner cases Formal Semantics ! generalizable type

Why formalize? ! ML is tricky, particularly in corner cases Formal Semantics ! generalizable type

Why formalize? ! ML is tricky, particularly in corner cases Formal Semantics ! generalizable type variables? ! polymorphic references? ! exceptions? ! Some things are often overlooked for any language ! evaluation order? side-effects? errors? !

603 views • 3 slides
Why formalize? n ML is tricky, particularly in corner cases Formal Semantics n generalizable type

Why formalize? n ML is tricky, particularly in corner cases Formal Semantics n generalizable type

Why formalize? n ML is tricky, particularly in corner cases Formal Semantics n generalizable type variables? n polymorphic references? n exceptions? n Some things are often overlooked for any language n evaluation order? side-effects? errors? n

371 views • 17 slides
ORIGINS AND IMPACT OF FORMAL SEMANTICS Troy Kaighin Astarte t.astarte @

ORIGINS AND IMPACT OF FORMAL SEMANTICS Troy Kaighin Astarte t.astarte @

ORIGINS AND IMPACT OF FORMAL SEMANTICS Troy Kaighin Astarte t.astarte @ ncl.ac.uk 1 INTRODUCTION Programming in the1950s: machine code systems Computation in terms of machinemeaning fairly clear FORTRAN: FORmula

540 views • 20 slides
CSC 530 Lecture Notes Week 5 More on Formal Semantics with Attribute Grammars CSC530-W02-L5

CSC 530 Lecture Notes Week 5 More on Formal Semantics with Attribute Grammars CSC530-W02-L5

CSC530-W02-L5 Slide 1 CSC 530 Lecture Notes Week 5 More on Formal Semantics with Attribute Grammars CSC530-W02-L5 Slide 2 I. Attribute semantics of real programming languages A. Last weeks pretty trivial B. These notes investigate SIL

790 views • 53 slides
First-order logic C h a p t e r 8 1 Outline Why FOL? Syntax and semantics of FOL

First-order logic C h a p t e r 8 1 Outline Why FOL? Syntax and semantics of FOL

First-order logic C h a p t e r 8 1 Outline Why FOL? Syntax and semantics of FOL Fun with sentences Wumpus world in FOL 2 Thinking about formal languages Programming languages = formal languages. Most widely used type

670 views • 22 slides
Logic and Natural Language Semantics: Distributional Semantics R affaella B ernardi DISI, U

Logic and Natural Language Semantics: Distributional Semantics R affaella B ernardi DISI, U

Logic and Natural Language Semantics: Distributional Semantics R affaella B ernardi DISI, U niversity of T rento e - mail : bernardi @ disi . unitn . it Contents First Last Prev Next Contents 1 Formal Semantics Applications . . . . . .

628 views • 50 slides

More recommend