© C. Kemke Constructive Problem Solving 1 COMP 4200: Expert Systems Dr. Christel Kemke Department of Computer Science University of Manitoba.

Slides:



Advertisements
Similar presentations
kareRCIserIsviFIsaRsþGnuvtþKMerag
Advertisements

Decision Support and Artificial Intelligence Jack G. Zheng July 11 th 2005 MIS Chapter 4.
The ANSI/SPARC Architecture of a Database Environment
CS4026 Formal Models of Computation Part II The Logic Model Lecture 8 – Search and conclusions.
Turing Machines January 2003 Part 2:. 2 TM Recap We have seen how an abstract TM can be built to implement any computable algorithm TM has components:
The Robert Gordon University School of Engineering Dr. Mohamed Amish
Computer Literacy BASICS
1 Computer Group Engineering Department University of Science and Culture S. H. Davarpanah
Victorian Curriculum and Assessment Authority
1 Search Problems CSD :Graduate Artificial Intelligence Instructors:Zico Kolter and Zack Rubinstein TA:Vittorio Perera.
The von Neumann Model – Chapter 4 COMP 2620 Dr. James Money COMP
the Entity-Relationship (ER) Model
I/O and Space-Efficient Path Traversal in Planar Graphs Craig Dillabaugh, Carleton University Meng He, University of Waterloo Anil Maheshwari, Carleton.
Formal models of design 1/28 Radford, A D and Gero J S (1988). Design by Optimization in Architecture, Building, and Construction, Van Nostrand Reinhold,
Figures in Chapter 1. Learning objectives After studying this chapter, you should be able to; Define logistics and supply chain management. Describe logistics.
Chapter 12 Analyzing Semistructured Decision Support Systems Systems Analysis and Design Kendall and Kendall Fifth Edition.
James A. Senn’s Information Technology, 3rd Edition
Use addition to eliminate a variable
ORGANIZATIONAL PATTERNS
From Model-based to Model-driven Design of User Interfaces.
Improving System Safety through Agent-Supported User/System Interfaces: Effects of Operator Behavior Model Charles SANTONI & Jean-Marc MERCANTINI (LSIS)
© 2002 Franz J. Kurfess Expert System Examples 1 CPE/CSC 481: Knowledge-Based Systems Dr. Franz J. Kurfess Computer Science Department Cal Poly.
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2007.
Rules, page 1 CSI 4106, Winter 2005 Representing knowledge with rules Points Definitions Production systems Conflict resolution strategies Examples A financial.
Chapter 12: Expert Systems Design Examples
© C. Kemke1Expert Systems Tasks COMP 4200: Expert Systems Dr. Christel Kemke Department of Computer Science University of Manitoba.
© C. Kemke1Reasoning - Introduction COMP 4200: Expert Systems Dr. Christel Kemke Department of Computer Science University of Manitoba.
© C. Kemke 1Classification Problem Solving COMP 4200: Expert Systems Dr. Christel Kemke Department of Computer Science University of Manitoba.
Multiobjective VLSI Cell Placement Using Distributed Simulated Evolution Algorithm Sadiq M. Sait, Mustafa I. Ali, Ali Zaidi.
Reporter : Mac Date : Multi-Start Method Rafael Marti.
© C. Kemke1Reasoning - Introduction COMP 4200: Expert Systems Dr. Christel Kemke Department of Computer Science University of Manitoba.
© C. Kemke Control 1 COMP 4200: Expert Systems Dr. Christel Kemke Department of Computer Science University of Manitoba.
Direct Current Circuits
Building Knowledge-Driven DSS and Mining Data
McGraw-Hill/Irwin ©2005 The McGraw-Hill Companies, All rights reserved ©2005 The McGraw-Hill Companies, All rights reserved McGraw-Hill/Irwin.
Artificial Intelligence Lecture No. 15 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
1 Chapter 9 Database Design. 2 2 In this chapter, you will learn: That successful database design must reflect the information system of which the database.
Workshop Designing a Batteryless Cell Phone Introduction Dr. Farid Farahmand 9/26/2006.
1 Technical Communication A Reader-Centred Approach First Canadian Edition Paul V. Anderson Kerry Surman
Module 4: Systems Development Chapter 12: (IS) Project Management.
RELATIONAL FAULT TOLERANT INTERFACE TO HETEROGENEOUS DISTRIBUTED DATABASES Prof. Osama Abulnaja Afraa Khalifah
Database Design and Management CPTG /23/2015Chapter 12 of 38 Functions of a Database Store data Store data School: student records, class schedules,
Case study of Several Case Based Reasoners Sandesh.
Design & Analysis of Algorithms Lecture 1 Introduction.
Finnish-Russian Doctoral Seminar on Multicriteria Decision Aid and Optimization Iryna Yevseyeva Niilo Mäki Institute University of Jyväskylä, Finland
Bloom’s Taxonomy.
1 Computer Group Engineering Department University of Science and Culture S. H. Davarpanah
Blooms Taxonomy Margaret Gessler Werts Department of Language, Reading, and Exceptionalities.
Generic Tasks by Ihab M. Amer Graduate Student Computer Science Dept. AUC, Cairo, Egypt.
Data Structures and Algorithms Dr. Tehseen Zia Assistant Professor Dept. Computer Science and IT University of Sargodha Lecture 1.
Branch-and-Cut Valid inequality: an inequality satisfied by all feasible solutions Cut: a valid inequality that is not part of the current formulation.
Assessment. Levels of Learning Bloom Argue Anderson and Krathwohl (2001)
Distributed Models for Decision Support Jose Cuena & Sascha Ossowski Pesented by: Gal Moshitch & Rica Gonen.
Rational Agency CSMC Introduction to Artificial Intelligence January 8, 2004.
Introduction to State Space Search
Artificial Intelligence
Forward and Backward Chaining
Computer Systems Architecture Edited by Original lecture by Ian Sunley Areas: Computer users Basic topics What is a computer?
Victoria Ibarra Mat:  Generally, Computer hardware is divided into four main functional areas. These are:  Input devices Input devices  Output.
Assessment.
D2L Refresher Upload content into the Content section in a D2L course
Assessment.
Introduction Defining the Problem as a State Space Search.
Using Seven Reader-Centered Patterns for Organizing
Objective of This Course
AI and Agents CS 171/271 (Chapters 1 and 2)
Chapter 12 Analyzing Semistructured Decision Support Systems
<Your Team # > Your Team Name Here
System Analysis and Design:
Presentation transcript:

© C. Kemke Constructive Problem Solving 1 COMP 4200: Expert Systems Dr. Christel Kemke Department of Computer Science University of Manitoba

© C. Kemke Constructive Problem Solving 2 COMP 4200: Expert Systems  Constructive Problem Solving I  cf. Jackson, Chapter 14  Constructive Problem Solving II  cf. Jackson, Chapter 15

© C. Kemke Constructive Problem Solving 3 Task Areas of Expert Systems System-Based View of XPS Task  Analysis Tasks (Interpretation of System)  Diagnosis  Classification  Synthesis Tasks (Construction of System)  Construction  Configuration  Design  Planning

© C. Kemke Constructive Problem Solving 4 Solution constructed by choosing and assembling solution elements. Examples: develop a plan for a robot to bring a cup of coffee from IQ; construct a system, e.g. a computer, by assembling a set of components, like HD, CPU etc. Solution elements are described as components (maybe with parameters); assembly is subject to constraints (robot cannot go to IQ if it cannot take the elevator; certain CPUs need certain power supply); solution might be subject to evaluation function

© C. Kemke Constructive Problem Solving 5 Constructive PS and Task Areas Planning solution elements = actions solutions = sequence of actions constraints = e.g. physical or logical constraints Design solution elements = components solutions = combination of components constraints = e.g. physical or logical constraints Diagnosis of multiple disorders solution elements = disorders solutions = sets of disorders to explain the symptoms ; determine 'best' set according to evaluation

© C. Kemke Constructive Problem Solving 6 Constructive PS Approach Choose combination of solution elements  set  sequence  complex arrangement Combined according to constraints  order (sequence of steps; arrangement of components)  time (sequence of actions in time; limit of time)  spatial arrangement (layout in space, e.g. floor plan)  features and their agreements (e.g. matching voltage for electrical components, matching colors for cloths) ...

© C. Kemke Constructive Problem Solving 7 Constructive PS as Search Search Space: all combinations of solution elements Search Space can be huge! Restrict search by selecting solution elements based on known constraints; selection of new components is restricted through constraints. Constraints can be formulated in rules: IF device requires battery THEN select battery for device IF select battery for device THEN pick battery WITH voltage(battery) = voltage(device) IF device requires battery AND device = watch THEN select micro- battery

© C. Kemke Constructive Problem Solving 8 Constructive PS - R1/XCON R1/XCON developed to design DEC VAX computer systems (early 1980ies) R1  uses a database of computer components  a rule base specifying design rules and constraints  a working memory (WM) to store interim structures, in particular the partial computer configuration generated so far

© C. Kemke Constructive Problem Solving 9 R1/XCON – Sample Component Jackson, p. 262, Figure 14.1

© C. Kemke Constructive Problem Solving 10 R1/XCON – Types of Rules Rule types related to tasks in PS: 1. Operator Rules create and extend partial configurations 2. Sequencing Rules determine order of processing (contexts, modules) 3. Information-Gathering Rules access database of components; perform various computations

© C. Kemke Constructive Problem Solving 11 R1/XCON – Sample Rule Jackson, p. 262, Figure 14.2

© C. Kemke Constructive Problem Solving 12 R1/XCON – Basic Principles R1 selects component from DB; entered as ‘token’ (instance) into Working Memory (WM). Rules specify configuration patterns (conditions, constraints) and actions for extending partial configurations (consequences). Rule set divided into "contexts" (modules) according to sub- tasks. Strategy  Finish a sub-task before starting a new one. Implementation  Add contexts to condition part of rules.  Switch to new context in the action part.

© C. Kemke Constructive Problem Solving 13 R1/XCON – Sub-Tasks 1. Check and complete order. 2. Configure CPU. 3. Configure unibus modules, prepare cabinets with modules. 4. Configure paneling; assign panels to unibus modules and devices. 5. Generate floor plan. Device arrangement. 6. Cabling.

© C. Kemke Constructive Problem Solving 14 R1/XCON – Problem Solving Propose-and-Apply (Bachant 1988): 1. Initialize Goal (for current task) 2. Propose Operator (plausible next steps) 3. Prune Operator (according to global criteria) 4. Eliminate Operator (pairwise comparison) 5. Select one Operator (based on 2-4) 6. Apply Operator (extend configuration) 7. Evaluate Goal (okay? or not?)

© C. Kemke Constructive Problem Solving 15 R1/XCON - Conclusion  DB of components  constraints and actions in rules  about rules defined and used  integrate various experts' knowledge  heavily based on "what-to-do-next"  follows always one line of reasoning  control through contexts (modules)