'Poor t' diaporamas de présentation

Normal Forms and Resolution in FOL

Normal Forms and Resolution in FOL. automated reasoning with predicates. Conjunctive normal form. KB must be in CNF for resolution conjunction of disjunctions of predicates or negations. 1a. eliminate <=> A <=> B A => B ^ B => A 1b. eliminate => A => B ~A ? B. reduction to CNF .

416 views • 19 slides