unification
play

Unification Temur Kutsia RISC, Johannes Kepler University Linz, - PowerPoint PPT Presentation

May 17, 2023 •10 likes •1.45k views

Unification Temur Kutsia RISC, Johannes Kepler University Linz, Austria kutsia@risc.jku.at Improving the Recursive Descent Algorithm Improvement 1: Linear Space, Exponential Time Improvement 2. Linear Space, Quadratic Time

  1. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find (2), Find (8)) Find ( 2 ) = ( 2 ) f ( 1 ) f ( 7 ) Find ( 8 ) = ( 8 ) Occur ( 2 , 8 ) = False x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) a ( 5 ) z ( 6 ) y ( 10 )

  2. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find (2), Find (8)) Find ( 2 ) = ( 2 ) f ( 1 ) f ( 7 ) Find ( 8 ) = ( 8 ) Occur ( 2 , 8 ) = False x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Union ( 2 , 8 ) a ( 5 ) z ( 6 ) y ( 10 )

  3. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find (2), Find (8)) Find ( 2 ) = ( 2 ) f ( 1 ) f ( 7 ) Find ( 8 ) = ( 8 ) Occur ( 2 , 8 ) = False x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Union ( 2 , 8 ) Unify1 ( Find ( 3 ) , Find ( 9 )) a ( 5 ) z ( 6 ) y ( 10 )

  4. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find (2), Find (8)) Find ( 2 ) = ( 2 ) f ( 1 ) f ( 7 ) Find ( 8 ) = ( 8 ) Occur ( 2 , 8 ) = False x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Union ( 2 , 8 ) Unify1 ( Find ( 3 ) , Find ( 9 )) a ( 5 ) z ( 6 ) y ( 10 ) Find ( 3 ) = ( 3 )

  5. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find (2), Find (8)) Find ( 2 ) = ( 2 ) f ( 1 ) f ( 7 ) Find ( 8 ) = ( 8 ) Occur ( 2 , 8 ) = False x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Union ( 2 , 8 ) Unify1 ( Find ( 3 ) , Find ( 9 )) a ( 5 ) z ( 6 ) y ( 10 ) Find ( 3 ) = ( 3 ) Find ( 9 ) = ( 9 )

  6. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find (2), Find (8)) Find ( 2 ) = ( 2 ) f ( 1 ) f ( 7 ) Find ( 8 ) = ( 8 ) Occur ( 2 , 8 ) = False x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Union ( 2 , 8 ) Unify1 ( Find ( 3 ) , Find ( 9 )) a ( 5 ) z ( 6 ) y ( 10 ) Find ( 3 ) = ( 3 ) Find ( 9 ) = ( 9 ) Unify1 ( Find ( 5 ) , Find ( 10 ))

  7. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find (2), Find (8)) Find ( 2 ) = ( 2 ) f ( 1 ) f ( 7 ) Find ( 8 ) = ( 8 ) Occur ( 2 , 8 ) = False x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Union ( 2 , 8 ) Unify1 ( Find ( 3 ) , Find ( 9 )) a ( 5 ) z ( 6 ) y ( 10 ) Find ( 3 ) = ( 3 ) Find ( 9 ) = ( 9 ) Unify1 ( Find ( 5 ) , Find ( 10 )) Find ( 5 ) = 5

  8. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find (2), Find (8)) Find ( 2 ) = ( 2 ) f ( 1 ) f ( 7 ) Find ( 8 ) = ( 8 ) Occur ( 2 , 8 ) = False x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Union ( 2 , 8 ) Unify1 ( Find ( 3 ) , Find ( 9 )) a ( 5 ) z ( 6 ) y ( 10 ) Find ( 3 ) = ( 3 ) Find ( 9 ) = ( 9 ) Unify1 ( Find ( 5 ) , Find ( 10 )) Find ( 5 ) = 5 Find ( 10 ) = 10

  9. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find (2), Find (8)) Find ( 2 ) = ( 2 ) f ( 1 ) f ( 7 ) Find ( 8 ) = ( 8 ) Occur ( 2 , 8 ) = False x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Union ( 2 , 8 ) Unify1 ( Find ( 3 ) , Find ( 9 )) a ( 5 ) z ( 6 ) y ( 10 ) Find ( 3 ) = ( 3 ) Find ( 9 ) = ( 9 ) Unify1 ( Find ( 5 ) , Find ( 10 )) Find ( 5 ) = 5 Find ( 10 ) = 10 orient ( 10 , 5 )

  10. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find (2), Find (8)) Find ( 2 ) = ( 2 ) f ( 1 ) f ( 7 ) Find ( 8 ) = ( 8 ) Occur ( 2 , 8 ) = False x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Union ( 2 , 8 ) Unify1 ( Find ( 3 ) , Find ( 9 )) a ( 5 ) z ( 6 ) y ( 10 ) Find ( 3 ) = ( 3 ) Find ( 9 ) = ( 9 ) Unify1 ( Find ( 5 ) , Find ( 10 )) Find ( 5 ) = 5 Find ( 10 ) = 10 orient ( 10 , 5 ) Occur ( 10 , 5 ) = False

  11. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find (2), Find (8)) Find ( 2 ) = ( 2 ) f ( 1 ) f ( 7 ) Find ( 8 ) = ( 8 ) Occur ( 2 , 8 ) = False x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Union ( 2 , 8 ) Unify1 ( Find ( 3 ) , Find ( 9 )) a ( 5 ) z ( 6 ) y ( 10 ) Find ( 3 ) = ( 3 ) Find ( 9 ) = ( 9 ) Unify1 ( Find ( 5 ) , Find ( 10 )) Find ( 5 ) = 5 Find ( 10 ) = 10 orient ( 10 , 5 ) Occur ( 10 , 5 ) = False Union ( 10 , 5 )

  12. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: f ( 1 ) f ( 7 ) x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) a ( 5 ) z ( 6 ) y ( 10 )

  13. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find ( 4 ) , Find ( 2 )) f ( 1 ) f ( 7 ) x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) a ( 5 ) z ( 6 ) y ( 10 )

  14. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find ( 4 ) , Find ( 2 )) Find ( 4 ) = 4 f ( 1 ) f ( 7 ) x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) a ( 5 ) z ( 6 ) y ( 10 )

  15. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find ( 4 ) , Find ( 2 )) Find ( 4 ) = 4 f ( 1 ) f ( 7 ) Find ( 2 ) = 8 x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) a ( 5 ) z ( 6 ) y ( 10 )

  16. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find ( 4 ) , Find ( 2 )) Find ( 4 ) = 4 f ( 1 ) f ( 7 ) Find ( 2 ) = 8 Unify1 ( 4 , 8 ) x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) a ( 5 ) z ( 6 ) y ( 10 )

  17. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find ( 4 ) , Find ( 2 )) Find ( 4 ) = 4 f ( 1 ) f ( 7 ) Find ( 2 ) = 8 Unify1 ( 4 , 8 ) x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Unify1 ( Find ( 6 ) , Find ( 10 )) a ( 5 ) z ( 6 ) y ( 10 )

  18. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find ( 4 ) , Find ( 2 )) Find ( 4 ) = 4 f ( 1 ) f ( 7 ) Find ( 2 ) = 8 Unify1 ( 4 , 8 ) x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Unify1 ( Find ( 6 ) , Find ( 10 )) Find ( 6 ) = 6 a ( 5 ) z ( 6 ) y ( 10 )

  19. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find ( 4 ) , Find ( 2 )) Find ( 4 ) = 4 f ( 1 ) f ( 7 ) Find ( 2 ) = 8 Unify1 ( 4 , 8 ) x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Unify1 ( Find ( 6 ) , Find ( 10 )) Find ( 6 ) = 6 a ( 5 ) z ( 6 ) y ( 10 ) Find ( 10 ) = 5

  20. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find ( 4 ) , Find ( 2 )) Find ( 4 ) = 4 f ( 1 ) f ( 7 ) Find ( 2 ) = 8 Unify1 ( 4 , 8 ) x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Unify1 ( Find ( 6 ) , Find ( 10 )) Find ( 6 ) = 6 a ( 5 ) z ( 6 ) y ( 10 ) Find ( 10 ) = 5 Occur ( 6 , 5 ) = False

  21. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find ( 4 ) , Find ( 2 )) Find ( 4 ) = 4 f ( 1 ) f ( 7 ) Find ( 2 ) = 8 Unify1 ( 4 , 8 ) x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Unify1 ( Find ( 6 ) , Find ( 10 )) Find ( 6 ) = 6 a ( 5 ) z ( 6 ) y ( 10 ) Find ( 10 ) = 5 Occur ( 6 , 5 ) = False Union ( 6 , 5 )

  22. RDA on Term Dags. Example 1 Algorithm run starts with Unify1 ( 1 , 7 ) and continues: Unify1 ( Find ( 4 ) , Find ( 2 )) Find ( 4 ) = 4 f ( 1 ) f ( 7 ) Find ( 2 ) = 8 Unify1 ( 4 , 8 ) x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) Unify1 ( Find ( 6 ) , Find ( 10 )) Find ( 6 ) = 6 a ( 5 ) z ( 6 ) y ( 10 ) Find ( 10 ) = 5 Occur ( 6 , 5 ) = False Union ( 6 , 5 ) True

  23. RDA on Term Dags. Example 1 (Cont.) f ( 1 ) f ( 7 ) x ( 2 ) g ( 3 ) g ( 4 ) g ( 8 ) g ( 9 ) a ( 5 ) z ( 6 ) y ( 10 ) ◮ From the final dag one can read off: ◮ The unified term f ( g ( a ) , g ( a ) , g ( a )) . ◮ The mgu in triangular form [ x �→ g ( y ); y �→ a ; z �→ a ] . ◮ The algorithm does not create new nodes. Only one extra pointer for each variable node. ◮ Needs linear space. ◮ Time is still exponential. See the next example.

  24. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  25. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  26. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  27. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  28. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  29. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  30. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  31. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  32. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  33. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  34. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  35. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  36. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  37. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  38. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  39. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  40. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  41. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  42. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  43. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  44. RDA on Term Dags. Example 2 Consider again the problem: s = h ( x 1 , x 2 , . . . , x n , f ( y 0 , y 0 ) , f ( y 1 , y 1 ) , . . . , f ( y n − 1 , y n − 1 ) , y n ) t = h ( f ( x 0 , x 0 ) , f ( x 1 , x 1 ) , . . . , f ( x n − 1 , x n − 1 ) , y 1 , y 2 , . . . , y n , x n ) A dag representation of the term bound to x n and y n : y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0 Exponential number of recursive calls.

  45. Correctness of RDA for Term Dags ◮ Proof is similar as for the RDA. These two algorithm differ only by the data structure they operate on.

  46. Complexity of RDA for Term Dags ◮ Linear space: terms are not duplicated anymore. ◮ Exponential time: Calls Unify1 recursively exponentially often.

  47. Complexity of RDA for Term Dags ◮ Linear space: terms are not duplicated anymore. ◮ Exponential time: Calls Unify1 recursively exponentially often. ◮ Fortunately, with an easy trick one can make the running time quadratic.

  48. Complexity of RDA for Term Dags ◮ Linear space: terms are not duplicated anymore. ◮ Exponential time: Calls Unify1 recursively exponentially often. ◮ Fortunately, with an easy trick one can make the running time quadratic. ◮ Idea: Keep from revisiting already-solved problems in the graph.

  49. Complexity of RDA for Term Dags ◮ Linear space: terms are not duplicated anymore. ◮ Exponential time: Calls Unify1 recursively exponentially often. ◮ Fortunately, with an easy trick one can make the running time quadratic. ◮ Idea: Keep from revisiting already-solved problems in the graph. ◮ The algorithm of Corbin and Bidoit: J. Corbin and M. Bidoit. A rehabilitation of Robinson’s unification algorithm. In R. Mason, editor, Information Processing 83 , pages 909–914. Elsevier Science, 1983.

  50. Quadratic Algorithm on Term Dags Input : A pair of nodes k 1 and k 2 in a dag Output : True if the terms corresponding to k 1 and k 2 are unifiable. False Otherwise. Side Effect : A pointer structure which allows to read off an mgu and the unified term. Unify2 ( k 1 , k 2 ) if k 1 = k 2 then return True ; /* Trivial */ else if function-node(k 2 ) then u := k 1 ; v := k 2 else u := k 2 ; v := k 1 ; /* Orient */ end Procedure Unify2 . Quadratic Algorithm. (No difference from Unify1 so far. Continues on the next slide)

  51. Quadratic Algorithm if variable-node(u) then if Occurs (u , v) ; /* Occur-check */ then return False else Union ( u , v ) ; /* Variable elimination */ return True end Procedure Unify2 . Quadratic Algorithm. Continued. (No difference from Unify1 so far. Continues on the next slide)

  52. Quadratic Algorithm else if function-symbol ( u ) � = function-symbol ( v ) then return False ; /* Symbol clash */ else n := arity ( function - symbol ( u )) ; ( u 1 , . . . , u n ) := succ - list ( u ) ; ( v 1 , . . . , v n ) := succ - list ( v ) ; i := 0 ; bool := True ; Union (u,v); while i ≤ n and bool do i := i + 1; bool := Unify2 ( Find ( u i ) , Find ( v i ) ); /* Decomposition */ end return bool Procedure Unify2 . Quadratic Algorithm. Finished. (The only difference from Unify1 is Union (u,v).)

  53. Quadratic Algorithm. Example The same example that revealed exponential behavior of RDA: y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0

  54. Quadratic Algorithm. Example The same example that revealed exponential behavior of RDA: y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0

  55. Quadratic Algorithm. Example The same example that revealed exponential behavior of RDA: y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0

  56. Quadratic Algorithm. Example The same example that revealed exponential behavior of RDA: y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0

  57. Quadratic Algorithm. Example The same example that revealed exponential behavior of RDA: y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0

  58. Quadratic Algorithm. Example The same example that revealed exponential behavior of RDA: y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0

  59. Quadratic Algorithm. Example The same example that revealed exponential behavior of RDA: y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0

  60. Quadratic Algorithm. Example The same example that revealed exponential behavior of RDA: y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0

  61. Quadratic Algorithm. Example The same example that revealed exponential behavior of RDA: y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0

  62. Quadratic Algorithm. Example The same example that revealed exponential behavior of RDA: y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0

  63. Quadratic Algorithm. Example The same example that revealed exponential behavior of RDA: y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0

  64. Quadratic Algorithm. Example The same example that revealed exponential behavior of RDA: y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0

  65. Quadratic Algorithm. Example The same example that revealed exponential behavior of RDA: y n x n f f x n − 1 y n − 1 f f x 1 y 1 f f x 0 y 0

  66. Properties of the Quadratic Algorithm ◮ Correctness can be shown in the similar way as for the RDA. ◮ The algorithm is quadratic in the number of symbols in original terms: ◮ Each call of Unify2 either returns immediately, or makes one more node unreachable for the Find operation. ◮ Therefore, there can be only linearly many calls of Unify2 . ◮ Quadratic complexity comes from the fact that Occur and Find operations are linear.

  67. Almost Linear Algorithm How to eliminate two sources of nonlinearity of Unify2 ? ◮ Occur : Just omit the occur check during the execution of the algorithm. ◮ Consequence: The data structure may contain cycles. ◮ Since the occur-check failures are not detected immediately, at the end an extra check has to be performed to find out whether the generated structure is cyclic or not. ◮ Detecting cycles in a directed graph can be done by linear search. ◮ Find : Use more efficient union-find algorithm from R. Tarjan. Efficiency of a good but not linear set union algorithm. J. ACM , 22(2):215–225, 1975.

  68. Auxiliary Procedures for the Almost Linear Algorithm ◮ Collapsing-find : ◮ Like Find it takes a node k of a dag as input, and follows the additional pointers until the node Find ( k ) is reached. ◮ In addition, Collapsing-find relocates the pointer of all the nodes reached during this process to Find ( k ) . Example f ( 1 ) f ( 4 ) x ( 2 ) a ( 3 ) y ( 5 )

  69. Auxiliary Procedures for the Almost Linear Algorithm ◮ Collapsing-find : ◮ Like Find it takes a node k of a dag as input, and follows the additional pointers until the node Find ( k ) is reached. ◮ In addition, Collapsing-find relocates the pointer of all the nodes reached during this process to Find ( k ) . Example f ( 1 ) f ( 4 ) ◮ CF (3)=(3) x ( 2 ) a ( 3 ) y ( 5 )

  70. Auxiliary Procedures for the Almost Linear Algorithm ◮ Collapsing-find : ◮ Like Find it takes a node k of a dag as input, and follows the additional pointers until the node Find ( k ) is reached. ◮ In addition, Collapsing-find relocates the pointer of all the nodes reached during this process to Find ( k ) . Example f ( 1 ) f ( 4 ) ◮ CF (3)=(3) x ( 2 ) a ( 3 ) y ( 5 ) ◮ CF (2)=

  71. Auxiliary Procedures for the Almost Linear Algorithm ◮ Collapsing-find : ◮ Like Find it takes a node k of a dag as input, and follows the additional pointers until the node Find ( k ) is reached. ◮ In addition, Collapsing-find relocates the pointer of all the nodes reached during this process to Find ( k ) . Example f ( 1 ) f ( 4 ) ◮ CF (3)=(3) x ( 2 ) a ( 3 ) y ( 5 ) ◮ CF (2)=

Recommend

Unification in the Description Logic EL EL - unification Minimal unifiers Franz Baader and

Unification in the Description Logic EL EL - unification Minimal unifiers Franz Baader and

Unification in EL Baader & Morawska Introduction Unification in the Description Logic EL EL - unification Minimal unifiers Franz Baader and Barbara Morawska Decision Procedure Conclusion TU Dresden, Germany UNIF 2009 Unification in

359 views • 25 slides
unification 2016 unification strategic roadmap succession unification strategic roadmap

unification 2016 unification strategic roadmap succession unification strategic roadmap

unification 2016 unification strategic roadmap succession unification strategic roadmap succession Board rd CE CEO Committe ttees unification strategic roadmap succession Global Member Value Centre Advocacy & Education

347 views • 30 slides
The unification type of Workshop on Admissible Rules and Unification

The unification type of Workshop on Admissible Rules and Unification

The unication type The unification type of Workshop on Admissible Rules and Unification http://logica.dmi.unisa.it/lucaspada University of Salerno Department of Mathematics Luca Spada Based on a joint work with V. Marra ukasiewicz logic

1.83k views • 145 slides
Unification on Subvarieties of Introduction Algebraic Unification Pseudocomplemented lattices

Unification on Subvarieties of Introduction Algebraic Unification Pseudocomplemented lattices

Unification on Subvarieties of Pseudocomple- mented lattices L.M. Cabrer Unification on Subvarieties of Introduction Algebraic Unification Pseudocomplemented lattices Fragments of Heyting algebras P-Lattices Definition Duality

570 views • 33 slides
Outline Motivation 1 Unification problems 2 Formalisation of a nominal C-unification algorithm

Outline Motivation 1 Unification problems 2 Formalisation of a nominal C-unification algorithm

Outline N OMINAL C- UNIFICATION on , Washington L. R. de Carvalho Segundo , Mauricio Ayala-Rinc andez and Daniele Nantes Sobrinho Maribel Fern K ING S C OLLEGE L ONDON U NIVERSIDADE DE B RAS ILIA 27 th Int.

679 views • 39 slides
Introduction to Unification Theory Syntactic Unification Temur Kutsia RISC, Johannes Kepler

Introduction to Unification Theory Syntactic Unification Temur Kutsia RISC, Johannes Kepler

Introduction to Unification Theory Syntactic Unification Temur Kutsia RISC, Johannes Kepler University Linz kutsia@risc.jku.at What is Unification Goal: Identify two symbolic expressions. Method: Replace certain subexpressions

1.86k views • 142 slides
Grammar: Features and Unification Plan for the Talk Problems with CFG (PCFG) Features

Grammar: Features and Unification Plan for the Talk Problems with CFG (PCFG) Features

Grammar: Features and Unification Plan for the Talk Problems with CFG (PCFG) Features Structure Attribute-value Matrix (AVM) Unification Grammar formalisms based on unification Agreement Constraints that hold among various

504 views • 48 slides
Depending on equations A proof-relevant framework for unification in dependent type theory

Depending on equations A proof-relevant framework for unification in dependent type theory

Depending on equations A proof-relevant framework for unification in dependent type theory Jesper Cockx DistriNet KU Leuven 3 September 2017 Unification for dependent types Unification is used for many purposes: logic programming, type

1.97k views • 151 slides
F-Theory GUTs Benjamin Jurke Contents Grand Unification F-Theory basics GUTs in F-Theory

F-Theory GUTs Benjamin Jurke Contents Grand Unification F-Theory basics GUTs in F-Theory

F-Theory GUTs Benjamin Jurke Contents Grand Unification F-Theory basics GUTs in F-Theory IMPRS Young Scientists Workshop (Ringberg) July 29th, 2009 Field-theoretic Grand Unification 1970s issue: Running gauge couplings suggest unification

416 views • 16 slides
Introduction to Unification Theory Higher-Order Unification Temur Kutsia RISC, Johannes Kepler

Introduction to Unification Theory Higher-Order Unification Temur Kutsia RISC, Johannes Kepler

Introduction to Unification Theory Higher-Order Unification Temur Kutsia RISC, Johannes Kepler University of Linz, Austria kutsia@risc.jku.at Overview Introduction Preliminaries Higher-Order Unification Procedure Outline Introduction

1.53k views • 130 slides
Introduction to Unification Theory Solving Systems of Linear Diophantine Equations Temur Kutsia

Introduction to Unification Theory Solving Systems of Linear Diophantine Equations Temur Kutsia

Introduction to Unification Theory Solving Systems of Linear Diophantine Equations Temur Kutsia RISC, Johannes Kepler University Linz kutsia@risc.jku.at ACU-Unification We saw an example how to solve ACU-unification problem. Reduction

906 views • 53 slides
Unification by Narrowing Mircea Marin West University of Timisoara mmarin@info.uvt.ro May 20,

Unification by Narrowing Mircea Marin West University of Timisoara mmarin@info.uvt.ro May 20,

Unification by Narrowing Mircea Marin West University of Timisoara mmarin@info.uvt.ro May 20, 2014 Marin Unification by Narrowing What is narrowing? Narrowing sound and complete method for solving E -unification problems in theories

1.06k views • 69 slides
Theories and Models of the Evolution of Altruism Unification vs. Unique Explanations Jeffrey A.

Theories and Models of the Evolution of Altruism Unification vs. Unique Explanations Jeffrey A.

Theories and Models of the Evolution of Altruism Unification vs. Unique Explanations Jeffrey A. Fletcher Systems Science Graduate Program Portland State University 1 Outline Intro Example of unification effort o Hamiltons rule

627 views • 33 slides
Using first order logic (Ch. 9) Unification First sentence is the only one with variables, there

Using first order logic (Ch. 9) Unification First sentence is the only one with variables, there

Using first order logic (Ch. 9) Unification First sentence is the only one with variables, there are 9 options (only 6 if x y) One unification is {x/Sue, y/Devin} We cannot say {x/Devin, y/Alex}, as this is creates a contradiction General

1.49k views • 44 slides
8. Politics and Diplomacy in the Age of Nationalism, 1850-1914 8.1 The Unification of Italy and

8. Politics and Diplomacy in the Age of Nationalism, 1850-1914 8.1 The Unification of Italy and

8. Politics and Diplomacy in the Age of Nationalism, 1850-1914 8.1 The Unification of Italy and Germany 8.2 Austria-Hungary 8.3 Russia 8.4 France 8.5 Socialism and Labor Unions 8.6 European Diplomacy, 1871-1900 8.1 The Unification of Italy and

673 views • 46 slides
ECE 4524 Artificial Intelligence and Engineering Applications Lecture 12: Unification in FOL

ECE 4524 Artificial Intelligence and Engineering Applications Lecture 12: Unification in FOL

ECE 4524 Artificial Intelligence and Engineering Applications Lecture 12: Unification in FOL Reading: AIAMA 9.1-9.2 Todays Schedule: Inference by reducing FOL to PL FOL Inference Part I: Unification and Lifting Motivation Given an

276 views • 15 slides
ASPECTS OF GAUGE-HIGGS UNIFICATION Luca Silvestrini INFN, Rome & TU-Mnchen Sendai,

ASPECTS OF GAUGE-HIGGS UNIFICATION Luca Silvestrini INFN, Rome & TU-Mnchen Sendai,

ASPECTS OF GAUGE-HIGGS UNIFICATION Luca Silvestrini INFN, Rome & TU-Mnchen Sendai, 14/2/2005 Introduction Gauge-Higgs unification in 5D Gauge-Higgs unification in 6D A 5D model of flavour Conclusions & Outlook

492 views • 32 slides
A sound unification algorithm based on telescope equivalences Jesper Cockx DistriNet KU

A sound unification algorithm based on telescope equivalences Jesper Cockx DistriNet KU

A sound unification algorithm based on telescope equivalences Jesper Cockx DistriNet KU Leuven 20 April 2016 Pattern matching is awesome Agda uses unification to: check which constructors are possible specialize the result type data Vec

701 views • 67 slides
UNIFICATION IN EL WITHOUT TOP CONSTRUCTOR Franz Baader, Nguyen T. Binh, Stefan Borgwardt, Barbara

UNIFICATION IN EL WITHOUT TOP CONSTRUCTOR Franz Baader, Nguyen T. Binh, Stefan Borgwardt, Barbara

Institute for Theoretical Computer Science Chair for Automata Theory UNIFICATION IN EL WITHOUT TOP CONSTRUCTOR Franz Baader, Nguyen T. Binh, Stefan Borgwardt, Barbara Morawska WARU Utrecht, 26.05.2011 Outline Why unification in EL is

526 views • 26 slides
Parsing with unification Frederik Fouvry Department of Computational Linguistics and Phonetics

Parsing with unification Frederik Fouvry Department of Computational Linguistics and Phonetics

Parsing with unification Frederik Fouvry Department of Computational Linguistics and Phonetics Saarland University Introduction to Computational Linguistics Frederik Fouvry Parsing with unification Outline Motivation 1 Unification 2

757 views • 43 slides
E -Unification of Higher-order Patterns Alexandre Boudet Evelyne Contejean LRI Orsay France

E -Unification of Higher-order Patterns Alexandre Boudet Evelyne Contejean LRI Orsay France

E -Unification of Higher-order Patterns Alexandre Boudet Evelyne Contejean LRI Orsay France Motivations Higher-order unification is undecidable (Huet) Unification of higher-order patterns is decidable (Miller) Combination of

496 views • 23 slides
My topics World unification (World Federation) principles My regular activities for world

My topics World unification (World Federation) principles My regular activities for world

My topics World unification (World Federation) principles My regular activities for world unification My political background Requirements for a Thai political party World Party Thailand at present World unification principles

338 views • 12 slides
Projective unification in modal logic II Projective unification in modal logic II Piotr Wojtylak

Projective unification in modal logic II Projective unification in modal logic II Piotr Wojtylak

Projective unification in modal logic II Projective unification in modal logic II Piotr Wojtylak Institute of Mathematics, Silesian University, Katowice, Poland Projective unification in modal logic II Piotr Wojtylak Institute of Mathematics,

827 views • 82 slides
Unification Algorithms Maribel Fern andez Kings College London December 2007 Maribel

Unification Algorithms Maribel Fern andez Kings College London December 2007 Maribel

Unification Algorithms Maribel Fern andez Kings College London December 2007 Maribel Fern andez Unification Algorithms Motivations Unification algorithms have become popular in recent years, due to their key role in the fields of

1.22k views • 100 slides

More recommend