CPSC 433 Artificial Intelligence And-Tree Search Modeling Example – Model Elimination CPSC 433 T01 & T02 Andrew Kuipers.

Slides:



Advertisements
Similar presentations
CPSC 433 Artificial Intelligence Or-Tree Modeling Example CPSC 433 T01 & T02 Andrew Kuipers.
Advertisements

Set Based Search Modeling Examples II
Resolution in Propositional and First-Order Logic.
CSC 685 Logic Review. Logic: Modeling Human Reasoning syllogistic logic Syllogistic Logic (Aristotle). all/some X are/not Y Propositional Logic (Boole).
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
Programming Language Semantics Inductive Definitions Mooly SagivEran Yahav Schrirber 317Open space
Determine the truth value of each of the following, respectively: -1  [-2, 2], -1  {-2, 2}, -1  (-2, 2) (1) T T T (2) T F T (3) T T F (4) T F F (5)
Computer Science 6/13/2015CPSC 433: Other Search Models and Processes 1 CPSC Artificial Intelligence Winter 2006 Search Paradigms: Search Summary.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 9 Jim Martin.
Predicate Calculus Subject / Predicate John / went to the store. The sky / is blue. Propositional Logic - uses statements Predicate Calculus - uses predicates.
Fig. 3-1, p. 67. Fig. 3-2, p. 67 Fig. 3-3, p. 68.
 x (x 2  0) 1. True2. False.  x (3x + 2 = 12) 1. True2. False.
CPSC 433 Artificial Intelligence CPSC 433 : Artificial Intelligence Tutorials T01 & T02 Andrew “M” Kuipers note: please include.
Björn Pelzer (AGKI)E-KRHyper1/11 E-KRHyper A Hyper Tableau Theorem Prover with Equality Björn Pelzer
Elimination Using Multiplication.
Knowledge & Reasoning Logical Reasoning: to have a computer automatically perform deduction or prove theorems Knowledge Representations: modern ways of.
SOLVING SYSTEMS of EQUATIONS MATH REVIEW. Suppose… … you want to solve a set of two linear equations: y = 5z – 4 and y = -4z + 2. There are two methods.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
Substitution Effect, Income Effect & Price Effect
 Predicate: A sentence that contains a finite number of variables and becomes a statement when values are substituted for the variables. ◦ Domain: the.
1st-order Predicate Logic (FOL)
Conjunctive normal form: any formula of the predicate calculus can be transformed into a conjunctive normal form. Def. A formula is said to be in conjunctive.
Formal Semantics of Programming Languages 虞慧群 Topic 3: Principles of Induction.
1 Section 7.2 Equivalent Formulas Two wffs A and B are equivalent, written A  B, if they have the same truth value for every interpretation. Property:
Random Experiment Random Variable: Continuous, Discrete Sample Space: S Event: A, B, E Null Event Complement of an Event A’ Union of Events (either, or)
3.2a Multiply a monomial and a polynomial. A-APR.6 Rewrite simple rational expressions in different forms; write a(x) ⁄ b(x) in the form q(x) + r(x) ⁄
SOLVING SYSTEMS ALGEBRAICALLY SECTION 3-2. SOLVING BY SUBSTITUTION 1) 3x + 4y = 12 STEP 1 : SOLVE ONE EQUATION FOR ONE OF THE VARIABLES 2) 2x + y = 10.
CPSC 433 Artificial Intelligence Search Modeling Practice Problems M. Reza Zakerinasab Please include [CPSC433] in the subject line.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 17 Wednesday, 01 October.
Predicates and Quantified Statements
CPSC 386 Artificial Intelligence Ellen Walker Hiram College
7.3 Products and Factors of Polynomials Objectives: Multiply polynomials, and divide one polynomial by another by using long division and synthetic division.
Natural Deduction for Predicate Logic Bound Variable: A variable within the scope of a quantifier. – (x) Px – (  y) (Zy · Uy) – (z) (Mz  ~Nz) Free Variable:
1 Section 9.1 Automatic Reasoning Recall that a wff W is valid iff ¬ W is unsatisfiable. Resolution is an inference rule used to prove unsatisfiability.
Elimination Method: Solve the linear system. -8x + 3y=12 8x - 9y=12.
General resolution Method1 General Resolution method in FOL Lesson 8.
Cs774 (Prasad)L6Backtracking1 Controlling Backtracking : Cuts
The Rectangular Coordinate System Quadrant I Quadrant II Quadrant III Quadrant IV 0 x-axis y-axis a b P(a, b)
1 CMSC 250 Chapter 2, Predicate Logic. 2 CMSC 250 Definitions l Subject / predicate John / went to the store. The sky / is blue. l Propositional logic-
CPSC 433 Artificial Intelligence Set Based Search Modeling Examples Andrew Kuipers Please include [CPSC433] in the subject line.
Lecture 9a: Resolution Strategies Heshaam Faili University of Tehran Restriction strategies for resolution Horn clauses.
Instructor: Eyal Amir Grad TAs: Wen Pu, Yonatan Bisk Undergrad TAs: Sam Johnson, Nikhil Johri CS 440 / ECE 448 Introduction to Artificial Intelligence.
Solving Systems of Equations by Elimination Name: Pd Algebra 3/03/09.
Examples of SSA based optimizers: Global Value Numbering.
1 Section 9.2 Logic Programming A logic program is a set of clauses with the restriction that there is exactly one positive literal in each clause. Such.
An Example of {AND, OR, Given that} Using a Normal Distribution By Henry Mesa.
CPSC 433 Artificial Intelligence Unification & Resolution Examples Andrew Kuipers Please include [CPSC433] in the subject line.
1 Hojjat Ghaderi, University of Toronto, Fall 2006 CSC384: Intro to Artificial Intelligence Knowledge Representation III ● Required Readings: 9.1, 9.2,
1 Introduction to Artificial Intelligence LECTURE 9: Resolution in FOL Theorem Proving in First Order Logic Unification Resolution.
ПЕЧЕНЬ 9. Закладка печени в период эмбрионального развития.
1 Press Ctrl-A ©G Dear 2010 – Not to be sold/Free to use IntersectingLines Stage 6 - Year 11 Applied Mathematic (Preliminary Extension 1)
Elimination Method - Systems. Elimination Method  With the elimination method, you create like terms that add to zero.
3. The Logic of Quantified Statements Summary
Solving Systems of Equations by Elimination2
Objective I CAN solve systems of equations using elimination with multiplication.
CS 1502 Formal Methods in Computer Science
Search Exercise Search Tree? Solution (Breadth First Search)?
Or-Tree Modeling Example
CPSC 433 : Artificial Intelligence Tutorials T01 & T02
Reasoning in Artificial Intelligence
Systems of Equations Solve by Graphing.
Difference between Compound Interest & Simple Interest.
CPSC 121: Models of Computation
Solve the linear system.
Example 2B: Solving Linear Systems by Elimination
Proofs (2.7) (How to compute logical consequences of a KB rather that
Logical Inference 4 wrap up
Indicator 16 System of Equations.
Presentation transcript:

CPSC 433 Artificial Intelligence And-Tree Search Modeling Example – Model Elimination CPSC 433 T01 & T02 Andrew Kuipers

CPSC 433 Artificial Intelligence The Formal Model C – the set of all clauses (our formal language) Prob ,me  2 C Solution Definition Erw ,me ((pr, ?), (pr, yes)) if P,  P’  pr, where  = mgu(P,P’) Branching Definition Erw ,me ((pr 0,?),(pr 0,?,pr 1,…,pr n )) where pr 0 = Q  {L 1  …  L n } and pr i = Q  {L 1  …  L n, L i }, 1  i  n and for some j s.t 1  j  n : Erw ,me ((pr j, ?), (pr j, yes))

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },?

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },?

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },?

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? 3

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? 3

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? 3

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? 3 {  p,p},?{  p,  r},? 6

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? 3 {  p,p},?{  p,  r},? 6

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? 3 {  p,p},y{  p,  r},? 6

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? 3 {  p,p},y{  p,  r},? 6

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? 3 {  p,p},y{  p,  r},? 6 {s,  s},? 4

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? 3 {  p,p},y{  p,  r},? 6 {s,  s},y 4

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? 3 {  p,p},y{  p,  r},? 6 {s,  s},y 4

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? 3 {  p,p},y{  p,  r},? 6 {s,  s},y 4 {  p,  r,r},? {  p,  r,p},? {  p,  r,s},? 1

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? 3 {  p,p},y{  p,  r},? 6 {s,  s},y 4 {  p,  r,r},y {  p,  r,p},? {  p,  r,s},? 1

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? 3 {  p,p},y{  p,  r},? 6 {s,  s},y 4 {  p,  r,r},y {  p,  r,p},y {  p,  r,s},? 1

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? {  p,p},y{  p,  r},?{s,  s},y {  p,  r,r},y {  p,  r,p},y {  p,  r,s},?

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? {  p,p},y{  p,  r},?{s,  s},y {  p,  r,r},y {  p,  r,p},y {  p,  r,s},? {  p,  r,s,  s},?

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? {  p,p},y{  p,  r},?{s,  s},y {  p,  r,r},y {  p,  r,p},y {  p,  r,s},? {  p,  r,s,  s},y

CPSC 433 Artificial Intelligence A Propositional Example 1) r  p  s 2) s  q 3)  p  s 4)  s 5)  s  p 6) p   r { },? {  p},? {s},? {  p,p},y{  p,  r},?{s,  s},y {  p,  r,r},y {  p,  r,p},y {  p,  r,s},? {  p,  r,s,  s},y search complete!

CPSC 433 Artificial Intelligence A First-Order Example 1)  P(x)   Q(y)   R(x) 2) P(a) 3) P(z)   Q(z) 4) Q(a) 5) Q(b) 6) R(b) { }, ?  = { }

CPSC 433 Artificial Intelligence A First-Order Example 1)  P(x)   Q(y)   R(x) 2) P(a) 3) P(z)   Q(z) 4) Q(a) 5) Q(b) 6) R(b)  = { } {P(z)},? {  Q(z)},? 3 { }, ?

CPSC 433 Artificial Intelligence A First-Order Example 1)  P(x)   Q(y)   R(x) 2) P(a) 3) P(z)   Q(z) 4) Q(a) 5) Q(b) 6) R(b)  = { } {P(z)},? {  Q(z)},? 3 {P(z),  P(x)},? {P(z),  Q(y)},? {P(z),  R(x)},? 1 { }, ?

CPSC 433 Artificial Intelligence A First-Order Example 1)  P(x)   Q(y)   R(x) 2) P(a) 3) P(z)   Q(z) 4) Q(a) 5) Q(b) 6) R(b)  = { z  x } {P(z)},? {  Q(z)},? 3 {P(z),  P(x)},y {P(z),  Q(y)},? {P(z),  R(x)},? 1 { }, ?

CPSC 433 Artificial Intelligence A First-Order Example 1)  P(x)   Q(y)   R(x) 2) P(a) 3) P(z)   Q(z) 4) Q(a) 5) Q(b) 6) R(b)  = { z  x } {P(z)},? {  Q(z)},? 3 {P(z),  P(x)},y {P(z),  Q(y)},? {P(z),  R(x)},? 1 {P(z),  Q(y),Q(b)},? 5 { }, ?

CPSC 433 Artificial Intelligence A First-Order Example 1)  P(x)   Q(y)   R(x) 2) P(a) 3) P(z)   Q(z) 4) Q(a) 5) Q(b) 6) R(b)  = { z  x, y  b } {P(z)},? {  Q(z)},? 3 {P(z),  P(x)},y {P(z),  Q(y)},? {P(z),  R(x)},? 1 {P(z),  Q(y),Q(b)},y 5 { }, ?

CPSC 433 Artificial Intelligence A First-Order Example 1)  P(x)   Q(y)   R(x) 2) P(a) 3) P(z)   Q(z) 4) Q(a) 5) Q(b) 6) R(b)  = { z  x, y  b } {P(z)},? {  Q(z)},? 3 {P(z),  P(x)},y {P(z),  Q(y)},? {P(z),  R(x)},? 1 {P(z),  Q(y),Q(b)},y 5 {P(z),  R(x),R(b)},? 6 { }, ?

CPSC 433 Artificial Intelligence A First-Order Example 1)  P(x)   Q(y)   R(x) 2) P(a) 3) P(z)   Q(z) 4) Q(a) 5) Q(b) 6) R(b)  = { z  x, y  b, x  b } {P(z)},? {  Q(z)},? 3 {P(z),  P(x)},y {P(z),  Q(y)},? {P(z),  R(x)},? 1 {P(z),  Q(y),Q(b)},y 5 {P(z),  R(x),R(b)},y 6 { }, ?

CPSC 433 Artificial Intelligence A First-Order Example 1)  P(x)   Q(y)   R(x) 2) P(a) 3) P(z)   Q(z) 4) Q(a) 5) Q(b) 6) R(b)  = { z  b, y  b, x  b } {P(z)},? {  Q(z)},? 3 {P(z),  P(x)},y {P(z),  Q(y)},? {P(z),  R(x)},? 1 {P(z),  Q(y),Q(b)},y 5 {P(z),  R(x),R(b)},y 6 substitute! { }, ?

CPSC 433 Artificial Intelligence A First-Order Example 1)  P(x)   Q(y)   R(x) 2) P(a) 3) P(z)   Q(z) 4) Q(a) 5) Q(b) 6) R(b)  = { z  b, y  b, x  b } {P(z)},? {  Q(z)},? 3 {P(z),  P(x)},y {P(z),  Q(y)},? {P(z),  R(x)},? 1 {P(z),  Q(y),Q(b)},y 5 {P(z),  R(x),R(b)},y 6 {  Q(z),Q(a)},? 4 { }, ?

CPSC 433 Artificial Intelligence A First-Order Example 1)  P(x)   Q(y)   R(x) 2) P(a) 3) P(z)   Q(z) 4) Q(a) 5) Q(b) 6) R(b)  = { z  b, y  b, x  b } {P(z)},? {  Q(z)},? 3 {P(z),  P(x)},y {P(z),  Q(y)},? {P(z),  R(x)},? 1 {P(z),  Q(y),Q(b)},y 5 {P(z),  R(x),R(b)},y 6 {  Q(z),Q(a)},? 4 can’t add z  a! { }, ?

CPSC 433 Artificial Intelligence A First-Order Example 1)  P(x)   Q(y)   R(x) 2) P(a) 3) P(z)   Q(z) 4) Q(a) 5) Q(b) 6) R(b)  = { z  b, y  b, x  b } {P(z)},? {  Q(z)},? 3 {P(z),  P(x)},y {P(z),  Q(y)},? {P(z),  R(x)},? 1 {P(z),  Q(y),Q(b)},y 5 {P(z),  R(x),R(b)},y 6 backtrack! { }, ?

CPSC 433 Artificial Intelligence A First-Order Example 1)  P(x)   Q(y)   R(x) 2) P(a) 3) P(z)   Q(z) 4) Q(a) 5) Q(b) 6) R(b)  = { z  b, y  b, x  b } {P(z)},? {  Q(z)},? 3 {P(z),  P(x)},y {P(z),  Q(y)},? {P(z),  R(x)},? 1 {P(z),  Q(y),Q(b)},y 5 {P(z),  R(x),R(b)},y 6 {  Q(z),Q(b)},? 5 { }, ?

CPSC 433 Artificial Intelligence A First-Order Example 1)  P(x)   Q(y)   R(x) 2) P(a) 3) P(z)   Q(z) 4) Q(a) 5) Q(b) 6) R(b) {P(z)},? {  Q(z)},? {P(z),  P(x)},y {P(z),  Q(y)},? {P(z),  R(x)},? {P(z),  Q(y),Q(b)},y{P(z),  R(x),R(b)},y {  Q(z),Q(b)},y  = { z  b, y  b, x  b } { }, ?

CPSC 433 Artificial Intelligence A First-Order Example 1)  P(x)   Q(y)   R(x) 2) P(a) 3) P(z)   Q(z) 4) Q(a) 5) Q(b) 6) R(b) {P(z)},? {  Q(z)},? {P(z),  P(x)},y {P(z),  Q(y)},? {P(z),  R(x)},? {P(z),  Q(y),Q(b)},y{P(z),  R(x),R(b)},y {  Q(z),Q(b)},y  = { z  b, y  b, x  b } { }, ? search complete!