ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.

Slides:



Advertisements
Similar presentations
Modelling with expert systems. Expert systems Modelling with expert systems Coaching modelling with expert systems Advantages and limitations of modelling.
Advertisements

ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Resolution
First-Order Logic ECE457 Applied Artificial Intelligence Spring 2007 Lecture #7.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Computer Engineering People. © Computer Engineering Department – KFUPMSlide 2 COE People Faculty Professors Associate Professors Assistant Professors.
1 5.0 Expert Systems Outline 5.1 Introduction 5.2 Rules for Knowledge Representation 5.3 Types of rules 5.4 Rule-based systems 5.5 Reasoning approaches.
3 Logic Translate the following four English sentences to first order logic (FOL). [4p] 1. Anyone passing his history exams and winning the lottery is.
1 McGraw-Hill/Irwin Copyright © 2004, The McGraw-Hill Companies, Inc. All rights reserved. Chapter 8: Decision Support Systems Decision Support in Business.
IST DEVELOPMENT IN LATVIA
What is Computer Science?
Formal Aspects of Computer Science – Week 12 RECAP Lee McCluskey, room 2/07
Propositional logic It represents real-world facts as logical propositions in well formed formulas. It presented as an atomic propositions, and complex.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Some Thoughts to Consider 6 What is the difference between Artificial Intelligence and Computer Science? What is the difference between Artificial Intelligence.
1 © Copyright 2010 Dieter Fensel and Florian Fischer Intelligent Systems Predicate Logic.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
1 USING EXPERT SYSTEMS TECHNOLOGY FOR STUDENT EVALUATION IN A WEB BASED EDUCATIONAL SYSTEM Ioannis Hatzilygeroudis, Panagiotis Chountis, Christos Giannoulis.
Artificial Intelligence Lecture No. 15 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM]
Welcome to Computer Science at Missouri S&T Daniel TauritzDan Lin Associate Professor Assistant Professor Margret A. Steele undergraduate.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
TECHNOLOGY GUIDE FOUR Intelligent Systems.
IDDS: Rules-based Expert Systems
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Tasks Task 41 Solve Exercise 12, Chapter 2.
KJC001 (sp2015.ppt – May 12, 2015) – Industry senior project presentation Industry-based Senior Project in the Department of Computer Science and Engineering.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Computing & Information Sciences Kansas State University Lecture 13 of 42 CIS 530 / 730 Artificial Intelligence Lecture 13 of 42 William H. Hsu Department.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM]
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
KU NLP Resolution Theorem Proving Resolution Theorem Proving q Introduction - Resolution Principle q Producing the Clause Form q
Intelligent Systems Predicate Logic. Outline Motivation Technical Solution – Syntax – Semantics – Inference Illustration by Larger Example Extensions.
M.Sc. and Ph.D. in Computational Science Department of Mathematics Faculty of Science Chulalongkorn University.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
First-Order Logic ECE457 Applied Artificial Intelligence Fall 2007 Lecture #7.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 05 : Knowledge Base & First Order Logic.
By: Nelson Webster. Algorithm Engineers Algorithm engineers study the effectiveness and efficiency of procedures of solving problems on a computer.
Of An Expert System.  Introduction  What is AI?  Intelligent in Human & Machine? What is Expert System? How are Expert System used? Elements of ES.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Resolution Theorem Proving in Predicate Calculus Lecture No 10 By Zahid Anwar.
1 Ch 17: Alternative Decision-Support Systems. 2 What is an expert system? ‘The modeling, within a computer, of expert knowledge in a given domain, such.
TECHNOLOGY GUIDE FOUR Intelligent Systems. TECHNOLOGY GUIDE OUTLINE TG4.1 Introduction to Intelligent Systems TG4.2 Expert Systems TG4.3 Neural Networks.
Artificial Intelligence Lecture No. 14 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Computing & Information Sciences Kansas State University Monday, 18 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 11 of 42 Monday, 18 September.
Electrical Engineering
Artificial Intelligence
Propositional Logic Session 3
MATLAB Fuzzy Logic Toolbox
TECHNOLOGY GUIDE FOUR Intelligent Systems.
The Hebrew University of Jerusalem
Fuzzy Logic and Approximate Reasoning
A computer program is a sequence of computer commands.
Tutorial - Propositional Logic
Industry-based Senior Project in the
CS62S: Expert Systems Based on:
النظم الخبيرة Expert Systems (ES)
CSE 4705 Artificial Intelligence
CSE 4705 Artificial Intelligence
TA : Mubarakah Otbi, Duaa al Ofi , Huda al Hakami
Knowledge Representation (Part I)
in Intelligent Tutoring Systems with Fuzzy Logic Techniques
RESOLUTION.
Architecture Issue in the New Disciple System
Developing an Intelligent User Assistant: Five Observations from CALO
Presentation transcript:

ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information Technology Institute of Applied Computer Systems Department of Systems Theory and Design APPLICATION OF RESOLUTION IN EXPERT SYSTEMS

User Interface KB Logical Sentences (necessarily true) Inference Engine Resolution Working Memory Application of Resolution in Expert Systems RESOLUTION (continued)

Application of Resolution in Expert Systems RESOLUTION (continued) Problem’s description 1.Anyone who is lucky wins the lottery. 2.Anyone who wins the lottery is happy. 3.At least one who is happy studies at the university. 4.Anyone who studies at the university can pass all his examinations. 5.Anyone who pass all his examinations graduates from the university.

Application of Resolution in Expert Systems RESOLUTION (continued) Logical Sentences 1.  X(lucky(X)  win(X, lottery)) 2.  X(win(X, lottery)  happy(X)) 3.  X(happy(X)  study(X)) 4.  X  Y(study(X)  pass(X, Y)) 5.  X  Y(pass(X, Y)  graduate(X))

Application of Resolution in Expert Systems RESOLUTION (continued) Facts 6. lucky(george) 7. pass(george, ml&ai)

Q: Does George graduate from the university? S1:  lucky(X)  win(X, lottery) S2:  win(X, lottery)  happy(X) S3:  happy(george)  study(george) S4:  study(X)  pass(X, Y) S5:  pass(X, Y)  graduate(X) S6: lucky(george) S7: pass(george, ml&ai) S8:  graduate(X) Application of Resolution in Expert Systems RESOLUTION (continued) User Interface KB Inference Engine Resolution Working Memory

S1 S2 S3 S4 S5  lucky(X)  win(X, lottery)  win(X, lottery)  happy(X) { }  lucky(X)  happy(X) S6 S7 S8 Application of Resolution in Expert Systems RESOLUTION (continued) User Interface KBInference Engine Resolution Working Memory

S1 S2 S3 S4 S5  lucky(X)  happy(X)  happy(george)  study(george) { george/X }  lucky(george)  study(george) S6 S7 S8  lucky(X)  happy(X) Application of Resolution in Expert Systems RESOLUTION (continued) User Interface KBInference Engine Resolution Working Memory

S1 S2 S3 S4 S5  lucky(george)  study(george)  study(X)  pass(X, Y) { george/X }  lucky(george)  pass(george, Y) S6 S7 S8  lucky(X)  happy(X)  lucky(george)  study(george) Application of Resolution in Expert Systems RESOLUTION (continued) User Interface KBInference Engine Resolution Working Memory

S1 S2 S3 S4 S5  lucky(george)  pass(george, Y)  pass(X, Y)  graduate(X) { george/X }  lucky(george)  graduate(george) S6 S7 S8  lucky(X)  happy(X)  lucky(george)  study(george)  lucky(george)  pass(george, Y) Application of Resolution in Expert Systems RESOLUTION (continued) User Interface KBInference Engine Resolution Working Memory

S1 S2 S3 S4 S5  lucky(george)  graduate(george) lucky(george) { } graduate(george) S6 S7 S8  lucky(X)  happy(X)  lucky(george)  study(george)  lucky(george)  pass(george, Y)  lucky(george)  graduate(george) User Interface KB Application of Resolution in Expert Systems RESOLUTION (continued) Inference Engine Resolution Working Memory

Application of Resolution in Expert Systems S1 S2 S3 S4 S5 graduate(george)  graduate(george) { } Contradiction! S6 S7 S8  lucky(X)  happy(X)  lucky(george)  study(george)  lucky(george)  pass(george, Y)  lucky(george)  graduate(george) graduate(george) RESOLUTION (continued) Inference Engine Resolution Working Memory User Interface KB

Conclusion: George graduates from the university S1 S2 S3 S4 S5 Application of Resolution in Expert Systems RESOLUTION (continued) User Interface KB Inference Engine Resolution Working Memory