Computability and Complexity 9-1 Computability and Complexity Andrei Bulatov Logic Reminder (Cnt’d)

Slides:



Advertisements
Similar presentations
Resolution Proof System for First Order Logic
Advertisements

Artificial Intelligence Chapter 13 The Propositional Calculus Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Biointelligence Lab School of Computer Sci. & Eng.
1 A formula in predicate logic An atom is a formula. If F is a formula then (~F) is a formula. If F and G are Formulae then (F /\ G), (F \/ G), (F → G),
Standard Logical Equivalences
1 Logic Logic in general is a subfield of philosophy and its development is credited to ancient Greeks. Symbolic or mathematical logic is used in AI. In.
First Order Logic Resolution
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
Resolution in Propositional and First-Order Logic.
Logic Concepts Lecture Module 11.
Predicate Calculus Formal Methods in Verification of Computer Systems Jeremy Johnson.
CS128 – Discrete Mathematics for Computer Science
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
Complexity 11-1 Complexity Andrei Bulatov Space Complexity.
Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.
CSE (c) S. Tanimoto, 2008 Propositional Logic
Inference and Resolution for Problem Solving
Knowledge Representation I (Propositional Logic) CSE 473.
1 AI=Knowledge Representation & Reasoning zSyntax zSemantics zInference Procedure yAlgorithm ySound? yComplete? yComplexity.
From Chapter 4 Formal Specification using Z David Lightfoot
Chapter 3 Propositional Logic
Computability and Complexity 10-1 Computability and Complexity Andrei Bulatov Gödel’s Incompleteness Theorem.
Introduction to Logic for Artificial Intelligence Lecture 2 Erik Sandewall 2010.
Adapted from Discrete Math
Propositional Logic Reasoning correctly computationally Chapter 7 or 8.
Proof Systems KB |- Q iff there is a sequence of wffs D1,..., Dn such that Dn is Q and for each Di in the sequence: a) either Di is in KB or b) Di can.
Propositional Resolution Computational LogicLecture 4 Michael Genesereth Spring 2005.
1st-order Predicate Logic (FOL)
1 Knowledge Based Systems (CM0377) Lecture 4 (Last modified 5th February 2001)
Conjunctive normal form: any formula of the predicate calculus can be transformed into a conjunctive normal form. Def. A formula is said to be in conjunctive.
Pattern-directed inference systems
Logical Agents Logic Propositional Logic Summary
Propositional Logic Dr. Rogelio Dávila Pérez Profesor-Investigador División de Posgrado Universidad Autónoma Guadalajara
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
CSE S. Tanimoto Horn Clauses and Unification 1 Horn Clauses and Unification Propositional Logic Clauses Resolution Predicate Logic Horn Clauses.
Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
Theory and Applications
Bertram Ludäscher Department of Computer Science & Engineering University of California, San Diego CSE-291: Ontologies in Data Integration.
Extra slides for Chapter 3: Propositional Calculus & Normal Forms Based on Prof. Lila Kari’s slides For CS2209A, 2009 By Dr. Charles Ling;
CS6133 Software Specification and Verification
2.1 Sets 2.2 Set Operations –Set Operations –Venn Diagrams –Set Identities –Union and Intersection of Indexed Collections 2.3 Functions 2.4 Sequences and.
Automated reasoning with propositional and predicate logics Spring 2007, Juris Vīksna.
Artificial Intelligence “Introduction to Formal Logic” Jennifer J. Burg Department of Mathematics and Computer Science.
第 1 6 章 谓词演算中的归结. 2 Outline Unification Predicate-Calculus Resolution Completeness and Soundness Converting Arbitrary wffs to Clause Form Using Resolution.
1/5/2016Hilbertův kalkul1 Lecture 12 Hilbert-like calculus.
1 First order theories (Chapter 1, Sections 1.4 – 1.5) From the slides for the book “Decision procedures” by D.Kroening and O.Strichman.
CS2351 Artificial Intelligence Bhaskar.V Class Notes on Knowledge Representation - Logical Agents.
Propositional Logic Rather than jumping right into FOL, we begin with propositional logic A logic involves: §Language (with a syntax) §Semantics §Proof.
Tautology. In logic, a tautology (from the Greek word ταυτολογία) is a formula that is true in every possible interpretation.logic Greek formulainterpretation.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
1 Propositional Proofs 1. Problem 2 Deduction In deduction, the conclusion is true whenever the premises are true.  Premise: p Conclusion: (p ∨ q) 
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
1 Section 7.1 First-Order Predicate Calculus Predicate calculus studies the internal structure of sentences where subjects are applied to predicates existentially.
Propositional Logic. Assignment Write any five rules each from two games which you like by using propositional logic notations.
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
Chapter 1 Logic and proofs
CENG 424-Logic for CS Introduction Based on the Lecture Notes of Konstantin Korovin, Valentin Goranko, Russel and Norvig, and Michael Genesereth.
Propositional Logic (a.k.a. Sentential Logic)
Introduction to Logic for Artificial Intelligence Lecture 2
Knowledge Representation and Reasoning
Computability and Complexity
The Propositional Calculus
Proposition & Predicates
Complexity 6-1 The Class P Complexity Andrei Bulatov.
Back to “Serious” Topics…
MA/CSSE 474 More Math Review Theory of Computation
Computer Security: Art and Science, 2nd Edition
CSNB234 ARTIFICIAL INTELLIGENCE
Chapter 2: Analysis and Verification of Non-Real-Time Systems
Presentation transcript:

Computability and Complexity 9-1 Computability and Complexity Andrei Bulatov Logic Reminder (Cnt’d)

Computability and Complexity 9-2 Propositional logic Conjunctive normal forms Predicates, functions and quantifiers Terms Formulas

Computability and Complexity 9-3 Models (First Order Semantics) Let  be a vocabulary. A model appropriate to  is a pair M=(U,  ) consisting of the universe of M, a non-empty set U the interpretation, a function  that assigns - to each predicate symbol P a concrete predicate on U - to each function symbol f a concrete function on U the equality predicate symbol is always assigned the equality predicate on U

Computability and Complexity 9-4 Meaning of terms Let t be a term and let T be an assignment of variables in t with values from U if t is a variable, say, t = X, then is defined to be if then is defined to be

Computability and Complexity 9-5 A model M and a variable assignment T satisfy a formula  (written M, T |=  ) if if is an atomic formula, then M,T |=  if if  =  then M,T |=  if M,T |   if then M,T |=  if and if then M,T |=  if or if  =  X  then M,T |=  if, for every u  U, where is the assignment that is identical to T, except that if  =  X  then M,T |=  if, there exists u  U such that

Computability and Complexity 9-6 Examples A model of the vocabulary of graph theory is a pair G=(U,E), where U is a set and E is a binary relation, that is a graph A model of the vocabulary of number theory U = N, the predicate and function symbols have their usual sense U = Z, the predicate and function symbols have their usual sense U = Q, the predicate and function symbols have their usual sense U = R, the predicate and function symbols have their usual sense U = C, the predicate and function symbols have their usual sense U = {0,…,n-1}, the predicate symbols have their usual sense, the function symbols are interpreted by operations modulo n

Computability and Complexity 9-7 Types of First Order Formulas A formula  is said to be valid if M,T   for any model M and assignment T A formula  is said to be satisfiable if M,T   for some M and T A formula  is said to be unsatisfiable if M,T   for no M and T valid s a t i s f i a b l e unsatisfiable Formulas  and  are said to be equivalent,   , if they have the same satisfying models and assignments

Computability and Complexity 9-8 Valid Formulas Boolean tautologies Equality Quantifiers

Computability and Complexity 9-9 Models and Theories Let  be a vocabulary. For a sentence (set of sentences) , Mod (  ) denotes the class of all models satisfying  For a model (set of models) M, Th (M) denotes the set all sentences satisfied by M (each model from M ) It is called the elementary theory of M If then  is called a valid consequence of written

Computability and Complexity 9-10 Examples Let  be a first order description of a computer chip,  states that a deadlock never occurs  is the question “Can the chip be deadlocked?”

Computability and Complexity 9-11 Proof Systems A proof system consists of a set axioms a collection of proof rules |   A proof is a sequence of formulas, where every formula is Either an axiom or obtained from preceding formulas using a rule A theorem is any formula occurring in a proof

Computability and Complexity 9-12 Propositional Logic Axioms : the main tautologies Proof rules: substitution Let  and  be propositional formulas and let denote the formula obtained from  by replacing every occurrence of X with . Then  |  is a proof rule modus ponens ,  |   Theorems : the tautologies

Computability and Complexity 9-13 Predicate Calculus Let  be a vocabulary with plenty of predicate and function symbols Axioms: Proof rules : modus ponens Theorems : valid first order formulas AX0 Any Boolean tautology AX1 Any expression of the following forms: AX1a : t=t AX1b : AX1c : AX2 : Any expression of the form AX3 : Any expression of the form    X , with X not free in  AX4 : Any expression of the form (  X (    )  ((  X  )  (  X  ))

Computability and Complexity 9-14 Gödel’s Completeness Theorem Theorem Let  be a set of formulas and  a formula. Then    if and only if    Theorem Let  be a set of formulas and  a formula. Then    if and only if   

Computability and Complexity 9-15 Resolution Axioms : a set of disjunctions of atomic formulas (a set of clauses) Proof rules: resolution   P  ,    P   C  X  C , D   X  D  ,      C, D   C  D  (    is called the resolvent of  and  ) R R

Computability and Complexity 9-16 Satisfiability Instance: A conjunctive normal form . Question: Is  satisfiable? Satisfiability Instance: A conjunctive normal form  every clause of which contains exactly k literals. Question: Is  satisfiable? k- Satisfiability

Computability and Complexity 9-17 Theorem A Satisfiability instance, , is unsatisfiable if and only if    Theorem A Satisfiability instance, , is unsatisfiable if and only if    R Example : (1)(2)(3)(4)(5) Proof :