Artificial Intelligence

Slides:



Advertisements
Similar presentations
Classroom Bill of Rights
Advertisements

Inference in First-Order Logic
Artificial Intelligence 8. The Resolution Method
Resolution Proof System for First Order Logic
Reagan/Clinton Compare/Contrast Essay. I. Reagan and Clinton both argue... but... A.Reagan argues B.Clinton argues.
Inference Rules Universal Instantiation Existential Generalization
Knowledge & Reasoning Logical Reasoning: to have a computer automatically perform deduction or prove theorems Knowledge Representations: modern ways of.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 10– Club and Circuit Examples.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 06 : First Order Logic Resolution Prove.
ITCS 3153 Artificial Intelligence Lecture 15 First-Order Logic Chapter 9 Lecture 15 First-Order Logic Chapter 9.
Artificial Intelligence University Politehnica of Bucharest Adina Magda Florea
Automated Reasoning Systems For first order Predicate Logic.
1 Logic Programming School of Informatics, University of Edinburgh Transformations Specification-Program An introduction to moving between Prolog and First.
First Order Logic Resolution
Artificial Intelligence Inference in first-order logic Fall 2008 professor: Luigi Ceccaroni.
For Friday No reading Homework: –Chapter 9, exercise 4 (This is VERY short – do it while you’re running your tests) Make sure you keep variables and constants.
Logic Use mathematical deduction to derive new knowledge.
F22H1 Logic and Proof Week 7 Clausal Form and Resolution.
Artificial Intelligence Chapter 14. Resolution in the Propositional Calculus Artificial Intelligence Chapter 14. Resolution in the Propositional Calculus.
Prolog IV Logic, condensed. 2 Propositional logic Propositional logic consists of: The logical values true and false ( T and F ) Propositions: “Sentences,”
1 Applied Computer Science II Resolution in FOL Luc De Raedt.
Logic Programming Languages. Objective To introduce the concepts of logic programming and logic programming languages To introduce a brief description.
Inference and Resolution for Problem Solving
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
Artificial Intelligence
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
CS1502 Formal Methods in Computer Science Lecture Notes 10 Resolution and Horn Sentences.
INFERENCE IN FIRST-ORDER LOGIC IES 503 ARTIFICIAL INTELLIGENCE İPEK SÜĞÜT.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
Proof Systems KB |- Q iff there is a sequence of wffs D1,..., Dn such that Dn is Q and for each Di in the sequence: a) either Di is in KB or b) Di can.
Conjunctive normal form: any formula of the predicate calculus can be transformed into a conjunctive normal form. Def. A formula is said to be in conjunctive.
1 Chapter 8 Inference and Resolution for Problem Solving.
Declarative vs Procedural Programming  Procedural programming requires that – the programmer tell the computer what to do. That is, how to get the output.
Notes on Assignment 3 Foundations of Artificial Intelligence.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Homework #3-1: predicate logic (20%)
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
The AI War LISP and Prolog Basic Concepts of Logic Programming
Dr. Muhammed Al-Mulhem ICS An Introduction to Logical Programming.
Computing & Information Sciences Kansas State University Lecture 14 of 42 CIS 530 / 730 Artificial Intelligence Lecture 14 of 42 William H. Hsu Department.
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
CPSC 386 Artificial Intelligence Ellen Walker Hiram College
603 Database Systems Senior Lecturer: Laurie Webster II, M.S.S.E.,M.S.E.E., M.S.BME, Ph.D., P.E. Lecture 25 A First Course in Database Systems.
C. Varela1 Logic Programming (PLP 11) Predicate Calculus, Horn Clauses, Clocksin-Mellish Procedure Carlos Varela Rennselaer Polytechnic Institute November.
Reasoning using First-Order Logic
Propositional Logic Predicate Logic
1 Knowledge Based Systems (CM0377) Lecture 6 (last modified 20th February 2002)
1-1 An Introduction to Logical Programming Sept
Instructor: Eyal Amir Grad TAs: Wen Pu, Yonatan Bisk Undergrad TAs: Sam Johnson, Nikhil Johri CS 440 / ECE 448 Introduction to Artificial Intelligence.
Resolution Theorem Proving in Predicate Calculus Lecture No 10 By Zahid Anwar.
Answer Extraction To use resolution to answer questions, for example a query of the form  X C(X), we must keep track of the substitutions made during.
Instructor: Eyal Amir Grad TAs: Wen Pu, Yonatan Bisk Undergrad TAs: Sam Johnson, Nikhil Johri CS 440 / ECE 448 Introduction to Artificial Intelligence.
ПОРТФОЛИО профессиональной деятельности Белово 2015 Таюшовой Натальи Борисовны Преподавателя дисциплин «Химия», «Биология»
CS621: Artificial Intelligence
3. The Logic of Quantified Statements Summary
Introduction to Logic for Artificial Intelligence Lecture 2
Logic Programming Languages
Logic Use mathematical deduction to derive new knowledge.
Biointelligence Lab School of Computer Sci. & Eng.
Carlos Varela Rensselaer Polytechnic Institute November 10, 2017
(1.4) An Introduction to Logic
Prolog IV Logic, condensed.
Back to “Serious” Topics…
Biointelligence Lab School of Computer Sci. & Eng.
CSNB234 ARTIFICIAL INTELLIGENCE
RESOLUTION.
CS621: Artificial Intelligence
Resolution Proof System for First Order Logic
I  Linear and Logical Pulse II  Instruments Standard Ch 17 GK I  Linear and Logical Pulse II  Instruments Standard III  Application.
Carlos Varela Rennselaer Polytechnic Institute August 30, 2007
Presentation transcript:

Artificial Intelligence Lecture 5

Clause Is a representation of facts where different literals have disjunctive relation Typesground clause and horn clause Ground clausewithout any variable Example a() Horn clause at most one positive clause Examplea(x,y)

Considerations for clauses A given relation can have any number of objects A predicate can have any number of arguments including zero. Number of arguments  arity An object name can represent a physical entity(Bob,automobile)/an abstract concept(defective) Can be noun , adverb or adjective Objects must be singular Names reserved for prolog should not be used as object name

Steps for converting propositional logic to causal form

Steps for conversion in elaborated form

Steps for conversion in elaborated form(Cont..)

Steps for conversion in elaborated form(Cont..)

Skolemisation Is the process of eliminating existential quantifier Steps of skolemisation

Resolution Is the process of proving theorem based on some clauses

Types of resolution Unit resolution Binary resolution Linear resolution

Definition of different types of resolution

Algorithm on Resolution

Example 1. Ravi likes all kind of food. 2. Apples and chicken are food 3. Anything anyone eats and is not killed is food 4. Ajay eats peanuts and is still alive 5. Rita eats everything that Ajay eats Prove that Ravi likes peanuts using resolution.

Step 1: Converting the given statements into Predicate/Propositional Logic i. ∀x : food(x) → likes (Ravi, x) ii. food (Apple) ^ food (chicken) iii. ∀a : ∀b: eats (a, b) ^ ~ killed (a) → food (b) iv. eats (Ajay, Peanuts) ^ alive (Ajay) v. ∀c : eats (Ajay, c) → eats (Rita, c) vi. ∀d : alive(d) → ~killed (d) vii. ∀e: ~killed(e) → alive(e) Conclusion: likes (Ravi, Peanuts)

Step 2: Convert into Clausal form i. ~food(x) v likes (Ravi, x) ii. Food (apple) iii. Food (chicken) iv. ~ eats (a, b) v killed (a) v food (b) v. Eats (Ajay, Peanuts) vi. Alive (Ajay) vii. ~eats (Ajay, c) V eats (Rita, c) viii. ~alive (d) v ~ killed (d) ix. Killed (e) v alive (e)

Step 3: Negate the conclusion ~ likes (Ravi, Peanuts)

Step 4: Resolve using a resolution tree