Lecture-14-15-Inference_in_FOL

Lecture-14-15-Inference_in_FOL - CS 561: Artificial...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 561: Artificial Intelligence Instructor: Sofus A. Macskassy, macskass@usc.edu TA: Harris Chiu ( chichiu@usc.edu ), Wed 2:45-4:45pm, PHE 328 Penny Pan ( beipan@usc.edu ), Fri 10am-noon, PHE 328 Lectures: MW 5:00-6:20pm, ZHS 159 Office hours: By appointment Class page: http://www-bcf.usc.edu/~macskass/CS561/Fall2010/ This class will use https://blackboard.usc.edu/webapps/login/ and class webpage - Up to date information - Lecture notes - Relevant dates, links, etc. Course material: [AIMA] Artificial Intelligence: A Modern Approach, by Stuart Russell and Peter Norvig. (3rd ed)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS561 - Lecture 13-14 - Macskassy - Fall 2010 2 Logistics - MIDTERM Midterm 1 is next week Date: October 18 Location: Normal class room Time: Normal class time Covers: All lectures through this week (Ch. 1-9) It is open book and open notes You can use the book, lecture slides and your notes Example midterms available from AIMA site http://aima.cs.berkeley.edu/instructors.html
Background image of page 2
Inference in FOL [AIMA Ch. 9] Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward and backward chaining Logic programming Resolution 3 CS561 - Lecture 13-14 - Macskassy - Fall 2010
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
A brief history of reasoning 450b.c. Stoics propositional logic, inference (maybe) 322b.c. Aristotle “syllogisms” (inference rules), quantifiers 1565 Cardano probability theory (propositional logic+ uncertainty) 1847 Boole propositional logic (again) 1879 Frege first-order logic 1922 Wittgenstein proof by truth tables 1930 Gödel 9 complete algorithm for FOL 1930 Herbrand complete algorithm for FOL (reduce to propositional) 1931 Gödel :9 complete algorithm for arithmetic 1960 Davis/Putnam “practical” algorithm for propositional logic 1965 Robinson “practical” algorithm for FOL— resolution 4 CS561 - Lecture 13-14 - Macskassy - Fall 2010
Background image of page 4
Universal instantiation (UI) Every instantiation of a universally quantified sentence is entailed by it: 8 v ® S UBST ({ v / g } ; ® ) for any variable v and ground term g E.g., 8 x King ( x ) ^ Greedy ( x ) ) Evil ( x ) yields King ( John ) ^ Greedy ( John ) ) Evil ( John ) King ( Richard ) ^ Greedy ( Richard ) ) Evil ( Richard ) King ( Father ( John )) ^ Greedy ( Father ( John )) ) Evil ( Father ( John )) 5 CS561 - Lecture 13-14 - Macskassy - Fall 2010
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Existential instantiation (EI) For any sentence ® , variable v , and constant symbol k that does not appear elsewhere in the knowledge base : 9 v ® S UBST ({ v / k } ; ® ) E.g., 9 x Crown ( x ) ^ OnHead ( x; John ) yields Crown ( C1 ) ^ OnHead ( C1; John ) provided C1 is a new constant symbol, called a Skolem constant Another example: from 9 x d ( x y ) =dy = x y we obtain d ( e y ) =dy = e y provided e is a new constant symbol 6 CS561 - Lecture 13-14 - Macskassy - Fall 2010
Background image of page 6
Existential instantition contd. UI can be applied several times to
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 41

Lecture-14-15-Inference_in_FOL - CS 561: Artificial...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online