First-Order Logic Introduction Syntax and Semantics Using First-Order Logic Summary.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Logic Use mathematical deduction to derive new knowledge.
Agents That Reason Logically Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2004.
Knowledge Based Systems: Logic and Deduction Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
L41 Lecture 2: Predicates and Quantifiers.. L42 Agenda Predicates and Quantifiers –Existential Quantifier  –Universal Quantifier 
Knowledge Representation Methods
Artificial Intelligence Lecture No. 10 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.
First-Order Logic. Limitations of propositional logic Suppose you want to say “All humans are mortal” –In propositional logic, you would need ~6.7 billion.
First-Order Logic Chapter 8.
Introduction to Semantics To be able to reason about the meanings of utterances, we need to have ways of representing the meanings of utterances. A formal.
CS 561, Session Midterm format Date: 10/10/2002 from 11:00am – 12:20 pm Location: THH 101 Credits: 35% of overall grade Approx. 4 problems, several.
Logical Agents Chapter 7. Why Do We Need Logic? Problem-solving agents were very inflexible: hard code every possible state. Search is almost always exponential.
Propositional Calculus Knowledge based agent Knowledge is contained in agents in the form of sentences in a knowledge representation language stored in.
FIRST-ORDER LOGIC FOL or FOPC
Predicate Calculus.
1 Knowledge Representation and Reasoning. 2 Knowledge Representation & Reasoning How knowledge about the world can be represented How knowledge about.
First order logic (FOL) first order predicate calculus.
Propositional Logic Agenda: Other forms of inference in propositional logic Basics of First Order Logic (FOL) Vision Final Homework now posted on web site.
FIRST ORDER LOGIC Levent Tolga EREN.
Predicates and Quantifiers
Lecture 3 [Self Study] Relational Calculus
Declarative vs Procedural Programming  Procedural programming requires that – the programmer tell the computer what to do. That is, how to get the output.
Theory and Applications
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Pattern-directed inference systems
Logical Agents Logic Propositional Logic Summary
1 Last time: Logic and Reasoning Knowledge Base (KB): contains a set of sentences expressed using a knowledge representation language TELL: operator to.
ARTIFICIAL INTELLIGENCE Lecture 3 Predicate Calculus.
Propositional Calculus Knowledge based agent Knowledge is contained in agents in the form of sentences in a knowledge representation language stored in.
지식표현 Agent that reason logically
Predicates and Quantified Statements
Theory and Applications
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
CS6133 Software Specification and Verification
Artificial Intelligence Chapter 15 The Predicate Calculus Artificial Intelligence Chapter 15 The Predicate Calculus Biointelligence Lab School of Computer.
Artificial Intelligence First-Order Logic (FOL). Outline of this Chapter The need for FOL? What is a FOL? Syntax and semantics of FOL Using FOL.
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.
1 CSC384: Intro to Artificial Intelligence Lecture 5.  Knowledge Representation.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
First-Order Logic Chapter 8 (not 8.1). Outline Why FOL? Why FOL? Syntax and semantics of FOL Syntax and semantics of FOL Using FOL Using FOL Wumpus world.
First-Order Logic. Outline Why FOL? Syntax and semantics of FOL Using FOL Knowledge engineering in FOL.
LOGIC. Logic in general  Logics are formal languages for representing information such that conclusions can be drawn  Syntax defines the sentences in.
First-Order Logic Reading: C. 8 and C. 9 Pente specifications handed back at end of class.
Computing & Information Sciences Kansas State University Lecture 12 of 42 CIS 530 / 730 Artificial Intelligence Lecture 12 of 42 William H. Hsu Department.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
First-Order Logic Semantics Reading: Chapter 8, , FOL Syntax and Semantics read: FOL Knowledge Engineering read: FOL.
1 First Order Logic CS 171/271 (Chapter 8) Some text and images in these slides were drawn from Russel & Norvig’s published material.
First-Order Logic Chapter 8. Problem of Propositional Logic  Propositional logic has very limited expressive power –E.g., cannot say "pits cause breezes.
PREDICATES AND QUANTIFIERS COSC-1321 Discrete Structures 1.
1 CS 2710, ISSP 2610 Chapter 8, Part 1 First Order Predicate Calculus FOPC.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Artificial Intelligence Logical Agents Chapter 7.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
CENG 424-Logic for CS Introduction Based on the Lecture Notes of Konstantin Korovin, Valentin Goranko, Russel and Norvig, and Michael Genesereth.
Chapter 8 : Fuzzy Logic.
Knowledge Representation using First-Order Logic
First Order Logic.
First-Order Logic Chapter 8.
CMSC Discrete Structures
Semantics In propositional logic, we associate atoms with propositions about the world. We specify the semantics of our logic, giving it a “meaning”. Such.
Logic Use mathematical deduction to derive new knowledge.
First-Order Logic Chapter 8.
(1.4) An Introduction to Logic
Chapter 8, Part 1 First Order Predicate Calculus FOPC
Logical Agents Chapter 7.
Chapter 1: Propositional and First-Order Logic
First-Order Logic Chapter 8.
Chapter 8, Part 1 First Order Predicate Calculus FOPC
Presentation transcript:

First-Order Logic Introduction Syntax and Semantics Using First-Order Logic Summary

Introduction Propositional logic: o Less expressive than predicate logic. o Is declarative (as opposed to procedural) o It lacks power to describe things concisely. o Assumes facts are true or false

Compared to First-Order Logic… Builds around objects and relations. Relations may hold or not. Even more complex languages: Temporal logic. Facts hold at particular times High-order logic. Relations and functions are objects themselves.

Languages LanguageElementsBelief PropositionsFactsTrue/false/unknown First-order logicFacts,objects, relations True/false/unknown Temporal logicFacts,objects, relations, time True/false/unknown ProbabilityFactsDegree of belief [0,1] Fuzzy logicFacts with degree of truth Interval value

First-Order Logic Introduction Syntax and Semantics Using First-Order Logic Summary

Syntax and Semantics What is a model? Propositional logic: sets of truth values for symbols First-order logic: a.Domain of the model (objects it contains) b.Relations (tuples of objects related)

Example Stars, Galaxies, Quasars Surrounded by planets Made of stars A kind of AGN in galaxies

Symbols and Interpretations Symbols: 1. Constants: earth, moon, sun, milky-way 2. Predicate Symbols: Neighbor-planets(x,y) 3. Function Symbols: 3rdPlanet(sun)

Syntax Sentence  AtomicSentence | ( Sentence Connective Sentence ) | ( Quantifier Variable,… Sentence ) | ~Sentence AtomicSentence  Predicate(Term) | Term = Term Term  Function(Term) | Constant | Variable

Syntax Connective   | ^ | V |  Quantifier  V | Constant  A | X1 | Sun Variable  a | x | s | … Predicate  NeighborPlanets | TypeGalaxy | ColorStar Function  1stPlanet, 2ndPlanet

Semantics Interpretation: Symbol “sun” refers to star sun Symbol “earth” refers to planet earth Star 3x45f refers to “specific star”

Terms Logical expression that refers to an object. Examples: Constant symbols: sun, earth, mars, venus. Function symbols: 3rdplanet(sun)

Sentences Statements or facts. Examples: Neighbor-Planets(earth,mars) ^ Neighbor-Galaxies(milky-way,andromeda)

Universal Quantifiers How do we express properties of entire collections of objects? Universal quantification V All stars are burning hydrogen: V x Star(x)  burning-hydrogen(x) True in all extended interpretations.

Existential Quantifiers x Star(x) ^ burning-hydrogen(x) Normally: Universal quantifier connects with  Existential quantifiers connect to ^

More on Quantifiers We can use multiple quantifiers: Vx Vy Star(x) ^ Galaxy(y) ^ InGalaxy(x,y)  Contains(y,x) Vx y Star(x) ^ Star(y) ^ Neighbor(x,y) All stars have a neighbor star

More on Quantifiers De Morgan’s rules apply: Vx ~P = ~ x P ~Vx P = x ~P Vx P = ~ x ~P x P = ~Vx ~P

Equality x,y NeighborStars(x,y) ^ NeighborStars(y,x) ^ ~(x = y)

First-Order Logic Introduction Syntax and Semantics Using First-Order Logic Summary

Using First-Order Logic Rational Agent: TELL(KB,Star(sun)) ASK(KB,Star(sun)) ASK(KB, x Star(x))

First-Order Logic Introduction Syntax and Semantics Using First-Order Logic Summary

Propositional logic talks about facts; predicate logic talks about relations (more expressive) A model is made of objects,relations, and functions. An interpretation maps symbols to the model Complex sentences use connectives and quantifiers Steps to develop a knowledge base.

Robert Kowalski Born 1941 in Connecticut. Professor at Imperial College London since He is well known for his many achievements in logic programming. Co-developed “event calculus’ and “legal reasoning”

Exercises Under propositional logic, assume you have 4 propositions named A, B, C, and D (all Boolean). Observe that V is disjunction or OR, & is conjunction or AND, and ~ is negation or NOT. Answer the following: What is the total number of models defined in this language? Is the statement A V B valid? why? Is the statement A V ~A valid? why? How many models are true under the statement B & D ?