Sotiris Batsakis, Kostas Stravoskoufos Euripides G.M. Petrakis Technical University Of Crete Intelligent Systems Laboratory.

Slides:



Advertisements
Similar presentations
SOTIRIS BATSAKIS EURIPIDES G.M. PETRAKIS TECHNICAL UNIVERSITY OF CRETE INTELLIGENT SYSTEMS LABORATORY Imposing Restrictions Over Temporal Properties in.
Advertisements

CH-4 Ontologies, Querying and Data Integration. Introduction to RDF(S) RDF stands for Resource Description Framework. RDF is a standard for describing.
Foundations of Constraint Processing Temporal Constraints Networks 1Topic Foundations of Constraint Processing CSCE421/821, Spring
Chronos: A Tool for Handling Temporal Ontologies in Protégé
Constraint Propagation Algorithms for Temporal Reasoning Marc Vilain, Henry Kautz (AAAI 1986) Presentation by Lin XU March 4, 2002.
Sotiris Batsakis, Euripides G.M. Petrakis Technical University Of Crete Intelligent Systems Laboratory.
Greedy Algorithms Greed is good. (Some of the time)
1 A Description Logic with Concrete Domains CS848 presentation Presenter: Yongjuan Zou.
1 NP-Complete Problems. 2 We discuss some hard problems:  how hard? (computational complexity)  what makes them hard?  any solutions? Definitions 
Of 27 lecture 7: owl - introduction. of 27 ece 627, winter ‘132 OWL a glimpse OWL – Web Ontology Language describes classes, properties and relations.
The Ramification and Qualification Problems in Temporal Databases Nikos Papadakis & Dimitris Plexousakis University of Crete and.
Multi-Phase Reasoning of temporal semantic knowledge Sakirulai O. Isiaq and Taha Osman School of Computer and Informatics Nottingham Trent University Nottingham.
Industrial Diagnostics Using Algebra of Uncertain Temporal Relations Vladimir Ryabov, Vagan Terziyan* IASTED-2003 Innsbruck, Austria.
CMPT 354, Simon Fraser University, Fall 2008, Martin Ester 52 Database Systems I Relational Algebra.
A First Practical Algorithm for High Levels of Relational Consistency Shant Karakashian, Robert Woodward, Christopher Reeson, Berthe Y. Choueiry & Christian.
Ontologies and the Semantic Web by Ian Horrocks presented by Thomas Packer 1.
Semantic Location Based Services for Smart Spaces Kostas Kolomvatsos, Vassilis Papataxiarhis, Vassileios Tsetsos P ervasive C omputing R esearch G roup.
A Graph-Oriented Model and Query Language for Events Miguel Romero University of Bío-Bío, Chile Andrea Rodríguez University.
Data Flow Analysis Compiler Design Nov. 8, 2005.
From SHIQ and RDF to OWL: The Making of a Web Ontology Language
I2RP Meeting26 Oct 2005 Temporal Aspects of Intelligent Multimedia Retrieval and Presentation Zhisheng Huang, Jacco van Ossenbruggen, and Lynda Hardman.
ANHAI DOAN ALON HALEVY ZACHARY IVES Chapter 12: Ontologies and Knowledge Representation PRINCIPLES OF DATA INTEGRATION.
CHOROS: IMPROVING THE PERFORMANCE OF QUALITATIVE SPATIAL REASONING IN OWL Nikolaos Mainas, Euripides G.M. Petrakis Technical University Of Crete (TUC),
ONTOLOGY SUPPORT For the Semantic Web. THE BIG PICTURE  Diagram, page 9  html5  xml can be used as a syntactic model for RDF and DAML/OIL  RDF, RDF.
New trends in Semantic Web Cagliari, December, 2nd, 2004 Using Standards in e-Learning Claude Moulin UMR CNRS 6599 Heudiasyc University of Compiègne (France)
Georgios Christodoulou, Euripides G.M. Petrakis, and Sotirios Batsakis Department of Electronic and Computer Engineering, Technical University of Crete.
TOWARDS INTEROPERABILITY IN TRACKING SYSTEMS: AN ONTOLOGY-BASED APPROACH Juan Gómez Romero Miguel A. Patricio Jesús García José M. Molina Applied A.I.
A Logic for Decidable Reasoning about Services Yilan Gu Dept. of Computer Science University of Toronto Mikhail Soutchanski Dept. of Computer Science Ryerson.
Temporal Data Management: Semantic Web Engineering Discussion Leader: Cui Tao Assistant Professor in Medical Informatics Mayo Clinic Temporal Reasoning.
Ming Fang 6/12/2009. Outlines  Classical logics  Introduction to DL  Syntax of DL  Semantics of DL  KR in DL  Reasoning in DL  Applications.
Copyright 2002 Prentice-Hall, Inc. Modern Systems Analysis and Design Third Edition Jeffrey A. Hoffer Joey F. George Joseph S. Valacich Chapter 20 Object-Oriented.
Building an Ontology of Semantic Web Techniques Utilizing RDF Schema and OWL 2.0 in Protégé 4.0 Presented by: Naveed Javed Nimat Umar Syed.
Ontology Summit 2015 Track C Report-back Summit Synthesis Session 1, 19 Feb 2015.
Fall 98 Introduction to Artificial Intelligence LECTURE 7: Knowledge Representation and Logic Motivation Knowledge bases and inferences Logic as a representation.
LDK R Logics for Data and Knowledge Representation ClassL (part 3): Reasoning with an ABox 1.
On Reducing the Global State Graph for Verification of Distributed Computations Vijay K. Garg, Arindam Chakraborty Parallel and Distributed Systems Laboratory.
Temporal Reasoning and Planning in Medicine Frame-Based Representations and Description Logics Yuval Shahar, M.D., Ph.D.
Rules, RIF and RuleML.
Temporal Constraint Management in Artificial Intelligence - Introduction: time & temporal constraints - The problem - Survey of AI approaches to temporal.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Simultaneously Learning and Filtering Juan F. Mancilla-Caceres CS498EA - Fall 2011 Some slides from Connecting Learning and Logic, Eyal Amir 2006.
A View-based Methodology for Collaborative Ontology Engineering (VIMethCOE) Ernesto Jiménez Ruiz Rafael Berlanga Llavorí Temporal Knowledge Bases Group.
LDK R Logics for Data and Knowledge Representation ClassL (Propositional Description Logic with Individuals) 1.
Semantic Web Final Exam Review. Topics for Final Exam First exam material (~30%) Design Patterns and Map/Reduce (~20%) Inference / Restrictions (~10%)
Conclusions Presenter: Manolis Koubarakis Extended Semantic Web Conference 2012.
Building Knowledge about Buildings Matt Young and Eyal Amir University of Illinois, Urbana-Champaign.
Ferdowsi University of Mashhad 1 Automatic Semantic Web Service Composition based on owl-s Research Proposal presented by : Toktam ghafarian.
Of 35 lecture 17: semantic web rules. of 35 ece 627, winter ‘132 logic importance - high-level language for expressing knowledge - high expressive power.
Web Ontology Language (OWL). OWL The W3C Web Ontology Language (OWL) is a Semantic Web language designed to represent rich and complex knowledge about.
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.
WonderWeb. Ontology Infrastructure for the Semantic Web. IST WP4: Ontology Engineering Heiner Stuckenschmidt, Michel Klein Vrije Universiteit.
GoRelations: an Intuitive Query System for DBPedia Lushan Han and Tim Finin 15 November 2011
1 Ontological Foundations For SysML Henson Graves September 2010.
Artificial Intelligence Logical Agents Chapter 7.
OWL (Ontology Web Language and Applications) Maw-Sheng Horng Department of Mathematics and Information Education National Taipei University of Education.
Rule-based Reasoning in Semantic Text Analysis
n-ary relations OWL modeling problem when n≥3
Design by Contract Jim Fawcett CSE784 – Software Studio
Design by Contract Jim Fawcett CSE784 – Software Studio
Knowledge Representation Part II Description Logic & Introduction to Protégé Jan Pettersen Nytun.
Consistency Methods for Temporal Reasoning
THE TOWL ONTOLOGY LANGUAGE
Relational Algebra 461 The slides for this text are organized into chapters. This lecture covers relational algebra, from Chapter 4. The relational calculus.
Ontology.
ece 720 intelligent web: ontology and beyond
Zachary Cleaver Semantic Web.
6-1 Solving Systems by Graphing
TOQL: Temporal Ontology Querying Language E. Baratis, E. G. M
Ontology.
Indicator 16 System of Equations.
Presentation transcript:

Sotiris Batsakis, Kostas Stravoskoufos Euripides G.M. Petrakis Technical University Of Crete Intelligent Systems Laboratory

 Representing evolution of information in time using OWL  Temporal relations involve at least three arguments ◦ OWL represents binary relations  Existing approaches: Temporal RDF, Named Graphs, Reification, Versioning, N-ary, 4D-fluents ◦ No qualitative information ◦ Limited OWL reasoning support  Q uerying of temporal information is also a problem  We propose a solution to all these problems based on 4D-fluents and N-ary relations. Techical University Of Crete Intelligent Systems Laboratory2

 Classes TimeSlice, TimeInterval are introduced  Dynamic objects become instances of TimeSlice  Temporal properties of dynamic classes become instances of TimeInterval  A time slice object is created each time a (fluent) property changes 3

Techical University Of Crete Intelligent Systems Laboratory4

 Dynamic Properties are attached to reified objects representing events  Dynamic properties are represented as properties and not as objects of properties as in reification  Event objects ◦ Attached to specific static objects ◦ Connect to Time Intervals 5

Techical University Of Crete Intelligent Systems Laboratory6

 Advantages ◦ Changes affect only related dynamic objects, not the entire ontology ◦ Reasoning mechanisms and semantics of OWL fully supported ◦ OWL 2.0 compatible  Disadvantages ◦ Proliferation of objects Techical University Of Crete Intelligent Systems Laboratory7

 Information: Points, intervals  Quantitative and Qualitative information  Qualitative Allen Relations (e.g., Before, After) are supported ◦ Qualitative relations connect temporal intervals ◦ Intervals with unknown endpoints ◦ Interval relations are translated into point relations (Before, After, Equals) Techical University Of Crete Intelligent Systems Laboratory8

9

 Infer new relations from existing ones ◦ Before(x,y) AND Before(y,z)  Before(x,z)  Problem 1: Reasoning over a mix of qualitative and quantitative information is a problem ◦ Extract qualitative relations from quantitative ones ◦ Reasoning over qualitative information  Problem 2: Assertions may be inconsistent or new assertions may take exponential time to compute  Solution: Restrict to tractable sets decided by polynomial algorithms such as Path Consistency [ van Beek & Cohen 1990]

 Path Consistency suggests composing and intersecting relations until: ◦ A fixed point is reached (no additional inferences can be made) ◦ An empty relation is yielded implying inconsistent assertions  Path Consistency is tractable, sound and complete for specific sets of temporal relations Techical University Of Crete Intelligent Systems Laboratory11

 Compositions and intersections of relations are defined and implemented in SWRL:  Before(x,y) AND Equals(y,z)  Before(x,z)  (Before(x,y) OR Equals(x,y)) AND (After(x,y) OR Equals(x,y))  Equals(x,y) Techical University Of Crete Intelligent Systems Laboratory12

 SPARQL-like query language supporting temporal operators SELECT ?x, ?y… Where { ?x property ?y… At(date)…}  Additional operators are introduced to SPARQL ◦ AT, ALWAYS_AT, SOMETIMES_AT ◦ Allen operators

Temporal Operators  AT specifies time instants for which fluent properties hold true  ALWAYS_AT, SOMETIMES_AT: Return intervals that fluent always or sometime holds.  Allen’s operators: BEFORE, AFTER, MEETS, METBY, OVERLAPS, OVERLAPPEDBY, DURING, CONTAINS, STARTS, STARTEDBY, ENDS, ENDEDBY and EQUALS Techical University Of Crete Intelligent Systems Laboratory14

SELECT ?x,?y WHERE {?x has-employee ?y AT “ ” } Techical University Of Crete Intelligent Systems Laboratory15

SELECT ?x,?y WHERE {?x has-employee ?y BEFORE company1 has-employee ?y } Techical University Of Crete Intelligent Systems Laboratory16

 We extended 4D-fluents and N-ary relations for representing evolution of qualitative (in adition to quantitative) temporal information in OWL ontologies  Offers temporal reasoning support over qualitative and quantitative relations  Querying support by extending SPARQL with additional temporal operators Techical University Of Crete Intelligent Systems Laboratory17

 Extending representation-query language for spatial information [Batsakis & Petrakis, RuleML 2011]  Optimizations for large scale applications Techical University Of Crete Intelligent Systems Laboratory18

Questions ?