Propositional-and- First-- Order- Logic课件.pptVIP

Proving things A proof is a sequence of sentences, where each is a premise or is derived from earlier sentences in the proof by an inference rule The last sentence is the theorem (also called goal or query) that we want to prove Example for the “weather problem” 1 Hu premise “It’s humid” 2 Hu?Ho premise “If it’s humid, it’s hot” 3 Ho modus ponens(1,2) “It’s hot” 4 (Ho?Hu)?R premise “If it’s hot humid, it’s raining” 5 Ho?Hu and introduction(1,3) “It’s hot and humid” 6 R modus ponens(4,5) “It’s raining” Horn sentences A Horn sentence or Horn clause has the form: P1 ? P2 ? P3 ... ? Pn ? Qm where n=0, m in{0,1} Note: a conjunction of 0 or more symbols to left of ? and 0-1 symbols to right Special cases: n=0, m=1: P (assert P is true) n0, m=0: P?Q ? (constraint: both P and Q can’t be true) n=0, m=0: (well, there is nothing there!) Put in CNF: each sentence is a disjunction of literals with at most one non-negative literal ?P1 ? ? P2 ? ? P3 ... ? ? Pn ? Q (P ? Q) = (?P ? Q) Significance of Horn logic We can also have horn sentences in FOL Reasoning with horn clauses is much simpler Satisfiability of a propositional KB (i.e., finding values for a symbols that will make it true) is NP complete Restricting KB to horn sentences, satisfiability is in P For this reason, FOL Horn sentences are the basis for Prolog and Datalog What Horn sentences give up are handling, in a general way, (1) negation and (2) disjunctions Entailment and derivation Entailment: KB |= Q Q is entailed by KB (set sentences) iff there is no logically possible world where Q is false while all the sentences in KB are true Or, stated positively, Q is entailed by KB iff the conclusion is true in every logically possible world in which all the premises in KB are true Derivation: KB |- Q We can derive Q from KB if there’s a proof consisting of a sequence of valid inference steps starting from the premises in KB and resulting in Q Two important properties for inference Soundness: If KB |- Q then K