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

First-Order 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: First-Order Logic, Logical Agents, Calculi, Logical Agent Framework, Logic In General, Knowledge Representation, Inference, Theorem, Planning, Normal Forms

Typology: Slides

2012/2013

Uploaded on 04/29/2013

shantii
shantii 🇮🇳

4.4

(14)

98 documents

1 / 24

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Lecture 12
First-Order Logic (FOL) Review
Docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18

Partial preview of the text

Download First-Order Logic - Artificial Intelligence - Lecture Slides and more Slides Artificial Intelligence in PDF only on Docsity!

Lecture 12

First-Order Logic (FOL) Review

Lecture Outline

  • Today’s Reading

  • Next Week’s Reading: Chapter 8, R&N
  • Previously: Logical Agents and Calculi
    • Logical agent framework
    • Logic in general: tools for
      • Knowledge representation
      • Inference / theorem proving and problem solving / planning
    • Propositional calculus
      • Normal forms
      • Sequent rules (modus ponens, resolution)
    • Predicate logic
    • First-order logic (FOL) aka first-order predicate calculus (FOPC)
  • Today: FOL Agents, Examples; Frame Problem; Situation Calculus
  • Next Week: FOL Knowledge Bases (Chapter 8, R&N)

Review: Elements of FOL

  • Logical Agents Overview (Last Tuesday)
    • Knowledge Bases (KB) and KB agents
    • Motivating example: Wumpus World
    • Syntax of propositional calculus
    • Elements of logic in general
      • Syntax: What constitutes legitimate sentences aka well-formed formulae?
      • Semantics: What constitutes logical entailment?
      • Proof theory: What constitutes provability? Soundness? Completeness?
  • Propositional and First-Order Calculi (Last Thursday)
    • Propositional calculus (concluded): inference by model checking, sequent rules
    • Elements of logic in general: normal forms (CNF, DNF, Horn) and their usage
    • Predicate logic without quantifiers: functions and predicates, terms and atoms
    • Introduction to First-Order Logic (FOL)
      • Domain theory
      • Syntax of WFFs: proper scoping (existential, universal quantification)
      • New features: semantics of quantification

Validity and Satisfiability

Inference (Sequent) Rules for

Propositional Logic

Logical Agents:

Taking Stock

Syntax of FOL:

Basic Elements

FOL: Atomic Sentences

(Atomic Well-Formed Formulae)

  • “Every Dog Chases Its Own Tail”
    • d. Chases ( d , tail-of (d))
    • Alternative Statement: ∀ d. ∃ t. Tail-Of ( t , d ) ∧ Chases ( d , t )
    • Prefigures concept of Skolemization (Skolem variables / functions)
  • “Every Dog Chases Its Own (Unique) Tail”
    • d. ∃^1 t. Tail-Of ( t , d ) ∧ Chases ( d , t ) ≡ ∀ d. ∃ t. Tail-Of ( t , d ) ∧ Chases ( d , t ) ∧ [∀ t’ Chases ( d , t’ ) ⇒ t’ = t ]
  • “Only The Wicked Flee when No One Pursueth”
    • x. Flees ( x ) ∧ [¬∃ y Pursues ( y , x )] ⇒ Wicked ( x )
    • Alternative : ∀ x. [∃ y. Flees ( x, y )] ∧ [¬∃ z. Pursues ( z , x )] ⇒ Wicked ( x )
  • Offline Exercise: What Is An n th Cousin, m Times Removed?

Jigsaw Exercise [1]:

First-Order Logic Sentences

Jigsaw Exercise [2]:

First-Order Logic Sentences

More Fun with Sentences

  • “Every Dog Chases Its Own Tail”
    • d. Chases ( d , tail-of (d))
    • Alternative Statement: ∀ d. ∃ t. Tail-Of ( t , d ) ∧ Chases ( d , t )
    • Prefigures concept of Skolemization (Skolem variables / functions)
  • “Every Dog Chases Its Own (Unique) Tail”
    • d. ∃^1 t. Tail-Of ( t , d ) ∧ Chases ( d , t ) ≡ ∀ d. ∃ t. Tail-Of ( t , d ) ∧ Chases ( d , t ) ∧ [∀ t’ Chases ( d , t’ ) ⇒ t’ = t ]
  • “Only The Wicked Flee when No One Pursueth”
    • x. Flees ( x ) ∧ [¬∃ y Pursues ( y , x )] ⇒ Wicked ( x )
    • Alternative : ∀ x. [∃ y. Flees ( x, y )] ∧ [¬∃ z. Pursues ( z , x )] ⇒ Wicked ( x )
  • Offline Exercise: What Is An n th Cousin, m Times Removed?

Wumpus World Revisited:

Interacting with FOL KBs

Deducing Hidden Properties

Keeping Track of Change:

Situation Calculus