CPSC 322, Lecture 21Slide 1 Bottom Up: Soundness and Completeness Computer Science cpsc322, Lecture 21 (Textbook Chpt 5.2) February, 27, 2009.

Slides:



Advertisements
Similar presentations
Completeness and Expressiveness
Advertisements

Department of Computer Science Undergraduate Events More
Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
PROOF BY CONTRADICTION
CPSC 422, Lecture 21Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 21 Mar, 4, 2015 Slide credit: some slides adapted from Stuart.
Reasoning under Uncertainty: Marginalization, Conditional Prob., and Bayes Computer Science cpsc322, Lecture 25 (Textbook Chpt ) Nov, 6, 2013.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
CPSC 322, Lecture 37Slide 1 Finish Markov Decision Processes Last Class Computer Science cpsc322, Lecture 37 (Textbook Chpt 9.5) April, 8, 2009.
Reasoning under Uncertainty: Conditional Prob., Bayes and Independence Computer Science cpsc322, Lecture 25 (Textbook Chpt ) March, 17, 2010.
CPSC 322, Lecture 18Slide 1 Planning: Heuristics and CSP Planning Computer Science cpsc322, Lecture 18 (Textbook Chpt 8) February, 12, 2010.
CPSC 322, Lecture 20Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Computer Science cpsc322, Lecture 20 (Textbook.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
CPSC 322, Lecture 13Slide 1 CSPs: Arc Consistency & Domain Splitting Computer Science cpsc322, Lecture 13 (Textbook Chpt 4.5,4.8) February, 02, 2009.
Logic: Connectives AND OR NOT P Q (P ^ Q) T F P Q (P v Q) T F P ~P T F
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
1 Intro to Probability Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
1 Inference Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
CPSC 322, Lecture 28Slide 1 Reasoning Under Uncertainty: More on BNets structure and construction Computer Science cpsc322, Lecture 28 (Textbook Chpt 6.3)
CPSC 322, Lecture 21Slide 1 Bottom Up: Soundness and Completeness Computer Science cpsc322, Lecture 21 (Textbook Chpt 5.2) March, 5, 2010.
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) March, 8, 2010.
CPSC 322, Lecture 29Slide 1 Reasoning Under Uncertainty: Bnet Inference (Variable elimination) Computer Science cpsc322, Lecture 29 (Textbook Chpt 6.4)
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
Discussion #10 1/16 Discussion #10 Logical Equivalences.
Propositional Logic Lecture 2: Sep 9. Conditional Statement If p then q p is called the hypothesis; q is called the conclusion “If your GPA is 4.0, then.
CSE 311 Foundations of Computing I Autumn 2011 Lecture 2 More Propositional Logic Application: Circuits Propositional Equivalence.
CPSC 322, Lecture 24Slide 1 Reasoning under Uncertainty: Intro to Probability Computer Science cpsc322, Lecture 24 (Textbook Chpt 6.1, 6.1.1) March, 15,
Propositional Logic 7/16/ Propositional Logic A proposition is a statement that is either true or false. We give propositions names such as p, q,
Lecture 8 Introduction to Logic CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
CPSC 322, Lecture 24Slide 1 Finish Logics… Reasoning under Uncertainty: Intro to Probability Computer Science cpsc322, Lecture 24 (Textbook Chpt 6.1, 6.1.1)
Propositional Logic.
Intro to Discrete Structures
CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.
Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Jim Little UBC CS 322 – CSP October 22, 2014.
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) Oct, 26, 2010.
Math 240: Transition to Advanced Math Deductive reasoning: logic is used to draw conclusions based on statements accepted as true. Thus conclusions are.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Logic: Intro & Propositional Definite Clause Logic CPSC 322 – Logic 1 Textbook §5.1 March 4, 2011.
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
Conditional Statements
Reasoning under Uncertainty: Conditional Prob., Bayes and Independence Computer Science cpsc322, Lecture 25 (Textbook Chpt ) Nov, 5, 2012.
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
How do I show that two compound propositions are logically equivalent?
Do you agree with the following proofs? 1.Prove that  2 is irrational. Proof: Suppose that  2 is not irrational, then  2 = p/q for some natural numbers.
Computer Science CPSC 322 Lecture 27 Conditioning Ch Slide 1.
Logics for Data and Knowledge Representation
CPSC 322, Lecture 19Slide 1 (finish Planning) Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt – 5.2) Oct,
CPSC 422, Lecture 21Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 21 Oct, 30, 2015 Slide credit: some slides adapted from Stuart.
Computer Science CPSC 322 Lecture 22 Logical Consequences, Proof Procedures (Ch 5.2.2)
Slide 1 Propositional Logic Intro, Syntax Jim Little UBC CS 322 – CSP October 17, 2014 Textbook § – 5.2.
Logic: Proof procedures, soundness and correctness CPSC 322 – Logic 2 Textbook §5.2 March 7, 2011.
Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.
5-5 Indirect Proof. Indirect Reasoning: all possibilities are considered and then all but one are proved false. The remaining possibility must be true.
Metalogic Soundness and Completeness. Two Notions of Logical Consequence Validity: If the premises are true, then the conclusion must be true. Provability:
Chapter 1 Logic and proofs
Computer Science CPSC 322 Lecture 14 Intro to Logic (5.1, 5.1.1) 1.
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) Oct, 30, 2013.
Logic: TD as search, Datalog (variables)
Computer Science cpsc322, Lecture 20
Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19
Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19
Propositional Definite Clause Logic: Syntax, Semantics, R&R and Proofs
Logic: Top-down proof procedure and Datalog
Assignment-2 due now Enterprise Architecture Conference Sat. Oct 27
Logic: Domain Modeling /Proofs + Computer Science cpsc322, Lecture 22
Computer Science cpsc322, Lecture 20
Bottom Up: Soundness and Completeness
Bottom Up: Soundness and Completeness
Bottom Up: Soundness and Completeness
Presentation transcript:

CPSC 322, Lecture 21Slide 1 Bottom Up: Soundness and Completeness Computer Science cpsc322, Lecture 21 (Textbook Chpt 5.2) February, 27, 2009

CPSC 322, Lecture 21Slide 2 Lecture Overview Recap Soundness of Bottom-up Proofs Completeness of Bottom-up Proofs

CPSC 322, Lecture 21Slide 3 (Propositional) Logic: Key ideas Given a domain that can be represented with n propositions you have …… interpretations (possible worlds) If you do not know anything you can be in any of those If you know that some logical formulas are true (your …….). You know that you can be only in ……… It would be nice to know what else is true in all those…

CPSC 322, Lecture 21Slide 4 PDCL syntax / semantics / proofs Interpretations? rqp TTT TTF TFT TFF FTT FTF FFT FFF Models? What is logically entailed ? Prove Domain can be represented by three propositions: p, q, r

CPSC 322, Lecture 21Slide 5 PDCL syntax / semantics / proofs Interpretations rqp TTT TTF TFT TFF FTT FTF FFT FFF Models What is logically entailed? Prove

CPSC 322, Lecture 21Slide 6 Lecture Overview Recap Soundness of Bottom-up Proofs Completeness of Bottom-up Proofs

CPSC 322, Lecture 21Slide 7 Soundness of bottom-up proof procedure Generic Soundness of proof procedure: If G can be proved by the procedure (KB ⊦ G) then G is logically entailed by the KB (KB ⊧ G) For Bottom-Up proof if at the end of procedure then G is logically entailed by the KB So BU is sound, if …….

CPSC 322, Lecture 21Slide 8 Soundness of bottom-up proof procedure Suppose this is not the case. 1.Let h be the first atom added to C that is not entailed by KB (i.e., that's in every model of KB) 2.Suppose h isn't true in model M of KB. 3.Since h was added to C, there must be a clause in KB of form: 4.Each b i is true in M (because of 1.). h is false in M. So…… 5.Therefore 6.Contradiction! thus no such h exists.

CPSC 322, Lecture 21Slide 9 Lecture Overview Recap Soundness of Bottom-up Proofs Completeness of Bottom-up Proofs

CPSC 322, Lecture 21Slide 10 Completeness of Bottom Up Generic Completeness of proof procedure: If G is logically entailed by the KB (KB ⊧ G) then G can be proved by the procedure (KB ⊦ G) Sketch of our proof: 1.Suppose KB ⊧ G. Then G is true in all models of KB. 2.Thus G is true in any particular model of KB 3.We will define a model so that if G is true in that model, G is generated by the bottom up algorithm. 4.Thus KB ⊦ G.

CPSC 322, Lecture 21Slide 11 Let’s work on step 3 3. We will define a model so that if G is true in that model, G is generated by the bottom up algorithm. 3.1 We will define an interpretation I so that if G is true in I, G is generated by the bottom up algorithm. 3.2 We will then show that ………

CPSC 322, Lecture 22Slide 12 Let’s work on step 3.1 a ← e ∧ g. b ← f ∧ g. c ← e. f ← c ∧ e. e. d. { } { e } { e, d } { e, d, c} { e, d, c, f } { a, b, c, d, e, f, g } Let I be the interpretation in which every element of C is and every other atom is. 3.1 Define interpretation I so that if G is true in I, Then G ⊆ C.

CPSC 322, Lecture 21Slide 13 Let’s work on step 3.2 Claim: I is a model of KB. Proof: Assume that I is not a model of KB. Then there must exist some clause h ← b 1 ∧ … ∧ b m in KB (having zero or more b i 's) which is in I. The only way this can occur is if b 1 … b m are in I (i.e., are in C) and h is in I (i.e., is not in C ) But if each b i belonged to C, Bottom Up would have added h to C as well. So, there can be no clause in the KB that is false in interpretation I (which implies the claim :-)

CPSC 322, Lecture 22Slide 14 Completeness of Bottom Up If KB ⊧ G then KB ⊦ G Suppose KB ⊧ G. Then G is true Thus G is true Thus Thus G is generated Thus

CPSC 322, Lecture 4Slide 15 Learning Goals for today’s class You can: Prove that BU proof procedure is sound Prove that BU proof procedure is complete

CPSC 322, Lecture 20Slide 16 Next class (still section 5.2) Using PDC Logic to model the electrical domain Reasoning in the electrical domain Top-down proof procedure (as Search)

CPSC 322, Lecture 19Slide 17 Study for midterm (Wed March 4) Midterm: ~10 short questions + 2 problems Study: textbook and inked slides Work on all practice exercises While you revise the learning goals, work on review questions - I may even reuse some verbatim Will post a couple of problems from previous offering (maybe slightly more difficult /inappropriate for you because they were not informed by the learning goals) … but I’ll give you the solutions