1 Heriot -Watt University MACS, Edinburgh Towards a Logical Framework For Knowledge Management in Digital Economy Lilia Georgieva and.

Slides:



Advertisements
Similar presentations
1 Verification by Model Checking. 2 Part 1 : Motivation.
Advertisements

Large-Scale, Adaptive Fabric Configuration for Grid Computing Peter Toft HP Labs, Bristol June 2003 (v1.03) Localised for UK English.
1 11. Hash Tables Heejin Park College of Information and Communications Hanyang University.
The Quest for Correctness Joseph Sifakis VERIMAG Laboratory 2nd Sogeti Testing Academy April 29th 2009.
A-Priori Verification of Web Services with Abduction Marco Alberti 1 Federico Chesani 2 Marco Gavanelli 1 Evelina Lamma 1 Paola Mello 2 Marco Montali 2.
Fakultät für informatik informatik 12 technische universität dortmund SDL Peter Marwedel TU Dortmund, Informatik 12 Graphics: © Alexandra Nolte, Gesine.
Slide 1 Insert your own content. Slide 2 Insert your own content.
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study Sebastian Burckhardt Rajeev Alur Milo M. K. Martin Department of.
1 Probability and the Web Ken Baclawski Northeastern University VIStology, Inc.
Slide 1 of 18 Uncertainty Representation and Reasoning with MEBN/PR-OWL Kathryn Blackmond Laskey Paulo C. G. da Costa The Volgenau School of Information.
…to Ontology Repositories Mathieu dAquin Knowledge Media Institute, The Open University From…
For APNOMS Managing Pervasive Computing and Ubiquitous Communications Challenges Ahead Graham Chen.
Relational Database and Data Modeling
Combining Like Terms. Only combine terms that are exactly the same!! Whats the same mean? –If numbers have a variable, then you can combine only ones.
1DAML PI meeting, October DAML and Agents DAML and Agents Breakout Session DAML PI Meeting 17 October 2002 Tim Finin.
Secure Naming structure and p2p application interaction IETF - PPSP WG July 2010 Christian Dannewitz, Teemu Rautio and Ove Strandberg.
What's a Proxy Printer Provider? PWG WIMS-CIM Working Group Rick Landau Dell, CTO Office 2008/07/15 v0.1.
Requirements. UC&R: Phase Compliance model –RIF must define a compliance model that will identify required/optional features Default.
1 Copyright © 2005, Oracle. All rights reserved. Introducing the Java and Oracle Platforms.
1 TDI &Prevalence First results of pilotproject A.W.Ouwehand W.Kuijpers Lisbon: TDI meeting september 2006.
1 New Media & Media Formats for Future Media Internet Theodore B. Zahariadis, PhD Synelixis Solutions Ltd 10 Farmakidou Av. GR34100, Greece.
National Technical University of Athens Department of Electrical and Computer Engineering Image, Video and Multimedia Systems Laboratory
0 - 0.
ALGEBRAIC EXPRESSIONS
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
Addition Facts
Automata Theory December 2001 NPDAPart 3:. 2 NPDA example Example: a calculator for Reverse Polish expressions Infix expressions like: a + log((b + c)/d)
1 The European Agency for Special Needs Education Pete Walker Internet Development Group Manager Kieren Pitts Senior Analyst/Programmer.
1 DTI/EPSRC 7 th June 2005 Reacting to HCI Devices: Initial Work Using Resource Ontologies with RAVE Dr. Ian Grimstead Richard Potter BSc(Hons)
© Fachgebiet Softwaretechnik, Heinz Nixdorf Institut, Universität Paderborn 2.4 The Z Notation [Reference: M. Spivey: The Z Notation, Prentice Hall]
David Luebke 1 6/7/2014 ITCS 6114 Skip Lists Hashing.
June, 2006 The 11th CAiSE06 International Workshop on Exploring Modeling Methods in Systems Analysis and Design (EMMSAD06), Luxembourg Ontological.
Hash Tables Introduction to Algorithms Hash Tables CSE 680 Prof. Roger Crawfis.
Ontology-based User Modeling for Web-based Information Systems Anton Andrejko, Michal Barla and Mária Bieliková {andrejko, barla,
E W H A W U New Nominative Proxy Signature Scheme for Mobile Communication April Seo, Seung-Hyun Dept. of Computer Science and.
4 Oracle Data Integrator First Project – Simple Transformations: One source, one target 3-1.
1 I-globe: integration. 2 scenario 3 infrastructure.
Modal Logic with Variable Modalities & its Applications to Querying Knowledge Bases Evgeny Zolin The University of Manchester
The 20th International Conference on Software Engineering and Knowledge Engineering (SEKE2008) Department of Electrical and Computer Engineering
Database System Concepts and Architecture
Lecture 8: Testing, Verification and Validation
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
Executional Architecture
Intelligent Architectures for Electronic Commerce Part 1.5: Symbolic Reasoning Agents.
Function Point Measurement from Java Programs
2009 – E. Félix Security DSL Toward model-based security engineering: developing a security analysis DSML Véronique Normand, Edith Félix, Thales Research.
Addition 1’s to 20.
CSTA K-12 Computer Science Standards (rev 2011)
Test B, 100 Subtraction Facts
11 = This is the fact family. You say: 8+3=11 and 3+8=11
Week 1.
©Ian Sommerville 2004Software Engineering, 7th edition. Chapter 13 Slide 1 Application architectures.
1 October 16 th, 2009 Meaning to motion: Transforming specifications to provably-correct control Hadas Kress-Gazit Cornell University George Pappas University.
Incremental Rehearsal: This is how the flashcards are to be presented to the student. U1, K1, U1, K1, K2, U1, K1, K2, K3, U1, K1, K2, K3,K4, U1, K1, K2,
From Model-based to Model-driven Design of User Interfaces.
A Survey of Runtime Verification Jonathan Amir 2004.
Working with Discourse Representation Theory Patrick Blackburn & Johan Bos Lecture 3 DRT and Inference.
Automatic Verification Book: Chapter 6. What is verification? Traditionally, verification means proof of correctness automatic: model checking deductive:
Formal Modelling of Reactive Agents as an aggregation of Simple Behaviours P.Kefalas Dept. of Computer Science 13 Tsimiski Str Thessaloniki Greece.
Managing Agent Platforms with the Simple Network Management Protocol Brian Remick Thesis Defense June 26, 2015.
Verification technique on SA applications using Incremental Model Checking 컴퓨터학과 신영주.
Formal Methods 1. Software Engineering and Formal Methods  Every software engineering methodology is based on a recommended development process  proceeding.
1 5/18/2007ã 2007, Spencer Rugaber Software Architecture (Informal Definition) The organization of a system into component subsystems or modules Box and.
1 Qualitative Reasoning of Distributed Object Design Nima Kaveh & Wolfgang Emmerich Software Systems Engineering Dept. Computer Science University College.
LDK R Logics for Data and Knowledge Representation Modal Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
Safety-Critical Systems 5 Testing and V&V T
Parameterized Models for Distributed Java Objects Tomás Barros & Rabéa Boulifa OASIS Project INRIA Sophia Antipolis April 2004.
HACNet Simulation-based Validation of Security Protocols Vinay Venkataraghavan Advisors: S.Nair, P.-M. Seidel HACNet Lab Computer Science and Engineering.
Model Checking Lecture 1. Model checking, narrowly interpreted: Decision procedures for checking if a given Kripke structure is a model for a given formula.
Software Systems Verification and Validation Laboratory Assignment 4 Model checking Assignment date: Lab 4 Delivery date: Lab 4, 5.
Presentation transcript:

1 Heriot -Watt University MACS, Edinburgh Towards a Logical Framework For Knowledge Management in Digital Economy Lilia Georgieva and Imran Zia KES-AMSTA 2009 June, 5 th

2 Structure Background and motivation Knowledge management in digital economy Formalisation and verification Case studies

3 Challenges in digital economy Knowledge generation Knowledge creation and sharing Analysis of knowledge management models Adaptation of knowledge management models Formalisation of knowledge management Verification and security

4 Background & Motivation Languages for knowledge modelling -modal logic; -description logic; -epistemic logic; -process logic. Model checking and verification. Benefits. Case studies.

5 Knowledge Management Knowledge management is: a mix of contextual information, experience and rules an integrated approach to identifying, capturing, evaluating, retrieving and sharing all of enterprises information assets. Types of knowledge in digital economy: descriptive, static, updated, dynamic, interactive.

6 Example of Static KM Model Information processing view of knowledge work = limited to static combination of natural language. (Kimas 2003)

7 Our modelling language Prepositional logic formulas + two (basic) modal logic operators : ◊ (diamond) possibly □ (box) necessary For proposition letters set { p, q, r…}, if ,  are modal formulas, then so are: T, , ¬ ,  v ,  ,  → ,  ↔ , ◊ , □ .

8 Epistemic Logic Logic for knowledge and belief. Provides an insight in to properties of individuals and groups. Knowledge is implicitly represented in the agent’s information state.

9 Standard Knowledge Axioms (K1) Ki ¬¬p → Ki p, (K2) ¬Ki¬p → Ki p, (K3)¬Ki p → Ki¬ p, (K4) Ki p → Ki Ki p (K5) Ki p ۸ Ki (p → q) → Ki q, (K6) Ki (p ۸ q) → Ki p ۸ Ki q, (K7) Ki (p ٧ q) → Ki p ٧ Kiq, (K8) Ki ¬ (p ۸ q) → Ki ¬ p ٧ Ki ¬ q, (K9) Ki ¬ (p ٧ q) → Ki ¬ p ۸ Ki ¬ q, (K10) Ki Kj p → Ki p.

10 Knowledge Management Streams Knowledge sharing Determine knowledge Determine knowledge available Determine knowledge gap Knowledge lock Knowledge utilisation Knowledge evaluation

11 Knowledge management framework The framework is based on the following steps: Knowledge stream specification. Knowledge stream formalisation in epistemic logic. Translation into MAP encoding. Semantic interpretation (FIPA semantics). Stream verification. Analysis of stream behaviour.

12 Graphical Representation of Knowledge Sharing Protocol Reject Accept agent j shares fact agent i knows fact Initial Shares (M. SHARES (M) REJECTS (M) ACCEPT (M)

Model checking Input: A finite state model of the knowledge process. A specification (requirement) regarding the model. Algorithm: Check if the system design satisfies the specification. If not, generate a system run which violates the specification (counter example). 13

Model checking knowledge processes SPIN is a verification tool used for data communication protocols, multi-threaded code, client-server applications. SPIN verification is focused on proving correctness of processes interactions; not much importance is given to internal computations. Processes refer to components that interact with each other. Interaction is synchronous or asynchronous message passing. 14

15 Knowledge sharing Initial state – (Kj q) (Ki p) Generated axioms Ki p → Ki Ki p (K4) Kj q → Kj Kj q (K4) ¬Ki p → Ki¬ p, (K3) ¬Kj q → Kj¬ q, (K3) ¬Ki¬ p → Ki p, (K2) ¬Kj¬ q → Kj q, (K2) Ki ¬ ¬ Kj q → Ki q, (K1) End State Ki ( p ۸ q ) → Ki q ۸ Ki p, (K6) Example properties: Data is always sent from the agent with the latest data to the other agent. Exactly one agent is the active knowledge sharer at any point of time. End process –insert end process

16 Related work on KM Knowledge management models Static KM models Computational models Diagramatic KM models Related work on Model Checking Agent communication Fairness, liveness, termination. Security of information.

17 Thank you!