Artificial Intelligence CSC 361
|
|
- Andra Bond
- 6 years ago
- Views:
Transcription
1 Artificial Intelligence CSC 361 Prof. Mohamed Batouche Computer Science Department CCIS King Saud University Riyadh, Saudi Arabia
2 Intelligent Systems Part I: Expert Systems
3 Developing Intelligent Program Systems Two main approaches for problem solving using knowledge: Symbolic Approach Expert systems: Feed the system with knowledge. There is no learning!! Connectionist Approach Neural Networks: The system learns from examples by itself.
4 Symbolic Approach
5 Developing Intelligent Program Systems Expert system expert system (or knowledge-based system): a program which encapsulates knowledge from some domain, normally obtained from a human expert in that domain an expert system can, to a certain extent, act as a substitute for the expert from whom the knowledge was taken. Attempt to Imitate Expert Reasoning Processes and Knowledge in Solving Specific Problems Expert Systems Do Not Replace Experts, But They Make their Knowledge and Experience More Widely Available Permit Nonexperts to Work Better ES acts as a Consultant or Advisor
6 Developing Intelligent Program Systems Objective and Activities of an Expert System Objective of an expert system To transfer expertise from an expert to a computer system and Then on to other humans (nonexperts) Activities Knowledge acquisition Knowledge representation Knowledge inferencing Knowledge transfer to the user Knowledge is stored in a knowledge base
7 Developing Intelligent Program Systems Inferencing Reasoning (Thinking) The computer is programmed so that it can make inferences Performed by the Inference Engine
8 Developing Intelligent Program Systems : Expert System Major Components Knowledge base (KB): repository of rules, facts (productions) working memory: (if forward chaining used) inference engine: the deduction system used to infer results from user input and KB user interface: interfaces with user external control + monitoring: access external databases, control,... User Interface Inference Engine Knowledge Base
9 Developing Intelligent Program Systems : Expert System Knowledge base The knowledge base contains the knowledge necessary for understanding, formulating, and solving problems Two Basic Knowledge Base Elements Facts Special heuristics, or rules that direct the use of knowledge User Interface Inference Engine Knowledge Base Knowledge is the primary raw material of ES Incorporated knowledge representation
10 Developing Intelligent Program Systems : Expert System Inference Engine The brain of the ES The control structure (rule interpreter) User Interface Inference Engine Knowledge Base Provides methodology for reasoning
11 Developing Intelligent Program Systems : Expert System User Interface Language processor for friendly, problem-oriented communication Natural Language Processing, or menus and graphics User Interface Inference Engine Knowledge Base
12 Developing Intelligent Program Systems : Expert System Working Memory (Blackboard) Area of working memory to Describe the current problem Record Intermediate results Records Intermediate Hypotheses and Decisions 1. Plan 2. Agenda 3. Solution User Interface Inference Engine Knowledge Base
13 Developing Intelligent Program Systems : Expert System Explanation Subsystem (Justifier) Area of working memory to Traces responsibility and explains the ES behavior by interactively answering questions: -Why? -How? -What? -(Where? When? Who?) User Interface Inference Engine Knowledge Base
14 Developing Intelligent Program Systems : Expert System The Human Element in Expert Systems Expert Knowledge Engineer User Others
15 Developing Intelligent Program Systems : Expert System Expert Has the special knowledge, judgment, experience and methods to give advice and solve problems Provides knowledge about task performance
16 Developing Intelligent Program Systems : Expert System Knowledge Engineer Helps the expert(s) structure the problem area by interpreting and integrating human answers to questions, drawing analogies, posing counterexamples, and bringing to light conceptual difficulties Usually also the System Builder
17 Developing Intelligent Program Systems : Expert System User Possible Classes of Users A non-expert client seeking direct advice (ES acts as a Consultant or Advisor) A student who wants to learn (Instructor) An ES builder improving or increasing the knowledge base (Partner) An expert (Colleague or Assistant) The Expert and the Knowledge Engineer Should Anticipate Users' Needs and Limitations When Designing ES
18 Expert System in Depth Expert System Architecture Knowledge Base Inference Engine
19 Architecture of an Expert System
20 Knowledge base: production System Knowledge is represented using rules of the form : Rule: if Conditions then Conclusions or Rule: if Premises then Actions or Rule: if if-part then then-part A rule as described above is often referred to as a production rule Example: if symptom1 and symptom2 and symptom3 then disease1
21 Knowledge base: production System Other examples: if - the leaves are dry, brittle and discoloured then - the plant has been attacked by red spider mite If it is raining then you should take an umbrella if - the customer closes the account then - delete the customer from the database
22 Inference Engine: Rule-based reasoning The essence of a rule-based reasoning system is that it goes through a series of cycles. In each cycle, it attempts to pick an appropriate rule from its collection of rules, depending on the present circumstances, and to use it. Because using a rule produces new information, it's possible for each new cycle to take the reasoning process further than the cycle before. This is rather like a human following a chain of ideas in order to come to a conclusion.
23 Inference Engine: Forward Chaining Forward Chaining is based on Modus Ponens inference rule: (A, A B ) / B In other words, if A is true and we have A B then we can deduce that B is true In the context of Expert System, it is used as follows: if A is in WM and we have a rule in KB of the form if A then B then we can deduce B (add B to WM as new information)
24 Inference Engine: Forward Chaining Do until problem is solved or no antecedents match Collect the rules whose antecedents are found in WM. If more than one rule matches use conflict resolution strategy to eliminate all but one Do actions indicated in by rule fired Cycles
25 Inference Engine: Forward Chaining Matching Rules filtering Conflict Resolution Rules Rule For Conflict Resolution we can use ruleorder as an implied priority Cycles Execution Apply the rule Add Then-Part to WM
26 Inference Engine: Forward Chaining Algorithm: 1. Match WM with KB to select production rules 2. Eliminate already applied rules 3. If many rules select one which has the smallest number 4. Apply selected rule by adding its conclusion to WM 5. If the problem is solved or no new information added then stop otherwise go to step 1 Matching Rules filtering Conflict Resolution Execution Apply the rule Rules Rule Add Then-Part to WM
27 Inference Engine: Forward Chaining Knowledge Base: Inference Engine: Execute many cycles Rule 1: If A and B and C then D Rule 2: if B and C then G Rule 3: if B and D then F Rule 4: if B and C and D then E Rule 5: if A and B then C Rule 6: if G and D then Z Working Memory: A, B
28 Inference Engine: Forward Chaining Knowledge Base: Rule 1: If A and B and C then D Rule 2: if B and C then G Rule 3: if B and D then F Rule 4: if B and C and D then E Rule 5: if A and B then C Rule 6: if G and D then Z Inference Engine: Execute many cycles Cycle 1: Rule 5 add C Working Memory: A, B, C
29 Inference Engine: Forward Chaining Knowledge Base: Rule 1: If A and B and C then D Rule 2: if B and C then G Rule 3: if B and D then F Rule 4: if B and C and D then E Rule 5: if A and B then C Rule 6: if G and D then Z Inference Engine: Execute many cycles Cycle 1: Rule 5 add C Cycle 2: Rule 5, Rule 1, Rule 2 add D Working Memory: A, B, C, D
30 Inference Engine: Forward Chaining Knowledge Base: Rule 1: If A and B and C then D Rule 2: if B and C then G Rule 3: if B and D then F Rule 4: if B and C and D then E Rule 5: if A and B then C Rule 6: if G and D then Z Inference Engine: Execute many cycles Cycle 1: Rule 5 add C Cycle 2: Rule 5, Rule 1, Rule 2 add D Cycle 3: Rule 1, Rule 2, R 3, R 4, Rule 5 add G Working Memory: A, B, C, D, G
31 Inference Engine: Forward Chaining Knowledge Base: Rule 1: If A and B and C then D Rule 2: if B and C then G Rule 3: if B and D then F Rule 4: if B and C and D then E Rule 5: if A and B then C Rule 6: if G and D then Z Inference Engine: Execute many cycles Cycle 1: Rule 5 add C Cycle 2: Rule 5, Rule 1, Rule 2 add D Cycle 3: Rule 1, Rule 2, R3, R 4, Rule 5 add G Cycle 4: Rule 1, Rule 2, Rule 3, Rule 4, Rule 5, Rule 6 add F Working Memory: A, B, C, D, G, F
32 Inference Engine: Forward Chaining Knowledge Base: Rule 1: If A and B and C then D Rule 2: if B and C then G Rule 3: if B and D then F Rule 4: if B and C and D then E Rule 5: if A and B then C Rule 6: if G and D then Z Inference Engine: Execute many cycles Cycle 1: Rule 5 add C Cycle 2: Rule 5, Rule 1, Rule 2 add D Cylce 3: Rule 1, Rule 2, Rule 3, Rule 5 add G Cycle 4: Rule 1, Rule 2, Rule 3, Rule 4, Rule 5, Rule 6 add F Cylce 5: Rule 1, Rule 2, Rule 3, Rule 4, Rule 5, Rule 6 add E Working Memory: A, B, C, D, G, F, E
33 Inference Engine: Forward Chaining Knowledge Base: Rule 1: If A and B and C then D Rule 2: if B and C then G Rule 3: if B and D then F Rule 4: if B and C and D then E Rule 5: if A and B then C Rule 6: if G and D then Z Working Memory: A, B, C, D, G, F, E, Z Inference Engine: Execute many cycles Cycle 1: Rule 5 add C Cycle 2: Rule 5, Rule 1, Rule 2 add D Cylce 3: Rule 1, Rule 2, Rule 3, Rule 5 add G Cycle 4: Rule 1, Rule 2, Rule 3, Rule 4, Rule 5, Rule 6 add F Cylce 5: Rule 1, Rule 2, Rule 3, Rule 4, Rule 5, Rule 6 add E Cylce 6: Rule 1, Rule 2, Rule 3, Rule 4, Rule 5, Rule 6 add Z
34 Inference Engine: Forward Chaining Knowledge Base: Rule 1: If A and B and C then D Rule 2: if B and C then G Rule 3: if B and D then F Rule 4: if B and C and D then E Rule 5: if A and B then C Rule 6: if G and D then Z Inference Engine: Execute many cycles Cycle 1: Rule 5 add C Cycle 2:Rule 1, Rule 2, Rule 5 add D Cylce 3: Rule 1, Rule 2, Rule 3, Rule 5 add G Cycle 4: Rule 1, Rule 2, Rule 3, Rule 4, Rule 5, Rule 6 add F Cylce 5: Rule 1, Rule 2, Rule 3, Rule 4, Rule 5, Rule 6 add E Cylce 6: Rule 1, Rule 2, Rule 3, Rule 4, Rule 5, Rule 6 add Z Cycle 7: Rule 1, Rule 2, Rule 3, Rule 4, Rule 5, Rule 6 no rule => STOP!!! Working Memory: A, B, C, D, G, F, E, Z
35 Inference Engine: Backward Chaining Backward Chaining is based on Modus Tollens inference rule: ( B, A B ) / A If A implies B, and B is false, then A is false In other words, if we have A B then proving B is equivalent of proving A In the context of Expert System, it is used as follows: To prove a goal B which is not in WM and if we have a rule in KB of the form if A then B then we have just to prove A (A is either present in WM or it exists a rule with A as a conclusion)
36 Inference Engine: Backward Chaining Consider the following KB and WM: Knowledge Base: Rule 1: If A and B and C then D Rule 2: if B and C then G Rule 3: if B and D then F Rule 4: if B and C and D then E Rule 5: if A and B then C Rule 6: if G and D then Z Working Memory: A, B Inference Engine: Exploration of AND/OR Tree: Suppose we have the goal: G To prove G, one can use Rule 2 Proving G is equivalent of proving B and C As B is present in the WM so it s true So remains the proof of C, one can use Rule 5 Proving C is equivalent of proving A and B As A and B are present in WM (true), we can deduce that C is true B and C are true then G is true
37 Conclusions Expert System Why use expert systems: commercial viability: whereas there may be only a few experts whose time is expensive and rare, you can have many expert systems expert systems can be used anywhere, anytime expert systems can explain their line of reasoning commercially beneficial: the first commercial product of AI Weaknesses: expert systems are as sound as their KB; errors in rules mean errors in diagnoses automatic error correction, learning is difficult the extraction of knowledge from an expert, and encoding it into machineinferable form is the most difficult part of expert system implementation
Deduction Rule System vs Production Rule System. Prof. Bob Berwick. Rules Rule
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.034 Artificial Intelligence, Fall 2003 Recitation 2, September 11/12 Rules Rule Prof. Bob Berwick Agenda
More informationRule-Based Systems. Reasoning Systems. Rule-Based Systems: early history. Rule-Based Systems
Reasoning Systems In this part of the module we take a broad look at a variety of techniques for creating reasoning systems. These are traditional AI techniques that are successfully used in modern applications.
More informationTHE LOGIC OF QUANTIFIED STATEMENTS
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 3.4 Arguments with Quantified Statements Copyright Cengage Learning. All rights reserved. Arguments
More informationArtificial Intelligence Notes Lecture : Propositional Logic and Inference
Page 1 of 7 Introduction Artificial Intelligence Notes Lecture : Propositional Logic and Inference Logic is a natural bridge between man and machine. This is because: Logic is well-defined, which makes
More informationLecture Outline. Rule Based Systems. Production Systems. Production Systems. Production Systems. Production Systems
Lecture Outline Rule Based Systems Michael J. Watts http://mike.watts.net.nz Production systems Facts & Templates Production rules The inference process Advantages of production systems Disadvantages of
More informationTransactions on Information and Communications Technologies vol 20, 1998 WIT Press, ISSN
APPLYING SQL TECHNIQUES ON INFERENCE MECHANISMS OF EXPERT SYSTEMS George DOBRE, Cosmin GRIGORESCU, Dorin CARSTOIU, Simona GRIGORESCU Department of Machine Elements and Tribology and Department of Computers
More informationCSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
is another way of showing that an argument is correct. Definitions: Literal: A variable or a negation of a variable is called a literal. Sum and Product: A disjunction of literals is called a sum and a
More informationCS 416, Artificial Intelligence Midterm Examination Fall 2004
CS 416, Artificial Intelligence Midterm Examination Fall 2004 Name: This is a closed book, closed note exam. All questions and subquestions are equally weighted. Introductory Material 1) True or False:
More informationCS 380/480 Foundations of Artificial Intelligence Winter 2007 Assignment 2 Solutions to Selected Problems
CS 380/480 Foundations of Artificial Intelligence Winter 2007 Assignment 2 Solutions to Selected Problems 1. Search trees for the state-space graph given below: We only show the search trees corresponding
More informationExpert Systems Knowledge Based Systems
Expert Systems Knowledge Based Systems ES-1 Medical diagnosis» Disease identification Example Areas of Use ES-2 Example Areas of Use 2 Medical diagnosis» Disease identification Natural resource exploration»
More informationIntroduction to predicate calculus
Logic Programming Languages Logic programming systems allow the programmer to state a collection of axioms from which theorems can be proven. Express programs in a form of symbolic logic Use a logical
More informationCase-Based Reasoning
0/0/ Case-Based Reasoning In this lecture, we turn to another popular form of reasoning system: case based reasoning (CBR) Unlike Rule-based systems and Fuzzy Logic, CBR does not use any rules or logical
More informationAutomated Reasoning PROLOG and Automated Reasoning 13.4 Further Issues in Automated Reasoning 13.5 Epilogue and References 13.
13 Automated Reasoning 13.0 Introduction to Weak Methods in Theorem Proving 13.1 The General Problem Solver and Difference Tables 13.2 Resolution Theorem Proving 13.3 PROLOG and Automated Reasoning 13.4
More informationSection 2.4: Arguments with Quantified Statements
Section 2.4: Arguments with Quantified Statements In this section, we shall generalize the ideas we developed in Section 1.3 to arguments which involve quantified statements. Most of the concepts we shall
More informationEXPERT SYSTEMS. Chapter 7. Asfia Rahman
1 EXPERT SYSTEMS Chapter 7 2 SYLLABUS CONTENT Candidates should be able to: 1. describe the components of an expert system 2. explain how the components of an expert system produce possible solutions 3.
More informationApplying AI in Application Security
FEATURE Applying AI in Application Security Do you have something to say about this article? Visit the Journal pages of the ISACA website (www.isaca. org/journal), find the article and click on the Comments
More informationPAGE - 16 PAGE - 1. Sometimes, the solution is just a benchmark away..
PAGE - 16 PAGE - 1 Sometimes, the solution is just a benchmark away.. Post Box 301532, Riyadh 11372, Kingdom Of Saudi Arabia. Tel: +966 1 229 1819 Fax: +966 1 229 1801 PAGE - 2 PAGE - 3 The base of automation
More informationBuilding Knowledge Models Using KSM
Building Knowledge Models Using KSM Jose Cuena, Martin Molina Department of Artificial Intelligence, Technical University of Madrid, Campus de Montegancedo S/N, Boadilla del Monte 28660, Madrid, SPAIN
More informationKnowledge Representation. Dr. Asaad Sabah Hadi
Knowledge Representation Dr. Asaad Sabah Hadi 1 Knowledge Knowledge is a collection of specialized facts, procedures and judgment rules High Degree of Abstraction Knowledge Information Low Data Quantity
More informationType Inference Systems. Type Judgments. Deriving a Type Judgment. Deriving a Judgment. Hypothetical Type Judgments CS412/CS413
Type Inference Systems CS412/CS413 Introduction to Compilers Tim Teitelbaum Type inference systems define types for all legal programs in a language Type inference systems are to type-checking: As regular
More informationBuilding Control Algorithm for State Space Search
Building Control Algorithm for State Space Search SCJ3553 Ar9ficial Intelligence Faculty of Computer Science and Informa9on Systems Universi9 Teknologi Malaysia Outline Recursion- based system Produc9on
More informationIntelligent Agent based Mapping of Software Requirement Specification to Design Model
Intelligent Agent based Mapping of Software Requirement Specification to Design Model Emdad Khan College of Computer and Information Sciences Al-Imam Muhammad Ibn Saud Islamic University Riyadh, Saudi
More informationAN AGENT-BASED CONFLICT MANAGEMENT SYSTEM FOR CO-OPERATIVE DESIGN ENVIRONMENT
AN AGENT-BASED CONFLICT MANAGEMENT SYSTEM FOR CO-OPERATIVE DESIGN ENVIRONMENT A Gayretli BSc MSc PhD and S Kucukgokoglan BSc MPhil School of Mech., Mat., Manu. Eng. and Management, The University of Nottingham,
More informationTutorial 1 Answers. Question 1
Tutorial 1 Answers Question 1 Complexity Software in it what is has to do, is often essentially complex. We can think of software which is accidentally complex such as a large scale e-commerce system (simple
More informationSTIN2103. Knowledge. engineering expert systems. Wan Hussain Wan Ishak. SOC 2079 Ext.: Url:
& Knowledge STIN2103 engineering expert systems Wan Hussain Wan Ishak SOC 2079 Ext.: 4786 Email: hussain@uum.edu.my Url: http://www.wanhussain.com Outline System Design System architecture and conceptual
More informationNotes for Chapter 12 Logic Programming. The AI War Basic Concepts of Logic Programming Prolog Review questions
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions The AI War How machines should learn: inductive or deductive? Deductive: Expert => rules =>
More informationHigher Order Refinement Heuristics for Rule Validation
From: FLAIRS-02 Proceedings. Copyright 2002, AAAI (www.aaai.org). All rights reserved. Higher Order Refinement Heuristics for Rule Validation Hans - Werner Kelbassa Email: kelbassa@uni-paderborn.de Abstract
More informationKnowledge Representation. CS 486/686: Introduction to Artificial Intelligence
Knowledge Representation CS 486/686: Introduction to Artificial Intelligence 1 Outline Knowledge-based agents Logics in general Propositional Logic& Reasoning First Order Logic 2 Introduction So far we
More informationCPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements
CPSC 121: Models of Computation Module 6: Rewriting predicate logic statements Module 6: Rewriting predicate logic statements Pre-class quiz #7 is due March 1st at 19:00. Assigned reading for the quiz:
More informationKnowledge Based Agents: KB-CAD Integration. Presented To: Dr. Ahmed Rafea Presented By Ramy Ibrahim
Knowledge Based Agents: KB-CAD Integration Presented To: Dr. Ahmed Rafea Presented By Ramy Ibrahim Introduction CAD (Computer Aided Design). computer-based tools that assist engineers, architects and other
More informationGrad AI Fall, 2007 Homework 1
Grad AI. 15-780 Fall, 2007 Homework 1 Homework deadline: 10:30am on October 4 Please print your code and hand it in with the hard copy of your homework. Also send a copy of your code by e-mail to both
More informationIntroduction to Rule-Based Systems. Using a set of assertions, which collectively form the working memory, and a set of
Introduction to Rule-Based Systems Using a set of assertions, which collectively form the working memory, and a set of rules that specify how to act on the assertion set, a rule-based system can be created.
More informationSTAT 598L Probabilistic Graphical Models. Instructor: Sergey Kirshner. Exact Inference
STAT 598L Probabilistic Graphical Models Instructor: Sergey Kirshner Exact Inference What To Do With Bayesian/Markov Network? Compact representation of a complex model, but Goal: efficient extraction of
More informationThe inference mechanism for expert system categorizing airborne objects
The inference mechanism for expert system categorizing airborne objects Jakub Novak a a Ing. Jakub Novak, Faculty of Military Technology, University of Defence, Ph.D. student, Brno, Czech Republic. E-mail:
More informationProlog Introduction. Gunnar Gotshalks PI-1
Prolog Introduction PI-1 Physical Symbol System Hypothesis A physical symbol system has the necessary and sufficient means for general intelligent action. Allen Newell and Herbert A. Simon PI-2 Physical
More informationNeural Networks Lesson 9 - Fuzzy Logic
Neural Networks Lesson 9 - Prof. Michele Scarpiniti INFOCOM Dpt. - Sapienza University of Rome http://ispac.ing.uniroma1.it/scarpiniti/index.htm michele.scarpiniti@uniroma1.it Rome, 26 November 2009 M.
More informationIteration and Loop Invariants
Iteration and Loop Invariants Murali Sitaraman (Clemson) Bruce W. Weide (Ohio State) RESOLVE/Reusable Software Research Group http://www.cs.clemson.edu/group/resolve http://cse.osu.edu/rsrg We gratefully
More informationOracle Database 12c Performance Management and Tuning
Course Code: OC12CPMT Vendor: Oracle Course Overview Duration: 5 RRP: POA Oracle Database 12c Performance Management and Tuning Overview In the Oracle Database 12c: Performance Management and Tuning course,
More informationLogical reasoning systems
Logical reasoning systems Theorem provers and logic programming languages Production systems Frame systems and semantic networks Description logic systems CS 561, Session 19 1 Logical reasoning systems
More informationProving Theorems with Athena
Proving Theorems with Athena David R. Musser Aytekin Vargun August 28, 2003, revised January 26, 2005 Contents 1 Introduction 1 2 Proofs about order relations 2 3 Proofs about natural numbers 7 3.1 Term
More informationA Knowledge-Based System for Construction Site Level Facilities Layout
This is the Pre-Published Version Lecture Notes in Artificial Intelligence, Vol. 2358, 2002, pp. 393-402 A Knowledge-Based System for Construction Site Level Facilities Layout K.W. Chau 1 and M. Anson
More informationLECTURE 11: ARGUMENTATION. An Introduction to Multiagent Systems CISC 7412, Fall 2011
LECTURE 11: ARGUMENTATION CISC 7412, Fall 2011 Today Last week we looked at negotiation. Mechanisms for getting agents to decide how to divide resources. This week we ll look at another approach to agreement.
More informationREAL TIME EXPERT SYSTEM FOR POWER PLANT
REAL TIME EXPERT SYSTEM FOR POWER PLANT OVERVIEW 1. Present System Shortfalls 2. Objective 3. Architecture Of Expert System 4. Expert System Software Details 5. Expert System Benefits & Constraints COLLABORATION
More informationKnowledge Representation: Production Systems II
Knowledge Representation: Production Systems II References: Rich and Knight, Artificial Intelligence, 2nd ed. McGraw-Hill, 1991 Russell and Norvig, Artificial Intelligence: A modern approach, 2nd ed. Prentice
More informationTypes of Expert System: Comparative Study
Types of Expert System: Comparative Study Viral Nagori, Bhushan Trivedi GLS Institute of Computer Technology (MCA), India Email: viral011 {at} yahoo.com ABSTRACT--- The paper describes the different classifications
More informationThomas Jefferson High School for Science and Technology Program of Studies TJ Math 1
Course Description: This course is designed for students who have successfully completed the standards for Honors Algebra I. Students will study geometric topics in depth, with a focus on building critical
More informationSTABILITY AND PARADOX IN ALGORITHMIC LOGIC
STABILITY AND PARADOX IN ALGORITHMIC LOGIC WAYNE AITKEN, JEFFREY A. BARRETT Abstract. Algorithmic logic is the logic of basic statements concerning algorithms and the algorithmic rules of deduction between
More informationSUGGESTED SOLUTION IPCC MAY 2017EXAM. Test Code - I M J
SUGGESTED SOLUTION IPCC MAY 2017EXAM INFORMATION TECHNOLOGY Test Code - I M J 7 1 2 1 BRANCH - (MULTIPLE) (Date : 20.11.2016) Head Office : Shraddha, 3 rd Floor, Near Chinai College, Andheri (E), Mumbai
More informationCPS331 Lecture: Rule-Based Systems last revised January 17, 2012
CPS331 Lecture: Rule-Based Systems last revised January 17, 2012 Objectives: 1. To introduce condition-action rules 2. To introduce forward and backward chaining Materials: 1. Projectable of Cawsey figure
More informationLecture 7: January 15, 2014
32002: AI (First order Predicate Logic, Syntax and Semantics) Spring 2014 Lecturer: K.R. Chowdhary Lecture 7: January 15, 2014 : Professor of CS (GF) Disclaimer: These notes have not been subjected to
More informationSolutions to In-Class Problems Week 1, Fri
Massachusetts Institute of Technology 6.042J/18.062J, Fall 02: Mathematics for Computer Science Professor Albert Meyer and Dr. Radhika Nagpal Solutions to In-Class Problems Week 1, Fri Problem 1. Translate
More informationRefinement Strategies for Inductive Learning Of Simple Prolog Programs
Refinement Strategies for Inductive Learning Of Simple Prolog Programs Marc Kirschenbaum Mathematics & Computer Science Dept. John Carroll Univesity Cleveland, Ohio 44118 U.S.A. Leon S. Sterling Computer
More informationConstraint Processing Offers Improved Expressiveness and Inference for Interactive Expert Systems
Constraint Processing Offers Improved Expressiveness and Inference for Interactive Expert Systems James Bowen Cork Constraint Computation Centre UCC, Cork, Ireland Email: j.bowen@4c.ucc.ie Abstract. Expert
More informationARTIFICIAL INTELLIGENCE (CS 370D)
Princess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) (CHAPTER-7) LOGICAL AGENTS Outline Agent Case (Wumpus world) Knowledge-Representation Logic in general
More informationRecall from last time. Lecture 4: Wrap-up of Bayes net representation. Markov networks. Markov blanket. Isolating a node
Recall from last time Lecture 4: Wrap-up of Bayes net representation. Markov networks Markov blanket, moral graph Independence maps and perfect maps Undirected graphical models (Markov networks) A Bayes
More informationproof through refutation
Prolog's logic; resolution grammars & parsing 1 proof through refutation we saw that Prolog uses the strategy: test the claim that a query is false by (1) finding it is immediately true (matches a fact
More informationData Mining. 3.3 Rule-Based Classification. Fall Instructor: Dr. Masoud Yaghini. Rule-Based Classification
Data Mining 3.3 Fall 2008 Instructor: Dr. Masoud Yaghini Outline Using IF-THEN Rules for Classification Rules With Exceptions Rule Extraction from a Decision Tree 1R Algorithm Sequential Covering Algorithms
More information9. Lecture Neural Networks
Soft Control (AT 3, RMA) 9. Lecture Neural Networks Application in Automation Engineering Outline of the lecture 1. Introduction to Soft Control: definition and limitations, basics of "smart" systems 2.
More informationLearning Fuzzy Rules Using Ant Colony Optimization Algorithms 1
Learning Fuzzy Rules Using Ant Colony Optimization Algorithms 1 Jorge Casillas, Oscar Cordón, Francisco Herrera Department of Computer Science and Artificial Intelligence, University of Granada, E-18071
More informationA Novel Web based Expert System Architecture for On-line and Off-line Fault Diagnosis and Control (FDC) of Transformers
A Novel Web based Expert System Architecture for On-line and Off-line Fault Diagnosis and Control (FDC) of Transformers by Babita Jain M, MB Srinivas, Amit Jain in TENCON 2008-2008, TENCON 2008 IEEE Region
More informationInf2D 12: Resolution-Based Inference
School of Informatics, University of Edinburgh 09/02/18 Slide Credits: Jacques Fleuriot, Michael Rovatsos, Michael Herrmann Last time Unification: Given α and β, find θ such that αθ = βθ Most general unifier
More informationThe Forensic Chain-of-Evidence Model: Improving the Process of Evidence Collection in Incident Handling Procedures
The Forensic Chain-of-Evidence Model: Improving the Process of Evidence Collection in Incident Handling Procedures Atif Ahmad Department of Information Systems, University of Melbourne, Parkville, VIC
More informationPdOd Kev Events I Re-world war I1 rwa
I PdOd Kev Events I Re-world war I rwa LECTURE: Knowledge Representation Overview 0 'Qpes of knowledge: objects, events, meta-knowledge, etc. 0 Characteristics of representation: expressive adequacy vs.
More informationSTRUCTURES AND STRATEGIES FOR STATE SPACE SEARCH
Slide 3.1 3 STRUCTURES AND STRATEGIES FOR STATE SPACE SEARCH 3.0 Introduction 3.1 Graph Theory 3.2 Strategies for State Space Search 3.3 Using the State Space to Represent Reasoning with the Predicate
More informationOracle Database 11g: Performance Tuning DBA Release 2
Oracle University Contact Us: +65 6501 2328 Oracle Database 11g: Performance Tuning DBA Release 2 Duration: 5 Days What you will learn This Oracle Database 11g Performance Tuning training starts with an
More informationCSI30. Chapter 1. The Foundations: Logic and Proofs Rules of inference with quantifiers Logic and bit operations Specification consistency
Chapter 1. The Foundations: Logic and Proofs 1.13 Rules of inference with quantifiers Logic and bit operations Specification consistency 1.13 Rules of inference with quantifiers universal instantiation
More informationInduction and Semantics in Dafny
15-414 Lecture 11 1 Instructor: Matt Fredrikson Induction and Semantics in Dafny TA: Ryan Wagner Encoding the syntax of Imp Recall the abstract syntax of Imp: a AExp ::= n Z x Var a 1 + a 2 b BExp ::=
More informationFuzzy If-Then Rules. Fuzzy If-Then Rules. Adnan Yazıcı
Fuzzy If-Then Rules Adnan Yazıcı Dept. of Computer Engineering, Middle East Technical University Ankara/Turkey Fuzzy If-Then Rules There are two different kinds of fuzzy rules: Fuzzy mapping rules and
More informationA Novel Web based Expert System Architecture for On-line and Off-line Fault Diagnosis and Control (FDC) of Power System Equipment
A Novel Web based Expert System Architecture for On-line and Off-line Fault Diagnosis and Control (FDC) of Power System Equipment by Babita Jain. M, M.B Srinivas, Amit Jain in Power System Technology and
More informationUnderstandability and Semantic Interoperability of Diverse Rules Systems. Adrian Walker, Reengineering [1]
Understandability and Semantic Interoperability of Diverse Rules Systems Adrian Walker, Reengineering [1] Position Paper for the W3C Workshop on Rule Languages for Interoperability 27-28 April 2005, Washington,
More informationEXTRACTING RULE SCHEMAS FROM RULES, FOR AN INTELLIGENT LEARNING DATABASE SYSTEM
EXTRACTING RULE SCHEMAS FROM RULES, FOR AN INTELLIGENT LEARNING DATABASE SYSTEM GEOFF SUTCLIFFE and XINDONG WU Department of Computer Science, James Cook University Townsville, Qld, 4811, Australia ABSTRACT
More informationGood Luck! CSC207, Fall 2012: Quiz 1 Duration 25 minutes Aids allowed: none. Student Number:
CSC207, Fall 2012: Quiz 1 Duration 25 minutes Aids allowed: none Student Number: Last Name: Lecture Section: L0101 First Name: Instructor: Horton Please fill out the identification section above as well
More informationRESEARCH ON WHEAT DISEASES AND INSECT PESTS GEOGRAPHIC INFORMATION SYSTEM
RESEARCH ON WHEAT DISEASES AND INSECT PESTS GEOGRAPHIC INFORMATION SYSTEM Hongyan Shen^,Gang Liu^ and Yinbing Ge^ ^ China Agricultural University, Beijing, P.R. China shv0907@hotmail.com paccolcau.edu.cn
More informationLecture 5 of Artificial Intelligence. Production System. Produced by Qiangfu Zhao (Since 2008), All rights reserved
Lecture 5 of Artificial Intelligence Production System AI Lec05/1 Topics of this lecture Production system Inference engine Working memory Knowledge base Pattern matching Conflict resolution Forward inference
More informationSECTION 1.5: LOGIC PROGRAMMING
SECTION 1.5: LOGIC PROGRAMMING William DeMeo williamdemeo@gmail.com University of South Carolina February 7, 2013 SPECIFYING FACTS AND RULES We populate our Prolog database with facts using predicates,
More informationCS161 - Final Exam Computer Science Department, Stanford University August 16, 2008
CS161 - Final Exam Computer Science Department, Stanford University August 16, 2008 Name: Honor Code 1. The Honor Code is an undertaking of the students, individually and collectively: a) that they will
More informationKnowledge.Based Process Specification Language
From: AAAI Technical Report WS-93-05. Compilation copyright 1993, AAAI (www.aaai.org). All rights reserved. Knowledge.Based Process Specification Language A Specification and Validation Technique for Knowledge-Based
More informationOracle Database 11g: Performance Tuning DBA Release 2
Course Code: OC11PTDBAR2 Vendor: Oracle Course Overview Duration: 5 RRP: POA Oracle Database 11g: Performance Tuning DBA Release 2 Overview This course starts with an unknown database that requires tuning.
More informationCOMP219: Artificial Intelligence. Lecture 14: Knowledge Representation
COMP219: Artificial Intelligence Lecture 14: Knowledge Representation 1 Overview Last time Game playing Minimax decisions Alpha-beta pruning Today Introduce the need for explicit knowledge representation
More informationK-Consistency. CS 188: Artificial Intelligence. K-Consistency. Strong K-Consistency. Constraint Satisfaction Problems II
CS 188: Artificial Intelligence K-Consistency Constraint Satisfaction Problems II Instructor: Marco Alvarez University of Rhode Island (These slides were created/modified by Dan Klein, Pieter Abbeel, Anca
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Organization of Programming Languages Operational Semantics CMSC 330 Summer 2018 1 Formal Semantics of a Prog. Lang. Mathematical description of the meaning of programs written in that language
More informationAUTOMATED ANALYSIS OF PROTECTIVE RELAY DATA
AUTOMATED ANALYSIS OF PROTECTIVE RELAY DATA M. Kezunovic, X. Luo Texas A&M University, U. S. A. kezunov@ee.tamu.edu, xuluo@ee.tamu.edu SUMMARY Validation and diagnosis of relay operation is very important
More informationAn expert network simulation and design system
An expert network simulation and design system An expert network simulation and design system Bhavani M. Thuraisingham Bhavani M. Thuraisingham Honey well Inc., Corporate Systems Development Division 1000
More informationWhat is the study of logic?
Chapter 2: The Representation of Knowledge Expert Systems: Principles and Programming, Fourth Edition What is the study of logic? Logic is the study of making inferences given a set of facts, we attempt
More informationArtificial Intelligence
University of Cagliari M.Sc. degree in Electronic Engineering Artificial Intelligence Academic Year: 07/08 Instructor: Giorgio Fumera Exercises on search algorithms. A -litre and a -litre water jugs are
More informationBCP At Bangkok Bank, Thailand
BCP At Bangkok Bank, Thailand Bhakorn Vanuptikul, BCCE Executive Vice President Bangkok Bank Public Company Limited 10 May 2012 1 Agenda Business Continuity Management at Bangkok Bank Success Factors in
More informationCS 188: Artificial Intelligence
CS 188: Artificial Intelligence Constraint Satisfaction Problems II Instructors: Dan Klein and Pieter Abbeel University of California, Berkeley [These slides were created by Dan Klein and Pieter Abbeel
More informationOperational Semantics
15-819K: Logic Programming Lecture 4 Operational Semantics Frank Pfenning September 7, 2006 In this lecture we begin in the quest to formally capture the operational semantics in order to prove properties
More informationLecture notes. Com Page 1
Lecture notes Com Page 1 Contents Lectures 1. Introduction to Computational Intelligence 2. Traditional computation 2.1. Sorting algorithms 2.2. Graph search algorithms 3. Supervised neural computation
More informationClass 8 - September 13 Indirect Truth Tables for Invalidity and Inconsistency ( 6.5)
Philosophy 240: Symbolic Logic Fall 2010 Mondays, Wednesdays, Fridays: 9am - 9:50am Hamilton College Russell Marcus rmarcus1@hamilton.edu Class 8 - September 13 Indirect Truth Tables for Invalidity and
More informationModule 7. Knowledge Representation and Logic (Rule based Systems) Version 2 CSE IIT, Kharagpur
Module 7 Knowledge Representation and Logic (Rule based Systems) Lesson 18 Rule based Systems - II 7.2.5 Programs in PROLOG These minimal notes on Prolog show only some of its flavor. Here are facts plays(ann,fido).
More informationCS 4510/9010 Applied Machine Learning
CS 4510/9010 Applied Machine Learning Neural Nets Paula Matuszek Spring, 2015 1 Neural Nets, the very short version A neural net consists of layers of nodes, or neurons, each of which has an activation
More informationANALYSIS AND REASONING OF DATA IN THE DATABASE USING FUZZY SYSTEM MODELLING
ANALYSIS AND REASONING OF DATA IN THE DATABASE USING FUZZY SYSTEM MODELLING Dr.E.N.Ganesh Dean, School of Engineering, VISTAS Chennai - 600117 Abstract In this paper a new fuzzy system modeling algorithm
More informationFinal Exam. Controller, F. Expert Sys.., Solving F. Ineq.} {Hopefield, SVM, Comptetive Learning,
Final Exam Question on your Fuzzy presentation {F. Controller, F. Expert Sys.., Solving F. Ineq.} Question on your Nets Presentations {Hopefield, SVM, Comptetive Learning, Winner- take all learning for
More informationSolutions to In Class Problems Week 5, Wed.
Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science October 5 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised October 5, 2005, 1119 minutes Solutions
More informationITIL : Professional Education Training. Innovative solutions for modern businesses.
ITIL : 2011 Professional Education Training Innovative solutions for modern businesses www.syzygal.com The ITIL Service Lifecycle ITIL (IT INFRASTRUCTURE LIBRARY) is a best practice framework for IT Service
More informationFormal Predicate Calculus. Michael Meyling
Formal Predicate Calculus Michael Meyling May 24, 2013 2 The source for this document can be found here: http://www.qedeq.org/0_04_07/doc/math/qedeq_formal_logic_v1.xml Copyright by the authors. All rights
More informationHEURISTIC SEARCH. 4.3 Using Heuristics in Games 4.4 Complexity Issues 4.5 Epilogue and References 4.6 Exercises
4 HEURISTIC SEARCH Slide 4.1 4.0 Introduction 4.1 An Algorithm for Heuristic Search 4.2 Admissibility, Monotonicity, and Informedness 4.3 Using Heuristics in Games 4.4 Complexity Issues 4.5 Epilogue and
More informationChapter 3. Set Theory. 3.1 What is a Set?
Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any
More informationCSCI 4150: Intro. to Artificial Intelligence Midterm Examination
CSCI 4150: Intro. to Artificial Intelligence Midterm Examination Tuesday October 17, 000 Name: 1 Assorted search questions The following questions explore differences in the number of nodes evaluated for
More information