Backward Chaining - Artificial Intelligence - Lecture Slides, Slides for Artificial Intelligence. West Bengal University of Animal and Fishery Sciences

Artificial Intelligence

Description: 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: Backward Chaining, Resolution Preliminaries, First-Order Logic Basics, Logical Agents, Resolution Theorem Proving, Conjunctive Normal Form, Inference Rule, Single-Resolvent Form, General Form, Proof Procedure
Showing pages  1  -  2  of  24
The preview of this document ends here! Please or to read the full document or to download it.
Document information
Embed this document:
CIS730-Lecture-15-20030924

Lecture 15 of 41

More First-Order Logic Basics:

Backward Chaining, Resolution Preliminaries

Docsity.com

Lecture Outline

Today’s Reading

Next Week’s Reading: Chapters 9-10, R&N

Previously: Introduction to Propositional and First-Order Logic

Monday (20 Sep 2004)

First-order logic (FOL): predicates, functions, quantifiers

Sequent rules, proof by refutation

Wednesday (22 Sep 2004)

Forward Chaining with Modus Ponens

Ontology, History of Logic, Russell’s Paradox

Unification, Logic Programming Basics

Today: Backward Chaining, Resolution Preliminaries, A Look Ahead

Next Week: Resolution, Clausal Form (CNF), Decidability of SAT

Docsity.com

In-Class Discussion:

Problem Set 2

Docsity.com

Unification:

Definitions and Idea Sketch

Docsity.com

Generalized Modus Ponens

Docsity.com

Soundness of GMP

Docsity.com

Forward Chaining

Docsity.com

Example:

Forward Chaining

Docsity.com

Backward Chaining

Docsity.com

Example:

Backward Chaining

Docsity.com

Question: How Does This Relate to Proof by Refutation?

Answer

Suppose ¬Query, For The Sake Of Contradiction (FTSOC)

Attempt to prove that KB ¬Query

Review:

Backward Chaining

Docsity.com

Completeness Redux

Docsity.com

Completeness in FOL

Docsity.com

Resolution Inference Rule

Docsity.com

Fun with Sentences:

Family Feud

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)

Docsity.com

Conjunctive Normal (aka Clausal) Form [1]:

Conversion (R&N)

Docsity.com

Conjunctive Normal (aka Clausal) Form [2]:

Conversion (Nilsson) and Mnemonic

Implications Out

Negations Out

Standardize Variables Apart

Existentials Out (Skolemize)

Universals Made Implicit

Distribute And Over Or (i.e., Disjunctions In)

Operators Out

Rename Variables

A Memonic for Star Trek: The Next Generation Fans

Captain Picard:

I’ll Notify Spock’s Eminent Underground Dissidents On Romulus

I’ll Notify Sarek’s Eminent Underground Descendant On Romulus

Docsity.com

Skolemization

Docsity.com

Resolution Theorem Proving

Docsity.com

Example:

Resolution Proof

Docsity.com

Logic Programming vs. Imperative Programming

Docsity.com

Universe of Decision Problems

Given: KB,

Decide: ¬(KB )? (Is not valid?)

Procedure: Test whether KB {} , answer yes if it does not

VALIDH

SATH

SATVALIDVALIDSATSATVALID

LL

exercise) :(proof LL

Decidable-Semi :Complexity

:Problem Decision

)resolution n(refutatio LLproof) (directLLLL

Problems Dual



Recursive Enumerable

Languages (RE)

Given: KB,

Decide: KB ├ ? (Is valid?)

Procedure: Test whether KB } , answer yes if it does

VALIDd

SATd

SATVALID

LL

Theorem)ess Incompletn Firsts Goedel'see - exercise :(proof LL

RE) (e Undecidabl :Complexity

:)ngsproblemEntscheidus (Hilbert'Problem Decision

LL

Problems Dual

Recursive

Languages

(REC)

HL

VALIDL VALIDL

LSAT

SATL L L complem. under closure

 

First-Order Satisfiability and Validity:

Undecidability and Semi-Decidability

Docsity.com

Summary Points

Previously: Logical Agents and Calculi, FOL in Practice

Today: Resolution Theorem Proving

Conjunctive Normal Form (clausal form)

Inference rule

Single-resolvent form

General form

Proof procedure: refutation

Decidability properties

FOL-SAT

FOL-NOT-SAT (language of unsatisfiable sentences; complement of FOL-SAT)

FOL-VALID

FOL-NOT-VALID

Next Week

More Prolog

Implementing unification

Docsity.com

Terminology

Properties of Knowledge Bases (KBs)

Satisfiability and validity

Entailment and provability

Properties of Proof Systems

Soundness and completeness

Decidability, semi-decidability, undecidability

Normal Forms: CNF, DNF, Horn; Clauses vs. Terms

Resolution

Refutation

Satisfiability, Validity

Unification

Docsity.com

Docsity is not optimized for the browser you're using. In order to have a better experience please switch to Google Chrome, Firefox, Internet Explorer 9+ or Safari! Download Google Chrome