1 A Semantic Metanetwork Vagan Terziyan University of Jyvaskyla, Finland

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Similarity Evaluation Techniques for Filtering Problems ? Vagan Terziyan University of Jyvaskyla
Ontologies: Dynamic Networks of Formally Represented Meaning Dieter Fensel: Ontologies: Dynamic Networks of Formally Represented Meaning, 2001 SW Portal.
Logic Programming Automated Reasoning in practice.
Positive Algebra From arithmetic to algebra Jaap den Hertog Freudenthal Instituut Universiteit Utrecht
Industrial Diagnostics Using Algebra of Uncertain Temporal Relations Vladimir Ryabov, Vagan Terziyan* IASTED-2003 Innsbruck, Austria.
1 Public Commerce brief introduction of the concept Vagan Terziyan University of Jyvaskyla, Finland
TLI371 – Distributed Artificial Intelligence in Mobile Environment Course Introduction Vagan Terziyan Department of Mathematical Information Technology.
1 MetaPetrinets brief introduction to the concept Vagan Terziyan University of Jyvaskyla, Finland
University of Jyväskylä An Observation Framework for Multi-Agent Systems Joonas Kesäniemi, Artem Katasonov * and Vagan Terziyan University of Jyväskylä,
Predictive and Contextual Feature Separation for Bayesian Metanetworks Vagan Terziyan Industrial Ontologies Group, University of Jyväskylä,
Models -1 Scientists often describe what they do as constructing models. Understanding scientific reasoning requires understanding something about models.
A Similarity Evaluation Technique for Data Mining with Ensemble of Classifiers Seppo Puuronen, Vagan Terziyan International Workshop on Similarity Search.
Industrial Ontologies Group Oleksiy Khriyenko, Vagan Terziyan INDIN´04: 24th – 26th June, 2004, Berlin, Germany OntoSmartResource: An Industrial Resource.
Industrial Ontologies Group: our history and team Vagan Terziyan, Group Leader Industrial Ontologies Group Agora Center, University of Jyväskylä.
Temporal Knowledge Acquisition From Multiple Experts by Helen Kaikova, Vagan Terziyan.
An Interval Approach to Discover Knowledge from Multiple Fuzzy Estimations Vagan Terziyan * & **, Seppo Puuronen **, Helen Kaikova * *Department of Artificial.
AAECC’99 Honolulu November 1999 Flexible Arithmetic for Huge Numbers with Recursive Series of Operations Vagan Terziyan*, Alexey Tsymbal**, Seppo Puuronen**
A Technique for Advanced Dynamic Integration of Multiple Classifiers Alexey Tsymbal*, Seppo Puuronen**, Vagan Terziyan* *Department of Artificial Intelligence.
21 21 Web Content Management Architectures Vagan Terziyan MIT Department, University of Jyvaskyla, AI Department, Kharkov National University of Radioelectronics.
Copyright ©2009 Opher Etzion Event Processing Course Lecture 10 – Focal points on challenging topics (related to chapter 11)
Mining Several Databases with an Ensemble of Classifiers Seppo Puuronen Vagan Terziyan Alexander Logvinovsky 10th International Conference and Workshop.
Bayesian Metanetworks for Context-Sensitive Feature Relevance Vagan Terziyan Industrial Ontologies Group, University of Jyväskylä, Finland.
Kmi.open.ac.uk Semantic Execution Environments Service Engineering and Execution Barry Norton and Mick Kerrigan.
A Similarity Evaluation Technique for Cooperative Problem Solving with a Group of Agents Seppo Puuronen, Vagan Terziyan Third International Workshop CIA-99.
Intelligent Web Applications (Part 1) Course Introduction Vagan Terziyan AI Department, Kharkov National University of Radioelectronics / MIT Department,
1 The Law of Semantic Balance brief introduction of the concept Vagan Terziyan University of Jyvaskyla, Finland
Approaching Web-Based Expertise with Semantic Web Kimmo Salmenjoki: Department of Computer Science, University of Vaasa, Vagan Terziyan: Department.
ONTOLOGY-BASED INTERNATIONAL DEGREE RECOGNITION Vagan Terziyan, Olena Kaykova University of Jyväskylä, Finland Oleksandra Vitko, Lyudmila Titova (speaker)
Intelligent Web Applications (Part 1) Course Introduction Vagan Terziyan AI Department, Kharkov National University of Radioelectronics / MIT Department,
© 2014 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
MTH 232 Section 8.1 Algebraic Expressions, Functions, & Equations.
Semantic Web Technologies Lecture # 2 Faculty of Computer Science, IBA.
Chapter 1 Section 6 Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
A Generative and Model Driven Framework for Automated Software Product Generation Wei Zhao Advisor: Dr. Barrett Bryant Computer and Information Sciences.
Artificial Intelligence: Definition “... the branch of computer science that is concerned with the automation of intelligent behavior.” (Luger, 2009) “The.
A service-oriented middleware for building context-aware services Center for E-Business Technology Seoul National University Seoul, Korea Tao Gu, Hung.
Guide to State Transition Diagram. 2 Contents  What is state transition diagram?  When is state transition diagram used?  What are state transition.
Web Usage Mining for Semantic Web Personalization جینی شیره شعاعی زهرا.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
©Ferenc Vajda 1 Semantic Grid Ferenc Vajda Computer and Automation Research Institute Hungarian Academy of Sciences.
First-Order Logic Introduction Syntax and Semantics Using First-Order Logic Summary.
Beginning Algebra 5.1 The Greatest Common Factor and Factoring by Grouping.
Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Three Basic Functions are generally noted: there is perhaps nothing more subtle than language is, and nothing has as many different uses. Without a doubt,
Basic Principles (continuation) 1. A Quantitative Measure of Information As we already have realized, when a statistical experiment has n eqiuprobable.
Knowledge Representation
1 UNIT-3 KNOWLEDGE REPRESENTATION. 2 Agents that reason logically(Logical agents) A Knowledge based Agent The Wumpus world environment Representation,
1-1 © 2008 Pearson Prentice Hall. All rights reserved Chapter 1 Real Numbers and Algebraic Expressions Active Learning Questions.
Of 29 lecture 15: description logic - introduction.
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.
From NARS to a Thinking Machine Pei Wang Temple University.
Artificial Intelligence Knowledge Representation.
Definition and Technologies Knowledge Representation.
ETHOS, LOGOS, & PATHOS Expos Comp.
Artificial Intelligence Logical Agents Chapter 7.
1.1 – SETS AND SYMBOLS. Goals SWBAT understand basic set notation and set symbols SWBAT solve simple sentences with a given domain SWBAT graph sets of.
Simple Logic.
ece 720 intelligent web: ontology and beyond
The number of times a number or expression (called a base) is used as a factor of repeated multiplication. Also called the power. 5⁴= 5 X 5 X 5 X 5 = 625.
Knowledge Representation
PROGRAMMING IN HASKELL
PROGRAMMING IN HASKELL
Formal Methods in software development
第二章 交际与跨文化交际 Communication & Intercultural communication
Higher Order Functions
Expert System Dr. Khoerul Anwar, S.T.,M.T STMIK Pradnya Paramita
PROGRAMMING IN HASKELL
Presentation transcript:

1 A Semantic Metanetwork Vagan Terziyan University of Jyvaskyla, Finland

2 Creating and Managing Knowledge According to Different Levels of Possible Context - are among the basic abilities of an intelligent agent Data Knowledge Contexts Metacontexts Metaknowledge Meta-metaknowledge

3 Contents 4 Metasemantics 4 Metasemantic Network 4 Metasemantic Algebra of Contexts

4 Metasemantics

5 Semantic Predicate AiAi AjAj LkLk AiAi LkLk Relation (i  j) Property (i = j)

6 State of a Semantic Net

7 Structure of the Metasemantics Production Rules Temporal Rules Semantic Rules Semantic Network Metasemantics

8 Read more about Metasemantics in Terziyan V., Multilevel Models for Knowledge Bases Control and Their Applications to Automated Information Systems, Doctor of Technical Sciences Degree Thesis, Kharkov State Technical University of Radioelectronics, 1993.

9 Metasemantic Networks

10 Metasemantic Network (Semantic Metanetwork) is considered formally as the set of semantic networks, which are put on each other in such a way that links of every previous semantic network are in the same time nodes of the next network A Metasemantic Network

11 An Example of a Semantic Metanetwork

12 How it Works In a Semantic Metanetwork every higher level controls semantic structure of the lower level. Simple controlling rules might be, for example, in what contexts certain link of a semantic structure can exist and in what context it should be deleted from the semantic structure. Such multilevel network can be used in an adaptive control system which structure is automatically changed following changes in a context of the environment. The algebra for reasoning with a semantic metanetwork is also developed.

13 Published and Further Developed in Terziyan V., Multilevel Models for Knowledge Bases Control and Their Applications to Automated Information Systems, Doctor of Technical Sciences Degree Thesis, Kharkov State Technical University of Radioelectronics, Terziyan V., Puuronen S., Reasoning with Multilevel Contexts in Semantic Metanetworks, In: P. Bonzon, M. Cavalcanti, R. Nossun (Eds.), Formal Aspects in Context, Kluwer Academic Publishers, 2000, pp

14 Metasemantic Algebra of Contexts

15 Semantic predicate describes a piece of knowledge (relation or property) by the expression: if there is knowledge that a relation with name L k holds between objects A i and A j Metasemantic Algebra: A Semantic Predicate

16 Example of Knowledge

17 Semantic Operations: Inversion

18 Semantic Operations: Negation P(,, ) = false, it is the same as: P(,, ) = true.

19 Semantic Operations: Composition If it is true: P(,, ) and P(,, ), then it is also true that: P(,, ).

20 Semantic Operations: Intersection + =.

21 Semantic Operations: Interpretation

22 Interpreting Knowledge in a Context

23 Example of Interpretation The interpreted knowledge about the relation between A 1 and A 3 taking all contexts and metacontexts into account is as follows:

24 Decontextualization Suppose that your colleague, whose context you know well, has described you a situation. You use knowledge about context of this person to interpret the “real” situation. Example is more complicated if several persons describe you the same situation. In this case, the context of the situation is the semantic sum over all personal contexts.

25 Context Recognition Suppose that someone sends you a message describing the situation that you know well. You compare your own knowledge with the knowledge you received. Usually you can derive your opinion about the sender of this letter. Knowledge about the source of the message, you derived, can be considered as certain context in which real situation has been interpreted and this can help you to recognize a source or at least his motivation to change the reality.

26 Lifting (Relative Decontextualization) This means deriving knowledge interpreted in some context if it is known how this knowledge was interpreted in another context.

27 Published and Further Developed in Terziyan V., Multilevel Models for Knowledge Bases Control and Their Applications to Automated Information Systems, Doctor of Technical Sciences Degree Thesis, Kharkov State Technical University of Radioelectronics, Terziyan V., Puuronen S., Reasoning with Multilevel Contexts in Semantic Metanetworks, In: P. Bonzon, M. Cavalcanti, R. Nossun (Eds.), Formal Aspects in Context, Kluwer Academic Publishers, 2000, pp