CBR matching & brokering IIIA-CSIC IBROW. Framework UPML components as cases Retrieved by CBR constructs in NOOS UPML meta-ontology Object language Describes.

Slides:



Advertisements
Similar presentations
Explanation-Based Learning (borrowed from mooney et al)
Advertisements

TOWARDS A COMPONENT- BASED PLATFORM FOR DEVELOPING CBR SYSTEMS JOSE MARIA ABASOLO LLUCH Directores Enric Plaza Josep-Lluis Arcos Tutor Ton Sales.
ARCHITECTURES FOR ARTIFICIAL INTELLIGENCE SYSTEMS
16/11/ IRS-II: A Framework and Infrastructure for Semantic Web Services Motta, Domingue, Cabral, Gaspari Presenter: Emilia Cimpian.
UIUC CS 497: Section EA Lecture #2 Reasoning in Artificial Intelligence Professor: Eyal Amir Spring Semester 2004.
Formal Modelling of Reactive Agents as an aggregation of Simple Behaviours P.Kefalas Dept. of Computer Science 13 Tsimiski Str Thessaloniki Greece.
Phosphorus: Ontology-Based Matchmaking Hans Chalupsky Yolanda Gil Tom Russ Surya Ramachandran Information Sciences Institute.
Expert System Shells - Examples
Case-Based Reasoning, 1993, Ch11 Kolodner Adaptation method and Strategies Teacher : Dr. C.S. Ho Student : L.W. Pan No. : M Date : 1/7/2000.
Intelligent Information Retrieval CS 336 –Lecture 2: Query Language Xiaoyan Li Spring 2006 Modified from Lisa Ballesteros’s slides.
Algorithms and Problem Solving-1 Algorithms and Problem Solving.
5/12/1999 Li-we Pan1 指導老師 : 何正信教授 學生:潘立偉 學號: M 日期: 5/12/1999 Wolfgang Wilke, Barry Smyth, Pádraig Cunningham “Case-Based Reasoning Technology From.
Algorithms and Problem Solving. Learn about problem solving skills Explore the algorithmic approach for problem solving Learn about algorithm development.
Modern Information Retrieval Chapter 2 Modeling. Can keywords be used to represent a document or a query? keywords as query and matching as query processing.
Problem Spaces & Search CSE 473. © Daniel S. Weld Topics Agents & Environments Problem Spaces Search & Constraint Satisfaction Knowledge Repr’n.
Knowledge Modelling: Foundations, Techniques and Applications Enrico Motta Knowledge Media Institute The Open University United Kingdom.
Modeling Modern Information Retrieval
Case-based Reasoning System (CBR)
Learning from Experience: Case Injected Genetic Algorithm Design of Combinational Logic Circuits Sushil J. Louis Genetic Algorithm Systems Lab(gaslab)
Modern Information Retrieval Chapter 2 Modeling. Can keywords be used to represent a document or a query? keywords as query and matching as query processing.
Protégé An Environment for Knowledge- Based Systems Development Haishan Liu.
Automated Planning and HTNs Planning – A brief intro Planning – A brief intro Classical Planning – The STRIPS Language Classical Planning – The STRIPS.
Building Knowledge-Driven DSS and Mining Data
1 CS 502: Computing Methods for Digital Libraries Lecture 11 Information Retrieval I.
Course Instructor: Aisha Azeem
Overview of Search Engines
CORE 2: Information systems and Databases STORAGE & RETRIEVAL 2 : SEARCHING, SELECTING & SORTING.
Becerra-Fernandez, et al. -- Knowledge Management 1/e -- © 2004 Prentice Hall Chapter 16 Knowledge Application Systems: Systems that Utilize Knowledge.
OMAP: An Implemented Framework for Automatically Aligning OWL Ontologies SWAP, December, 2005 Raphaël Troncy, Umberto Straccia ISTI-CNR
Modeling (Chap. 2) Modern Information Retrieval Spring 2000.
CBR for Design Upmanyu Misra CSE 495. Design Research Develop tools to aid human designers Automate design tasks Better understanding of design Increase.
Evaluation of a Hybrid Self-improving Instructional Planner Jon A. Elorriaga and Isabel Fernández-Castro Computer Languages and Systems Dept. University.
Speaking Bluntly about SharpHDL: Some Old Stuff and Some Other Proposed Future Extensions Gordon J. Pace & Christine Vella Synchron’05 Malta, November.
Context-based Search in Topic Centered Digital Repositories Christo Dichev, Darina Dicheva Winston-Salem State University Winston-Salem, N.C. USA {dichevc,
Thanks to Bill Arms, Marti Hearst Documents. Last time Size of information –Continues to grow IR an old field, goes back to the ‘40s IR iterative process.
Joseph Cordina 1/11 The Use of Model-Checking for the Verification of Concurrent Algorithms Joseph Cordina Department of C.S.&A.I.
CellFateScout step- by-step tutorial for a case study Version 0.94.
Configuration Systems - CSE Sudhan Kanitkar.
A Declarative Similarity Framework for Knowledge Intensive CBR by Díaz-Agudo and González-Calero Presented by Ida Sofie G Stenerud 25.October 2006.
An Ontological Framework for Web Service Processes By Claus Pahl and Ronan Barrett.
WSMO Discovery Realization in Semantic Web Fred Michael Stollberg - 03 November
Tutoring & Help System CSE-435 Nicolas Frantzen CSE-435 Nicolas Frantzen.
The Volcano Optimizer Generator Extensibility and Efficient Search.
1 Defining a Problem as a State Space 1. Define a state space that contains all the possible configurations of the relevant objects. 2. Specify one (or.
Knowledge Learning by Using Case Based Reasoning (CBR)
1 Knowledge Acquisition and Learning by Experience – The Role of Case-Specific Knowledge Knowledge modeling and acquisition Learning by experience Framework.
Database Management System. DBMS A software package that allows users to create, retrieve and modify databases. A database is a collection of related.
Machine Learning Concept Learning General-to Specific Ordering
DEDUCTION PRINCIPLES AND STRATEGIES FOR SEMANTIC WEB Chain resolution and its fuzzyfication Dr. Hashim Habiballa University of Ostrava.
A Portrait of the Semantic Web in Action Jeff Heflin and James Hendler IEEE Intelligent Systems December 6, 2010 Hyewon Lim.
A Framework for Developing Compiler-like Components Jackline Ssanyu ( Software Engineering and Technology Group) Eindhoven University of Technology Supervisors:
The Development of a search engine & Comparison according to algorithms Sung-soo Kim The final report.
Concept Learning and The General-To Specific Ordering
Principles in the Evolutionary Design of Digital Circuits J. F. Miller, D. Job, and V. K. Vassilev Genetic Programming and Evolvable Machines.
1 Instance Store Database Support for Reasoning over Individuals S Bechhofer, I Horrocks, D Turi. Instance Store - Database Support for Reasoning over.
Chapter 11.  Large amounts of data are often stored in a database—an organized collection of data.  A database management system (DBMS) provides mechanisms.
The PLA Model: On the Combination of Product-Line Analyses 강태준.
Mechanisms for Requirements Driven Component Selection and Design Automation 최경석.
Tutoring & Help Systems Deepthi Bollu for CSE495 10/31/2003.
SIMS 202, Marti Hearst Final Review Prof. Marti Hearst SIMS 202.
Algorithms and Problem Solving
Architecture Components
CSE 473 Artificial Intelligence Oren Etzioni
Web Ontology Language for Service (OWL-S)
Chapter 15 QUERY EXECUTION.
A Unifying View on Instance Selection
Problem Spaces & Search
Algorithms and Problem Solving
Databases and Information Management
ONTOMERGE Ontology translations by merging ontologies Paper: Ontology Translation on the Semantic Web by Dejing Dou, Drew McDermott and Peishen Qi 2003.
Presentation transcript:

CBR matching & brokering IIIA-CSIC IBROW

Framework UPML components as cases Retrieved by CBR constructs in NOOS UPML meta-ontology Object language Describes CBR properties Concept language Feature logics Similar to description logics (aka )

Component matching UPML components are cases in memory We can query the memory Subsumption (query ≤ case) How do we generate queries? Configuration program (“Broker”) Receives a “user consult” for a system Generates queries for particular components in memory Classical search space program Knows about UPML

Matching Consult: precond+postcond+models+I/O For a given task T Retrieve PSM (CBR subsumption retrieve): T.postcond ≤ PSM.postcond Filter retrieved PSMs (subsumption filtering) PSM.precond ≤ T.precond Input & Outputs of T & PSM match Goal: find configuration (state) where consult is satisfied

S&S Broker Broker understands 2 things UPML Object language Broker is a P. Solver for OL OL=constraints => Broker=SAT solver OL= FOL => Broker=theorem prover S&S broker OL = language for cases in CBR Broker= search technique

Components for CAT-CBR

Case-base of configured apps

Search & Subsume Broker Search thru state space State represents properties of a partially instantiated configuration UPML: understands goals & assumptions Concept language: Subsumption of concept expressions

S&S Broker strategies Depth first (shown Stanford) S&S Broker Best first (shown here) CBR Broker Sorting = case-based similarity

State Goals Assumptions Knowledge Met-goals Met-assumptions Open-knowledge Used-knowledge PSM-hypothesis Open-tasks Tasks PSMs

A sepecification of state

A CONFIGURATION CASE

Knowledge for search Initial-state: consult->state Successor: State-> State s Combiner: States->Ordered- States Case-based similarity to order states Else order by depth or breadth Goal-state: State ->Boolean Finalize: State->Configuration

A configuration

New state, new hypothesis N possible PSMs for a task N new hypothesis, N ne w states

CBR configuration as BestFirst

Specifying a CBR application

Configured CBR application

Conclusions CBR balances memory vs. search New configuration is also a case With “compiled” goals & assumptions S&S Broker can retrieve config (config = case) Separate configuration from requirement acquisition CBR broker: adapting “similar” configs to user-posed problems