ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.

Slides:



Advertisements
Similar presentations
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Advertisements

1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: The Moon is made of green cheese. Trenton.
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
CS128 – Discrete Mathematics for Computer Science
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
From Chapter 4 Formal Specification using Z David Lightfoot
1 Section 1.1 Logic. 2 Proposition Statement that is either true or false –can’t be both –in English, must contain a form of “to be” Examples: –Cate Sheller.
Chapter 3 Propositional Logic
Adapted from Discrete Math
Predicates and Quantifiers
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Propositions and Truth Tables
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Discrete Mathematics and Its Applications
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Artificial Intelligence: Definition “... the branch of computer science that is concerned with the automation of intelligent behavior.” (Luger, 2009) “The.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Introductory Logic PHI 120 Presentation: “Basic Concepts Review "
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
SSK3003 DISCRETE STRUCTURES
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM]
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
CS6133 Software Specification and Verification
Chapter 1: The Foundations: Logic and Proofs
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
CS2351 Artificial Intelligence Bhaskar.V Class Notes on Knowledge Representation - Logical Agents.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Propositional Logic Rather than jumping right into FOL, we begin with propositional logic A logic involves: §Language (with a syntax) §Semantics §Proof.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
What is the logic? The primary concern in logic is to identify and classify valid form of inference. The notions of 'validity' ,'form' and 'inference'
LECTURE 1. Disrete mathematics and its application by rosen 7 th edition THE FOUNDATIONS: LOGIC AND PROOFS 1.1 PROPOSITIONAL LOGIC.
1 Section 6.2 Propositional Calculus Propositional calculus is the language of propositions (statements that are true or false). We represent propositions.
Outline Logic Propositional Logic Well formed formula Truth table
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
 Statement - sentence that can be proven true or false  Truth value – true or false  Statements are often represented using letters such as p and q.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 04 : Logic.
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Simple Logic.
Presented by: Tutorial Services The Math Center
2. The Logic of Compound Statements Summary
AND.
DISCRETE MATHEMATICS CHAPTER I.
Knowledge Representation and Reasoning
Discrete Mathematics Logic.
Thinking Mathematically
Truth Tables and Equivalent Statements
Chapter 8 Logic Topics
Information Technology Department
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
TRUTH TABLES.
Applied Discrete Mathematics Week 1: Logic
Back to “Serious” Topics…
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture 2: Propositional Logic
Discrete Mathematics Logic.
Discrete Mathematics Lecture 2: Propositional Logic
TRUTH TABLES.
Presentation transcript:

ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information Technology Institute of Applied Computer Systems Department of Systems Theory and Design SYNTAX OF PROPOSITIONAL CALCULUS

Syntax of Propositional Calculus Symbols –The propositional symbols: P, Q, R, S, T,... –Truth symbols: True, False –Connectives: , , , , 

Symbols (continued) Propositional symbols denote propositions, or statements about the world that may be either true or false. Propositions are denoted by uppercase letters. Syntax of Propositional Calculus

Sentences –Every propositional symbol and truth symbol is a sentence –The negation of a sentence is a sentence –The conjunction, or AND, of two sentences is a sentence

Sentences (continued) –The disjunction, or OR, of two sentences is a sentence –The implication of one sentence for another is a sentence –The equivalence of two sentences is a sentence Syntax of Propositional Calculus

Sentences (continued) Examples 1.False, Q, True and S are sentences 2.  False and  R are sentences 3.P   Q  S  W is a sentence conjuncts

Syntax of Propositional Calculus disjuncts premise (antecedent) conclusion (consequent) 4.P   Q  S  W is a sentence 5.P  Q is a sentence 6.P  R  W is a sentence Sentences (continued)

Syntax of Propositional Calculus Sentences (continued) Legal sentences are also called well-formed formulas (WFF). The symbols ( ) and [ ] are used to group symbols into sub-expressions and to control their order of evaluation and meaning. For example, (P  Q)  S is quite different from P  (Q  S)

Syntax of Propositional Calculus Sentences (continued) The symbols ( ) and [ ] help to take into account the binding strength   and    For example,P  Q  S means (P  Q)  S P  Q  S  R means ((P  Q)  S)  R

Solution: P, Q and R are propositions and thus sentences P  Q, the conjunction of two sentences, is a sentence Syntax of Propositional Calculus PQ PP QQ RR      Sentences (continued) Question: Is P  Q  R   P   Q  R a well-formed formula?

Syntax of Propositional Calculus Sentences (continued) P  Q  R, the implication of a sentence for another, is a sentence  P and  Q, the negations of sentences, are sentences PQ PP QQ RR       P   Q, the disjunction of two sentences, is a sentence

Syntax of Propositional Calculus  P   Q  R, the disjunction of two sentences, is a sentence P  Q  R   P   Q  R, the equivalence of two sentences, is a sentence Sentences (continued) PQ PP QQ RR      This is the original sentence, which has been constructed through a series of applications of legal rules and is therefore well formed.