Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Propositional and Predicate Logic - Artificial Intelligence - Lecture Slides, Slides of Artificial Intelligence

Some concept of Artificial Intelligence are Agents and Problem Solving, Autonomy, Programs, Classical and Modern Planning, First-Order Logic, Resolution Theorem Proving, Search Strategies, Structure Learning. Main points of this lecture are: Propositional and Predicate Logic, Propositional Calculus, Syntax, Logic In General, Wumpus World, Agents, Propositional Calculus, Normal Forms, Production Systems, Predicate Logic

Typology: Slides

2012/2013

Uploaded on 04/29/2013

shantii
shantii 🇮🇳

4.4

(14)

98 documents

1 / 20

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Lecture 11 of 41
Intro to Propositional and Predicate Logic
Docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14

Partial preview of the text

Download Propositional and Predicate Logic - Artificial Intelligence - Lecture Slides and more Slides Artificial Intelligence in PDF only on Docsity!

Lecture 11 of 41

Intro to Propositional and Predicate Logic

Lecture Outline

  • Today’s Reading

  • Previously: Logical Agents
    • Knowledge Bases (KB) and KB agents
    • Motivating example: Wumpus World
    • Logic in general
    • Syntax of propositional calculus
  • Today
    • Propositional calculus (concluded)
    • Normal forms
    • Production systems
    • Predicate logic
    • Introduction to First-Order Logic (FOL): examples, inference rules (sketch)
  • Next Week: First-Order Logic Review, Resolution Theorem Proving

Review:

Simple Knowledge-Based Agent

Figure 6.1 p. 152 R&N

Review:

Types of Logic

Figure 6.7 p. 166 R&N

Propositional Inference:

Enumeration (Model Checking) Method

Normal Forms:

CNF, DNF, Horn

Proof Methods

Inference (Sequent) Rules for

Propositional Logic

The Road Ahead:

Predicate Logic and FOL

  • Predicate Logic
    • Enriching language
      • Predicates
      • Functions
    • Syntax and semantics of predicate logic
  • First-Order Logic (FOL, FOPC)
    • Need for quantifiers
    • Relation to (unquantified) predicate logic
    • Syntax and semantics of FOL
  • Fun with Sentences
  • Wumpus World in FOL

Syntax of FOL:

Basic Elements

Summary Points

  • Logical Agents Overview (Last Time)
    • Knowledge Bases (KB) and KB agents
    • Motivating example: Wumpus World
    • Logic in general
    • Syntax of propositional calculus
  • Propositional and First-Order Calculi (Today)
    • Propositional calculus (concluded)
      • Normal forms
      • Inference ( aka sequent) rules
    • Production systems
    • Predicate logic without quantifiers
    • Introduction to First-Order Logic (FOL)
      • Examples
      • Inference rules (sketch)
  • Next Week: First-Order Logic Review, Intro to Resolution Theorem Proving

Fun with Sentences:

Family Feud

Adapted from slides by S. Russell, UC Berkeley

  • Brothers are Siblings
    • x , y. Brother ( x , y ) ⇔ Sibling ( x , y )
  • Siblings (i.e., Sibling Relationships) are Reflexive
    • x , y. Sibling ( x , y ) ⇔ Sibling ( y , x )
  • One’s Mother is One’s Female Parent
    • x , y. Mother ( x , y ) ⇔ Female ( x ) ∧ Parent ( x , y )
  • A First Cousin Is A Child of A Parent’s Sibling
    • x , y. First-Cousin ( x , y ) ⇔ ∃ p , ps. Parent ( p , x ) ∧ Sibling ( p , ps ) ∧ Parent ( ps , y )

Jigsaw Exercise [2]:

First-Order Logic Sentences

Terminology

  • Logical Frameworks
    • Knowledge Bases (KB)
    • Logic in general: representation languages, syntax, semantics
    • Propositional logic
    • First-order logic (FOL, FOPC)
    • Model theory, domain theory: possible worlds semantics, entailment
  • Normal Forms
    • Conjunctive Normal Form (CNF)
    • Disjunctive Normal Form (DNF)
    • Horn Form
  • Proof Theory and Inference Systems
    • Sequent calculi: rules of proof theory
    • Derivability or provability
    • Properties
      • Soundness (derivability implies entailment)
      • Completeness (entailment implies derivability)