Intro to Computation and AI Dr. Jill Fain Lehman School of Computer Science Lecture 6: December 4, 1997.

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

Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
Bayesian Network and Influence Diagram A Guide to Construction And Analysis.
Expert Systems Reasonable Reasoning An Ad Hoc approach.
© 2002 Franz J. Kurfess Expert System Examples 1 CPE/CSC 481: Knowledge-Based Systems Dr. Franz J. Kurfess Computer Science Department Cal Poly.
Expert Systems Reasonable Reasoning An Ad Hoc approach.
Ontological Logic Programming by Murat Sensoy, Geeth de Mel, Wamberto Vasconcelos and Timothy J. Norman Computing Science, University of Aberdeen, UK 1.
Rulebase Expert System and Uncertainty. Rule-based ES Rules as a knowledge representation technique Type of rules :- relation, recommendation, directive,
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
Intelligent systems Lecture 6 Rules, Semantic nets.
Certainty and Evidence
Introduction to SOAR Based on “a gentle introduction to soar: an Architecture for Human Cognition” by Jill Fain Lehman, John Laird, Paul Rosenbloom. Presented.
AI – CS364 Uncertainty Management 26 th September 2006 Dr Bogdan L. Vrusias
FT228/4 Knowledge Based Decision Support Systems Rule-Based Systems Ref: Artificial Intelligence A Guide to Intelligent Systems Michael Negnevitsky – Aungier.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
CSE (c) S. Tanimoto, 2008 Propositional Logic
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.
Knowledge Acquisitioning. Definition The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
Lecture 04 Rule Representation
CIS 430 ( Expert System ) Supervised By : Mr. Ashraf Yaseen Student name : Ziad N. Al-A’abed Student # : EXPERT SYSTEM.
© 2002 Franz J. Kurfess Introduction 1 CPE/CSC 481: Knowledge-Based Systems Dr. Franz J. Kurfess Computer Science Department Cal Poly.
1 Chapter 9 Rules and Expert Systems. 2 Chapter 9 Contents (1) l Rules for Knowledge Representation l Rule Based Production Systems l Forward Chaining.
Methods of Proof Chapter 7, second half.
Production Rules Rule-Based Systems. 2 Production Rules Specify what you should do or what you could conclude in different situations. Specify what you.
Knowledge Acquisition CIS 479/579 Bruce R. Maxim UM-Dearborn.
Marakas: Decision Support Systems, 2nd Edition © 2003, Prentice-Hall Chapter Chapter 7: Expert Systems and Artificial Intelligence Decision Support.
EXPERT SYSTEMS Part I.
Models of Human Performance Dr. Chris Baber. 2 Objectives Introduce theory-based models for predicting human performance Introduce competence-based models.
Semantic Web Technologies Lecture # 2 Faculty of Computer Science, IBA.
Artificial Intelligence Lecture 12. Knowledge-based problem solving  expert systems rule-based reasoning, heuristics  alternative approaches case-based.
Artificial Intelligence Lecture No. 15 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
Artificial Intelligence: Definition “... the branch of computer science that is concerned with the automation of intelligent behavior.” (Luger, 2009) “The.
CS62S: Expert Systems Based on: The Engineering of Knowledge-based Systems: Theory and Practice A. J. Gonzalez and D. D. Dankel.
Presented by Mohammad Saniee December 2, 2003
Knowledge based Humans use heuristics a great deal in their problem solving. Of course, if the heuristic does fail, it is necessary for the problem solver.
Chapter 9: Rules and Expert Systems Lora Streeter.
Pattern-directed inference systems
Expert Systems Robots Unlimited, p. 234 – Expert Systems Expert knowledge in many domains can be captured as rules. Dendral (1965 – 1975) If: The.
CSE (c) S. Tanimoto, 2002 Expert Systems 1 Expert Systems Outline: Various Objectives in Creating Expert Systems Integration of AI Techniques into.
Expert System Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
Data Structures and Algorithms Dr. Tehseen Zia Assistant Professor Dept. Computer Science and IT University of Sargodha Lecture 1.
Chapter 5 Constraint Satisfaction Problems
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
CPSC 322, Lecture 19Slide 1 (finish Planning) Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt – 5.2) Oct,
The Interpreter Pattern (Behavioral) ©SoftMoore ConsultingSlide 1.
RULES Patty Nordstrom Hien Nguyen. "Cognitive Skills are Realized by Production Rules"
Artificial Intelligence: Research and Collaborative Possibilities a presentation by: Dr. Ernest L. McDuffie, Assistant Professor Department of Computer.
KNOWLEDGE MANAGEMENT UNIT II KNOWLEDGE MANAGEMENT AND TECHNOLOGY 1.
AD Lab Andrews-Dalkilic Data Exploration. AD Lab Outline Architecture What is Bioinformatics? Explore some bioinformatics problems and tools Talk about.
Some Thoughts to Consider 5 Take a look at some of the sophisticated toys being offered in stores, in catalogs, or in Sunday newspaper ads. Which ones.
Proof Methods for Propositional Logic CIS 391 – Intro to Artificial Intelligence.
Introduction: What is AI? CMSC Introduction to Artificial Intelligence January 7, 2003.
Artificial Intelligence: Applications
EXPERT SYSTEMS BY MEHWISH MANZER (63) MEER SADAF NAEEM (58) DUR-E-MALIKA (55)
Lecture 14. Recap Problem Solving GA Simple GA Examples of Mutation and Crossover Application Areas.
CENG 424-Logic for CS Introduction Based on the Lecture Notes of Konstantin Korovin, Valentin Goranko, Russel and Norvig, and Michael Genesereth.
KNOWLEDGE REPRESENTATION
Knowledge Representation and Reasoning
Computer Science cpsc322, Lecture 13
Knowledge Representation
Knowledge Representation and Reasoning
The Physical Symbol Systems Hypothesis
Knowledge Representation
Intro to Expert Systems Paula Matuszek CSC 8750, Fall, 2004
Forward Chaining DFS can supply compatible bindings for forward chaining.
Logic: Domain Modeling /Proofs + Computer Science cpsc322, Lecture 22
Methods of Proof Chapter 7, second half.
Habib Ullah qamar Mscs(se)
Presentation transcript:

Intro to Computation and AI Dr. Jill Fain Lehman School of Computer Science Lecture 6: December 4, 1997

Review Last lecture looked at AI uses of basic graph structures and algorithms: –Inheritance hierarchies and inferential reasoning –Constraint satisfaction and propagation In addition to relying on basic CS structures and algorithms, AI has also created its own formalisms: e.g. rule-based systems.

Rule-based Systems Formalism critical in 1980’s for moving AI out of the lab and into practical industry applications. –Basis of Expert Systems & Expert System Shells. –Also basis of 2 long-standing cognitive architectures: ACT and Soar. 2 parts: knowledge structure and processing mechanism (of course).

Knowledge Structure Rules encode the knowledge of the domain required to solve problems or tasks in the domain. Conceptually, a rule is made up of 2 parts: –The “if” portion (aka left-hand side, conditions or preconditions) –The “then” portion (aka right-hand side, actions, effects). There are many variations on this theme, e.g. including a “confidence measure” with a rule to help accommodate uncertainty.

Example: MYCIN (Shortliffe) If (1) the stain of the organism is gram-positive, and (2) the morphology of the organism is coccus, and (3) the growth conformation of the organism is clumps,l Then there is suggestive evidence (0.7) that the identity of the organism is staphylococcus. An expert system for guiding bacterial infection therapy. Premise: ($and (same cntxt gram grampos) (same contxt morph coccus) (same cntxt conform clumps)) Action: (conclude cntxt ident staphylococcus tally 0.7)

Example: R1 (McDermott) If the most current active context is distributing massbus devices, & there is a single-port drive that hasn’t been assigned to a massbus, & there are no unassigned dual-port disk drives, & the number of devices that each massbus should support is known, & there is a massbus that has been assigned at least 1 drive that should support additional disk drives, & the type of cable needed to connect the disk drive to the previous device on the massbus is known Then assign the disk drive to the massbus.

Processing Mechanism Conceptually: a rule interpreter that matches the “if” portion of the rule against a state description and then changes the state description based on the “then” portion. Exactly what goes in the state and what goes in the rule and what goes in the interpreter is the basis of the differences between particular rule systems.

Simple Example Suppose state had 2 objects: blocka and blockb and blocka was on the table and blockb was on top of blocka. State: {(isa block blocka) (isa block blockb) (ontop blockb blocka) (ontable blocka)} Goal: {(ontable blockb)} Operator-move-off: If (state (isa block ) (ontop ))(goal (ontable )) Then (add (ontable )) (remove (ontop )) What does the interpreter do???

Expressiveness of Rule Language Need to have variables that can be bound to particular instances during problem solving. Usually need logical operations (not & disjunction) in addition to implicit conjunction). Need to encode directions to the interpreter (e.g. “add” “remove”). May need metalanguage (ability to talk about rules themselves) (this may also be hidden in the interpreter).

Behavior of Interpreter Enforce consistency of bindings across clauses. Must match conditions efficiently: –Large numbers of rules cannot be searched linearly: need some form of indexing –trade-off betw. expressiveness of language/ease of match Needs conflict resolution strategy when more than one rule can fire. –E.g. fire all vs. fire exactly one (based on: rules, objects, or actions?) May require additional capabilities to, e.g., combine certainty factors.

Some Issues in Using Rule-based Systems Knowledge acquisition: how to get the expertise out of experts, how to represent it efficiently, how to maintain consistency, how to check for completeness. –Iterative approach, lots of time spent on tools. Explanation: how to know what the system is doing, how to assure experts that reasons for behavior are appropriate. –Alternatives to NL? Ethics