Propositional- Logic课件.pptVIP

* * * * * * * * * * * * * * * * * * * * * Propositional Logic Chapter 7.4-7.5, 7.7 CMSC 471 Adapted from slides by Tim Finin and Marie desJardins. Some material adopted from notes by Andreas Geyer-Schulz and Chuck Dyer * Propositional logic Logical constants: true, false Propositional symbols: P, Q, S, ... (atomic sentences) Wrapping parentheses: ( … ) Sentences are combined by connectives: ? ...and [conjunction] ? ...or [disjunction] ?...implies [implication / conditional] ?..is equivalent [biconditional] ? ...not [negation] Literal: atomic sentence or negated atomic sentence * Examples of PL sentences P means “It is hot.” Q means “It is humid.” R means “It is raining.” (P ? Q) ? R “If it is hot and humid, then it is raining” Q ? P “If it is humid, then it is hot” A better way: Hot = “It is hot” Humid = “It is humid” Raining = “It is raining” * Propositional logic (PL) A simple language useful for showing key ideas and definitions User defines a set of propositional symbols, like P and Q. User defines the semantics of each propositional symbol: P means “It is hot” Q means “It is humid” R means “It is raining” A sentence (well formed formula) is defined as follows: A symbol is a sentence If S is a sentence, then ?S is a sentence If S is a sentence, then (S) is a sentence If S and T are sentences, then (S ? T), (S ? T), (S ? T), and (S ? T) are sentences A sentence results from a finite number of applications of the above rules * A BNF grammar of sentences in propositional logic S := Sentence ; Sentence := AtomicSentence | ComplexSentence ; AtomicSentence := TRUE | FALSE | P | Q | S ; ComplexSentence := ( Sentence ) | Sentence Connective Sentence | NOT Sentence ; Connective := NOT | AND | OR | IMPLIES | EQUIVALENT ; * Some terms The meaning or semantics of a sentence determines its interpretation. Given the truth values of all symbols in a sentence, it can be “evaluated” to determine its truth value (