YouTube2Text

Lecture 18-1 Adapting resolution for first-order logic — Transcript

by Automated Reasoning · 1,152 words · 170 segments · language en · Watch on YouTube

Full transcript

  1. 0:00now let us study uh resolution proof
  2. 0:02system for first order logic we have
  3. 0:05seen reputation proof systems before
  4. 0:08let's remind ourselves what reputation
  5. 0:10proof systems are and how we can use
  6. 0:13resolution as a reputation proof system
  7. 0:15for our first order logic so we assume
  8. 0:17that we have a set of formulas in the
  9. 0:19left hand side in this uh statement
  10. 0:22which was treated as conjunction of
  11. 0:24formulas remember that right this is
  12. 0:26conjunction of these formulas should
  13. 0:28prove this Formula F
  14. 0:31so conjunction of CNF formula is also a
  15. 0:33CNF formula so if we have only CNF
  16. 0:36formula in the left hand side then we
  17. 0:39can treat as a one joint CNF formula
  18. 0:42implying other CNF formula that may
  19. 0:45simplify our view of the proving
  20. 0:49process let us suppose we ask to derive
  21. 0:52that Sigma proves F what do we do we
  22. 0:55assume Sigma is finite we can relax this
  23. 0:58condition due to compactness of first
  24. 1:00logic we will convert uh conjunction of
  25. 1:04Sigma and not of F and turn into a first
  26. 1:09order Clauses called Sigma
  27. 1:12Prime and we apply the reputation proof
  28. 1:15system on Sigma Prime if it gives us
  29. 1:18false then this original statement was
  30. 1:24derivable now now how we build a
  31. 1:27resolution proof system for our Sigma
  32. 1:29Prime so there are two steps we needed
  33. 1:32one resolution which very much like
  34. 1:33proposition logic and new thing has come
  35. 1:35up with unification which we have seen
  36. 1:37in the previous
  37. 1:38lecture okay so what was resolution
  38. 1:41resolution was like this okay so you
  39. 1:43have F or C and not F or D you can
  40. 1:46derive C or D this F and not F get
  41. 1:48cancelled and then Union is applied yeah
  42. 1:51so that is the sense of resolution
  43. 1:54however there is a complication first
  44. 1:56order logic you can have variables in
  45. 1:59your first order logic object and these
  46. 2:00variables may not be same across Clauses
  47. 2:03so
  48. 2:04therefore you may not be immediately
  49. 2:06able to apply
  50. 2:08the
  51. 2:11resolution for example you have these
  52. 2:13two Clauses in which you have not p z z
  53. 2:18and PX FY okay so you can see that these
  54. 2:22two Clauses are two different
  55. 2:25literals however they are unifiable
  56. 2:28literals yes so X can be mapped to zed
  57. 2:31and the FX can be mapped to zed and then
  58. 2:34this whole unification can result you as
  59. 2:36some some mapping between variable XY Z
  60. 2:39and then you can make the mean
  61. 2:41call so uh if you can unify using
  62. 2:46unification then we can apply the
  63. 2:47resolution the now the question comes
  64. 2:51how do we
  65. 2:52apply uh unification in our Clauses okay
  66. 2:56so we were unifying terms earlier now
  67. 2:59I'm unifying atoms that looks weird so
  68. 3:02let's we will think about
  69. 3:04it uh is substitution a valid operation
  70. 3:08for derivations I mean like you know if
  71. 3:11we have some clause which is for all VAR
  72. 3:14you know all the variables are
  73. 3:15universally Quantified suddenly you take
  74. 3:17a variable replaced by another term is
  75. 3:19it allowed yeah and not only one
  76. 3:21variable you're doing from multiple
  77. 3:23variables in the same time is it an okay
  78. 3:26derivation so that we need to think
  79. 3:28about
  80. 3:30the third point is that uh what is the
  81. 3:33meaning of the variables across Clauses
  82. 3:36if same variable appears in two
  83. 3:37different Clauses what does it mean are
  84. 3:39the same variable or the different
  85. 3:40variables uh how their unification works
  86. 3:43so we need to think about this third
  87. 3:44matter
  88. 3:46also okay so first let's take the issue
  89. 3:49one by one unification of atoms we can
  90. 3:52lift the idea of unifying terms to
  91. 3:55unifying atoms simply treat a predicate
  92. 3:58as a function and then you are set you
  93. 4:00can just apply any unification algorithm
  94. 4:03for example if you want to unify this
  95. 4:05guy to this guy you simply uh what do
  96. 4:08you do you say okay if x should be equal
  97. 4:10to this guy this guy should be equal to
  98. 4:12this guy can be unify okay and if you do
  99. 4:15that then you'll get this map X should
  100. 4:17be M to FY Z should be ma to FY and then
  101. 4:20you are
  102. 4:22done after applying this unification we
  103. 4:25obtain this uh this terms
  104. 4:30now now let's look at the second issue
  105. 4:32so so we will go by an example okay so
  106. 4:35we know that the following derivation is
  107. 4:37valid okay what is this following
  108. 4:38deration let's suppose I give you for
  109. 4:40all XY FX y we can replace each letter
  110. 4:45by a term let say T1 XY T2 XY okay and
  111. 4:50then we can apply un Universal
  112. 4:52quantification again this was given to
  113. 4:54you as an exercise in previous lectures
  114. 4:57you can check that these two proofs
  115. 4:59steps are satisfying the conditions side
  116. 5:05conditions given to you in the earlier
  117. 5:07lectures therefore the following
  118. 5:10derivation in our Clauses are some I
  119. 5:13give you a clause it has implicit
  120. 5:15Universal quantifiers remember that we
  121. 5:16don't write Universal quantifiers and
  122. 5:18you simply apply a substitution the
  123. 5:20resulting thing is also okay so
  124. 5:23therefore uh you don't need to worry
  125. 5:25about what substitution is allowed what
  126. 5:26naming is allowed doesn't matter you
  127. 5:28just apply any substitution it is going
  128. 5:30to go work it is going to
  129. 5:32work the following deration is a valid
  130. 5:36derivation let's suppose I give you for
  131. 5:38all PX or qy and then the sigma is y
  132. 5:43maps to X so I can simply say PX or QX
  133. 5:46this isct so implicitly there was a
  134. 5:49universal quantifier XY now this is for
  135. 5:52all X okay so just keep that remember
  136. 5:55remember that there's a universal
  137. 5:56Quantified setting in front of all the
  138. 5:58clauses
  139. 6:00the third issue the variables across the
  140. 6:02Clauses how do we make sense out of them
  141. 6:04okay the universal quantifi distribute
  142. 6:06over conjunction that was the fact so if
  143. 6:08so we can easily distribute the
  144. 6:10quantifiers and scope only each Clauses
  145. 6:13so no quantifi scopes across Clauses so
  146. 6:16the variables appearing across Clauses
  147. 6:18are not the same variables even if we
  148. 6:20write the same name for example if I
  149. 6:22give you this uh formula uh it's wrong
  150. 6:25way to write it you should just simply
  151. 6:27distribute it okay so you get this
  152. 6:30distributed form in which you have a w
  153. 6:32appearing twice okay and you can say
  154. 6:36that you know they are different
  155. 6:38variables right so therefore we may view
  156. 6:41the variables occurring in different
  157. 6:42Clauses as different variables even if
  158. 6:44we use the same name because if you each
  159. 6:46time you start writing different name
  160. 6:48you run out of the name whole notation
  161. 6:49becomes very cumbersome uh human
  162. 6:52reability goes down okay so therefore
  163. 6:55for humanability we reuse the same name
  164. 6:58but uh mically or when computers analyze
  165. 7:01these these Clauses they treat them
  166. 7:06disparately so please pay attention it's
  167. 7:08a big source of confusion okay so when
  168. 7:10you're doing unification and trying to
  169. 7:12do reputation WR reputation proofs this
  170. 7:14can confuse you

About this transcript

This page contains the full transcript of Lecture 18-1 Adapting resolution for first-order logic by Automated Reasoning, generated from the public captions YouTube serves with the video. The transcript has 1,152 words across 170 segments, with the original timestamps preserved so you can click any line to jump to that moment in the embedded player.

What you can do with it

Use the transcript to take notes, quote the speaker, build a study guide, generate a summary with ChatGPT or Claude via the YouTube Summary tool, or export it as a timed subtitle file with YouTube to SRT. You can also re-open it in the transcriber to choose a caption track available on the video.

Free YouTube transcript tool

YouTube2Text is a free YouTube transcript generator — no signup, no daily limit. Paste any YouTube link and get the full transcript instantly, with timestamps, click-to-jump, caption language selection, AI prompts for ChatGPT, Claude, and Gemini, and exports to TXT, SRT, VTT, or Markdown.