1 CIS607, Fall 2005 Semantic Information Integration Presentation by Zebin Chen Week 7 (Nov. 9)

Slides:



Advertisements
Similar presentations
Dr. Leo Obrst Information Semantics Command & Control Center July 17, 2007 Ontologies Can't Help Records Management Or Can They?
Advertisements

Critical Reading Strategies: Overview of Research Process
Schema Matching and Query Rewriting in Ontology-based Data Integration Zdeňka Linková ICS AS CR Advisor: Július Štuller.
Background information Formal verification methods based on theorem proving techniques and model­checking –to prove the absence of errors (in the formal.
ISBN Chapter 3 Describing Syntax and Semantics.
1 Semantic Description of Programming languages. 2 Static versus Dynamic Semantics n Static Semantics represents legal forms of programs that cannot be.
Reducing the Cost of Validating Mapping Compositions by Exploiting Semantic Relationships Eduard C. Dragut Ramon Lawrence Eduard C. Dragut Ramon Lawrence.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
PR-OWL: A Framework for Probabilistic Ontologies by Paulo C. G. COSTA, Kathryn B. LASKEY George Mason University presented by Thomas Packer 1PR-OWL.
1 CIS607, Fall 2004 Semantic Information Integration Presentation by Xiangkui Yao Week 6 (Nov. 3)
1 CIS607, Fall 2004 Semantic Information Integration Presentation by Julian Catchen Week 3 (Oct. 13)
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Dong Hwi Kwak Week 5 (Oct. 26)
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Dayi Zhou Week 4 (Oct. 19)
1 CIS607, Fall 2005 Semantic Information Integration Instructor: Dejing Dou Week 2 (Oct. 5)
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
Where are the Semantics in the Semantic Web? Michael Ushold The Boeing Company.
Knowledge Acquisitioning. Definition The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
Computing & Information Sciences Kansas State University Lecture 11 of 42 CIS 530 / 730 Artificial Intelligence Lecture 11 of 42 William H. Hsu Department.
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Paea LePendu Week 8 (Nov. 16)
CS 330 Programming Languages 09 / 18 / 2007 Instructor: Michael Eckmann.
1 CIS607, Fall 2006 Semantic Information Integration Instructor: Dejing Dou Week 10 (Nov. 29)
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Enrico Viglino Week 3 (Oct. 12)
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Jiawei Rong Week 10 (Nov. 30)
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Shiwoong Kim Week 9 (Nov. 23)
Basic Scientific Writing in English Lecture 3 Professor Ralph Kirby Faculty of Life Sciences Extension 7323 Room B322.
Logical Agents Chapter 7 Feb 26, Knowledge and Reasoning Knowledge of action outcome enables problem solving –a reflex agent can only find way from.
CS 330 Programming Languages 09 / 16 / 2008 Instructor: Michael Eckmann.
11/8/20051 Ontology Translation on the Semantic Web D. Dou, D. McDermott, P. Qi Computer Science, Yale University Presented by Z. Chen CIS 607 SII, Week.
Lesson 6. Refinement of the Operator Model This page describes formally how we refine Figure 2.5 into a more detailed model so that we can connect it.
1 CIS607, Fall 2004 Semantic Information Integration Presentation by Xiaofang Zhang Week 7 (Nov. 10)
Describing Syntax and Semantics
Ontology translation: two approaches Xiangkui Yao OntoMorph: A Translation System for Symbolic Knowledge By: Hans Chalupsky Ontology Translation on the.
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Amanda Hosler Week 6 (Nov. 2)
Semantic Web Technologies Lecture # 2 Faculty of Computer Science, IBA.
Web Explanations for Semantic Heterogeneity Discovery Pavel Shvaiko 2 nd European Semantic Web Conference (ESWC), 1 June 2005, Crete, Greece work in collaboration.
Katanosh Morovat.   This concept is a formal approach for identifying the rules that encapsulate the structure, constraint, and control of the operation.
LinearRelationships Jonathan Naka Intro to Algebra Unit Portfolio Presentation.
Author: William Tunstall-Pedoe Presenter: Bahareh Sarrafzadeh CS 886 Spring 2015.
1 Program Correctness CIS 375 Bruce R. Maxim UM-Dearborn.
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
Computing & Information Sciences Kansas State University Wednesday, 20 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 12 of 42 Wednesday, 20 September.
UNCERTML - DESCRIBING AND COMMUNICATING UNCERTAINTY WITHIN THE (SEMANTIC) WEB Matthew Williams
Computing & Information Sciences Kansas State University Lecture 13 of 42 CIS 530 / 730 Artificial Intelligence Lecture 13 of 42 William H. Hsu Department.
3.2 Semantics. 2 Semantics Attribute Grammars The Meanings of Programs: Semantics Sebesta Chapter 3.
Majid Sazvar Knowledge Engineering Research Group Ferdowsi University of Mashhad Semantic Web Reasoning.
Learning to Share Meaning in a Multi-Agent System (Part I) Ganesh Padmanabhan.
CPSC 322, Lecture 19Slide 1 (finish Planning) Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt – 5.2) Oct,
Notes for Week 11 Term project evaluation and tips 3 lectures before Final exam Discussion questions for this week.
© Copyright 2008 STI INNSBRUCK Intelligent Systems Propositional Logic.
Computing & Information Sciences Kansas State University Lecture 12 of 42 CIS 530 / 730 Artificial Intelligence Lecture 12 of 42 William H. Hsu Department.
Formal Verification. Background Information Formal verification methods based on theorem proving techniques and model­checking –To prove the absence of.
A Portrait of the Semantic Web in Action Jeff Heflin and James Hendler IEEE Intelligent Systems December 6, 2010 Hyewon Lim.
1 Propositional Logic Limits The expressive power of propositional logic is limited. The assumption is that everything can be expressed by simple facts.
Review: What is a logic? A formal language –Syntax – what expressions are legal –Semantics – what legal expressions mean –Proof system – a way of manipulating.
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.
1 Integrating Databases into the Semantic Web through an Ontology-based Framework Dejing Dou, Paea LePendu, Shiwoong Kim Computer and Information Science,
©2003 Paula Matuszek CSC 9010: AeroText, Ontologies, AeroDAML Dr. Paula Matuszek (610)
1 Ontological Foundations For SysML Henson Graves September 2010.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
Common MBSE Modeling Questions and How Ontology Helps
Integrating SysML with OWL (or other logic based formalisms)
Computer Science cpsc322, Lecture 20
Topics Covered since 1st midterm…
Ontology.
Computer Science cpsc322, Lecture 20
Chapter 4 Summary.
ONTOMERGE Ontology translations by merging ontologies Paper: Ontology Translation on the Semantic Web by Dejing Dou, Drew McDermott and Peishen Qi 2003.
Representations & Reasoning Systems (RRS) (2.2)
CS 188: Artificial Intelligence Fall 2008
Presentation transcript:

1 CIS607, Fall 2005 Semantic Information Integration Presentation by Zebin Chen Week 7 (Nov. 9)

2 Questions from Homework 5 About inference approach? – Limiting the complexity of facts generated in inference, as well as the direction provided (I assume that unreasonable seeming paths are not followed) pretty much guarantees missing some valid bindings, doesn ’ t it? -- Enrico – What type of direction do you give? Is this what is going on in the backward chaining to bind variables? It seems that any fact would eventually be generated by undirected forward chaining. – Enrico – What is 'equality substitution? ‘ – Shiwoong – Could you explain forward chaining and backward chaining algorithms in more details? -- Jiawei

3 Questions from Homework 5 (cont ’ d) About the axioms? – Can the same relationship be expressed in different sets of bridging-axioms? If so, will the translated results be different? -- Dayi – How would one develop a consistency checker for bridging axioms, and what kind of techniques might it use? – Shiwoong – In page 966, (P ?x) ^ (member ? x[c1,c2,c3]) => (Q ?x). What is the meaning of backward chaining? – DongHwi – What is does logically complete mean? i.e. why isn't covering all terms from the source ontologies so that they are represented correctly in the target ontology logically complete? -- Amanda

4 Questions from Homework 5 (cont ’ d) About the OntoMerge. – Are those bridging-axioms automatically generated, or some domain experts need to write them? Can those methods for finding ontology mappings be used here (they probably can be used to generate those simple bridging-axioms)? If so, are they already plugged in or there is a plan for that? -- Dayi – In the following web site ( translation.html), we can get merged ontology of Airport ontology and Map ontology. After generating merged ontology, how can we practically use this merged ontology? -- DongHwi

5 Questions from Homework 5 (cont ’ d) Other questions about this paper: – Have you been following up on this path? Anything new and exciting along it? – Enrico – In the experiments of querying through different ontologies, do you have any experimental results -- Jiawei – So...the difference between ontology mapping and ontology merging is that ontology mapping is the correspondences between concepts in two ontologies, and ontology merging is using inference to describe more complicated correspondences between concepts in two ontologies? Or what? – Amanda – I do not yet understand the significance of generating ontology extensions. Is this an important problem with real applications? -- Paea

6 Questions from Homework 5 (cont ’ d) Other questions about this paper: – In section 1.2 is the claim: "...the querying agent doesn't need to specify which knowledge base(s) can answer it's query, it also doesn't need to know what ontologies..." But the paper also assumes that ontologies will eventually exist in large numbers. This raises some significant searching and bottleneck problems, doesn't it? The translation service has the difficult burden of identifying which ontologies apply for a given problem. If there are many ontologies, and they are distributed, then this problem is even more difficult. It reminds me of the DNS problem of networking. How will this problem be addressed? – Paea –. In section 2.2 the last two or three paragraphs make some very fundamental claims about the expressivity and power of the techniques used. Is there any theory or evidence supporting these claims? – Paea – Finally, how to you verify your results of translation or query answering? What is your criteria for success and how do you verify it? Do you just use a "gold standard" or is there a formal proof of correctness? -- Paea