Resolution Refutation Principle in Propositional Logic

Lecture 20 of CS607 Artificial Intelligence introduces Alan Robinson's landmark Resolution Principle, which revolutionized automated theorem proving by replacing dozens of complex natural deduction rules with a single, universally sound inference rule. Resolution operates on sentences expressed in Conjunctive Normal Form (CNF)—a conjunction of disjunctions of literals (a product of sums). The core Resolution Rule states that given two clauses (A or B) and (not-B or C), the complementary literals B and not-B cancel out, yielding the resolvent clause (A or C). Students study Proof by Refutation: to prove that a knowledge base KB entails query alpha, the algorithm negates alpha (adding not-alpha to KB) and applies resolution iteratively. If a contradiction is uncovered (deriving the empty clause Box or False), the refutation is complete and alpha is proven true. Analytical exercises, search trees, and solved numerical problems help students prepare thoroughly for Virtual University midterm and final term examinations. The curriculum systematically bridges classical symbolic AI reasoning with modern statistical machine learning and connectionist neural networks. Reviewing the accompanying lecture handouts and conceptual diagrams reinforces understanding of knowledge bases, inference rules, and uncertain reasoning models. Consistent evaluation of state-space representations, rule activation patterns, and truth table proofs ensures robust preparation for academic assessments. Students investigate how intelligent agents perceive environmental percepts through sensors and actuate rational decisions through operational effectors. The discussion highlights how heuristic evaluation functions guide search algorithms toward goal states while dramatically reducing computational overhead. Key concepts such as chromosome encoding, fitness proportional selection, and genetic diversity preservation are analyzed in evolutionary computation. The lecture details formal logic inference mechanisms, demonstrating how resolution refutation and unification derive valid theorems from clausal knowledge bases. Production rule architectures are analyzed to understand how forward chaining and backward chaining drive automated expert diagnostic systems. CLIPS rule-based programming constructs provide practical engineering frameworks for managing working memory facts and agenda activations. Fuzzy membership functions and linguistic variables are formulated to model real-world vagueness and human approximate reasoning mathematically.