Propositional Logic Predicate Logic

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

1 Knowledge Representation Introduction KR and Logic.
Some Prolog Prolog is a logic programming language
Inference Rules Universal Instantiation Existential Generalization
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),
Knowledge & Reasoning Logical Reasoning: to have a computer automatically perform deduction or prove theorems Knowledge Representations: modern ways of.
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.
Artificial Intelligence
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.
Logic Use mathematical deduction to derive new knowledge.
Propositional Logic CMSC 471 Chapter , 7.7 and Chuck Dyer
13 Automated Reasoning 13.0 Introduction to Weak Methods in Theorem Proving 13.1 The General Problem Solver and Difference Tables 13.2 Resolution.
Logic.
Knowledge Representation Methods
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
Propositional Calculus A propositional calculus formula is composed of atomic propositions, which area simply statements that are either true or false.
CS128 – Discrete Mathematics for Computer Science
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
1 Automated Reasoning Introduction to Weak Methods in Theorem Proving 13.1The General Problem Solver and Difference Tables 13.2Resolution Theorem.
Discrete Mathematics Lecture 2 Alexander Bukharovich New York University.
Knoweldge Representation & Reasoning
Inference in First-Order Logic
Let remember from the previous lesson what is Knowledge representation
Chapter 3 Propositional Logic
Artificial Intelligence
Knowledge & Reasoning Logical Reasoning: to have a computer automatically perform deduction or prove theorems Knowledge Representations: modern ways of.
Adapted from Discrete Math
Predicates and Quantifiers
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
1 Knowledge Based Systems (CM0377) Lecture 4 (Last modified 5th February 2001)
Introduction to Prolog Asst. Prof. Dr. Senem Kumova Metin Revised lecture notes of “Concepts of Programmig Languages, Robert W. Sebesta, Ch. 16”
Pattern-directed inference systems
1 Knowledge Representation. 2 Definitions Knowledge Base Knowledge Base A set of representations of facts about the world. A set of representations of.
1.  Provides the ability to access individual assertions. e.g. in Predicate calculus we may say: P denotes “It rained on Tuesday” but in predicate calculus.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8.
9/30/98 Prof. Richard Fikes Inference In First Order Logic Computer Science Department Stanford University CS222 Fall 1998.
Logic Programming Languages Session 13 Course : T Programming Language Concept Year : February 2011.
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
Automated Reasoning Early AI explored how to automate several reasoning tasks – these were solved by what we might call weak problem solving methods as.
CS6133 Software Specification and Verification
Artificial Intelligence 7. Making Deductive Inferences Course V231 Department of Computing Imperial College, London Jeremy Gow.
C. Varela1 Logic Programming (PLP 11) Predicate Calculus, Horn Clauses, Clocksin-Mellish Procedure Carlos Varela Rennselaer Polytechnic Institute November.
For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.
For Friday Read chapter 8 Homework: –Chapter 7, exercises 2 and 10 Program 1, Milestone 2 due.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
Reasoning with Propositional Logic automated processing of a simple knowledge base CD.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
2004/9/15fuzzy set theory chap02.ppt1 Classical Logic the forms of correct reasoning - formal logic.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
CT214 – Logical Foundations of Computing Darren Doherty Rm. 311 Dept. of Information Technology NUI Galway
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
Chapter 8 : Fuzzy Logic.
Knowledge Representation and Reasoning
Proposition & Predicates
Logic Use mathematical deduction to derive new knowledge.
Carlos Varela Rensselaer Polytechnic Institute November 10, 2017
Horn Clauses and Unification
Logical Agents Chapter 7.
CSNB234 ARTIFICIAL INTELLIGENCE
Horn Clauses and Unification
Predicates and Quantifiers
Propositional Calculus
Propositional Logic CMSC 471 Chapter , 7.7 and Chuck Dyer
RESOLUTION.
Predicate Logic: Syntax.
Predicate Logic.
Presentation transcript:

Propositional Logic Predicate Logic

Review of Propositional Logic Propositional variables Propositional constants: T, F Logical connectives Let P: Today is Sunday Q: We have guests P  Q : Today is Sunday and We have guests P  Q : Today is Sunday or We have guests P : Today is not Sunday. P  Q : if today is Sunday then we have guests. P  Q : Today is Sunday if and only if we have guests.

Semantics Propositions and expressions have truth values: can be true or false. The truth value of an expression is determined by truth tables, e.g.: P Q P v Q T T T T F T F T T F F F

Propositional Proof Theory Propositional proof theory: A set of axioms (logical identities) and inference rules used to manipulate expressions and to obtain true expressions out of other true expressions. Inference rules: give a mechanical procedure to obtain true expressions out of other true expressions. Modus ponens: P, P  Q |= Q

Resolution A  B, B  C |= A  C compare with: B, B  C |= C (B C = B  C) If B is true, then C must be true, if B is false than A must be true. This means that WHENEVER the conjunction (A  B)  (B  C) is true, A  C is also true.

How resolution works Eliminate opposite literals and rewrite two expressions as one P1 v P2 P2 P1 P1 v P3 v P4 P3 v P4 This is the conclusion

Proof by refutation Add the negation of the statement to be proved P4 v P6 P6 P4 P4 contradiction

Predicate Logic Represents properties and relations by using predicates with arguments. likes(mary,apples)  likes(mary,grapes) Quantifiers: indicate the scope of the predicate Universal quantifier:  X likes ( mary , X) Mary likes everything Existential quantifier  X likes ( mary , X) there is something which Mary likes.

Proof Theory for Predicate Logic Based on the resolution procedure. Unification: matching predicates with variables to atomic sentences (matching variables to constants.) Example: Is Socrates mortal?  X (human(X)  mortal(X)) human(socrates) human(plato) alien(spock)

Knowledge representation using predicate logic Some books are interesting.  x (book(x) Λ interesting(x)) Anybody that has a friend is not lonely (If someone has a friend, they are not lonely) x ( y friend(x,y)  ~lonely(x))

Prolog example Predicate logic representation is used only on paper. Computational implementation: logic programming languages In Logic and in Prolog:  X  Y (father(X,Y) v mother(X,Y)  parent(X,Y))  X  Y( ( Z(parent(Z,X)  parent(Z,Y))  siblings(X,Y)) parent(X,Y):- father(X,Y). parent(X,Y):- mother(X,Y). siblings(X,Y):- parent(Z,X),parent(Z,Y).