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

Slides:



Advertisements
Similar presentations
Charting the Potential of Description Logic for the Generation of Referring Expression SELLC, Guangzhou, Dec Yuan Ren, Kees van Deemter and Jeff.
Advertisements

Ontologies and Databases Ian Horrocks Information Systems Group Oxford University Computing Laboratory.
SPARQL Dimitar Kazakov, with references to material by Noureddin Sadawi ARIN, 2014.
An Introduction to Description Logics
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.
April 15, 2004SPIE1 Association in Level 2 Fusion Mieczyslaw M. Kokar Christopher J. Matheus Jerzy A. Letkowski Kenneth Baclawski Paul Kogut.
Ontological Logic Programming by Murat Sensoy, Geeth de Mel, Wamberto Vasconcelos and Timothy J. Norman Computing Science, University of Aberdeen, UK 1.
Sotiris Batsakis, Euripides G.M. Petrakis Technical University Of Crete Intelligent Systems Laboratory.
1 A Description Logic with Concrete Domains CS848 presentation Presenter: Yongjuan Zou.
The International RuleML Symposium on Rule Interchange and Applications Local and Distributed Defeasible Reasoning in Multi-Context Systems Antonis Bikakis,
Based on “A Practical Introduction to Ontologies & OWL” © 2005, The University of Manchester A Practical Introduction to Ontologies & OWL Session 3: Additional.
Of 27 lecture 7: owl - introduction. of 27 ece 627, winter ‘132 OWL a glimpse OWL – Web Ontology Language describes classes, properties and relations.
Sotiris Batsakis, Kostas Stravoskoufos Euripides G.M. Petrakis Technical University Of Crete Intelligent Systems Laboratory.
Ontology development in Protégé. Lecture 2 Introduction to Protégé 2 Pablo Romero, Department of Informatics Overview Components of an ontology The ontology.
From SHIQ and RDF to OWL: The Making of a Web Ontology Language
The Semantic Web – WEEK 10: Introduction to Description Logics The “Layer Cake” Model – [From Rector & Horrocks Semantic Web cuurse] We are back down to.
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),
A Really Brief Crash Course in Semantic Web Technologies Rocky Dunlap Spencer Rugaber Georgia Tech.
Georgios Christodoulou, Euripides G.M. Petrakis, and Sotirios Batsakis Department of Electronic and Computer Engineering, Technical University of Crete.
An Introduction to Description Logics. What Are Description Logics? A family of logic based Knowledge Representation formalisms –Descendants of semantic.
8/11/2011 Web Ontology Language (OWL) Máster Universitario en Inteligencia Artificial Mikel Egaña Aranguren 3205 Facultad de Informática Universidad Politécnica.
A Z Approach in Validating ORA-SS Data Models Scott Uk-Jin Lee Jing Sun Gillian Dobbie Yuan Fang Li.
Ming Fang 6/12/2009. Outlines  Classical logics  Introduction to DL  Syntax of DL  Semantics of DL  KR in DL  Reasoning in DL  Applications.
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.
OWL 2 in use. OWL 2 OWL 2 is a knowledge representation language, designed to formulate, exchange and reason with knowledge about a domain of interest.
ISURF -An Interoperability Service Utility for Collaborative Supply Chain Planning across Multiple Domains Prof. Dr. Asuman Dogac METU-SRDC Turkey METU.
An Introduction to Description Logics (chapter 2 of DLHB)
Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Description Logics: Logic foundation of Semantic Web Semantic.
Semantic Web - an introduction By Daniel Wu (danielwujr)
Updating ABoxes in DL-Lite D. Calvanese, E. Kharlamov, W. Nutt, D. Zheleznyakov Free University of Bozen-Bolzano AMW 2010, May 2010.
More on Description Logic(s) Frederick Maier. Note Added 10/27/03 So, there are a few errors that will be obvious to some: So, there are a few errors.
1 Artificial Intelligence Applications Institute Centre for Intelligent Systems and their Applications Stuart Aitken Artificial Intelligence Applications.
© O. Corcho, MC Suárez de Figueroa Baonza 1 OWL and SWRL Protégé 4: Building an OWL Ontology Mari Carmen Suárez-Figueroa, Oscar Corcho {mcsuarez,
CHAPTER 3 FUZZY RELATION and COMPOSITION. 3.1 Crisp relation Product set Definition (Product set) Let A and B be two non-empty sets, the product.
OilEd An Introduction to OilEd Sean Bechhofer. Topics we will discuss Basic OilEd use –Defining Classes, Properties and Individuals in an Ontology –This.
Organization of the Lab Three meetings:  today: general introduction, first steps in Protégé OWL  November 19: second part of tutorial  December 3:
1 Comparison and Combination of the Expressive Power of Description Logics and Logic Programs Jidi (Judy) Zhao December 7, 2015.
DL Overview Second Pass Ming Fang 06/19/2009. Outlines  Description Languages  Knowledge Representation in DL  Logical Inference in DL.
Ontology Engineering Lab #5 – September 30, 2013.
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%)
ece 627 intelligent web: ontology and beyond
ONTOLOGY ENGINEERING Lab #4 - September 22, 2014.
Ontology Engineering Lab #4 - September 23, 2013.
Of 35 lecture 17: semantic web rules. of 35 ece 627, winter ‘132 logic importance - high-level language for expressing knowledge - high expressive power.
Relations and Functions ORDERED PAIRS AND CARTESIAN PRODUCT An ordered pair consists of two elements, say a and b, in which one of them, say a is designated.
ΑΝΑΠΑΡΑΣΤΑΣΗ ΓΝΩΣΗΣ ΣΤΟΝ ΠΑΓΚΟΣΜΙΟ ΙΣΤΟ OWL. RDF-RDFS Limitations Binary ground predicates Only subclass & subproperty hierarchy Domain and range definitions.
BioHealth Informatics Group Copyright © 2005, The University of Manchester1 A Practical Introduction to Ontologies & OWL Additional Exercises: Common Errors.
Presented by Kyumars Sheykh Esmaili Description Logics for Data Bases (DLHB,Chapter 16) Semantic Web Seminar.
Scalable and E ffi cient Reasoning for Enforcing Role-Based Access Control Tyrone Cadenhead Advisors: Murat Kantarcioglu, and.
LDK R Logics for Data and Knowledge Representation Description Logics: family of languages.
Ontology Technology applied to Catalogues Paul Kopp.
Ccs.  Ontologies are used to capture knowledge about some domain of interest. ◦ An ontology describes the concepts in the domain and also the relationships.
© Tata Consultancy Services ltd.12 June Metadata and Data Standards Levels of Metadata C. Anantaram Innovation Lab.
OWL (Ontology Web Language and Applications) Maw-Sheng Horng Department of Mathematics and Information Education National Taipei University of Education.
ece 720 intelligent web: ontology and beyond
Jie Bao, Doina Caragea and Vasant G Honavar
ece 720 intelligent web: ontology and beyond
ece 720 intelligent web: ontology and beyond
TOQL: Temporal Ontology Querying Language E. Baratis, E. G. M
Scalable and Efficient Reasoning for Enforcing Role-Based Access Control
Ontology.
Scalable and Efficient Reasoning for Enforcing Role-Based Access Control
Ontologies and Databases
Logics for Data and Knowledge Representation
Scalable and Efficient Reasoning for Enforcing Role-Based Access Control
A Tutorial Summary of Description Logic and Hybrid Rules
CIS Monthly Seminar – Software Engineering and Knowledge Management IS Enterprise Modeling Ontologies Presenter : Dr. S. Vasanthapriyan Senior Lecturer.
Presentation transcript:

SOTIRIS BATSAKIS EURIPIDES G.M. PETRAKIS TECHNICAL UNIVERSITY OF CRETE INTELLIGENT SYSTEMS LABORATORY Imposing Restrictions Over Temporal Properties in OWL: A Rule Based Approach

Introduction Temporal Properties are not binary Representation in OWL involves additional objects Cardinality restrictions over temporal properties cannot apply directly A rule based approach is proposed Two different interpretations of restrictions over temporal properties Technical University of Crete

Motivation OWL property semantics Domains, Ranges, Subproperty, Equivalence, Symmetric, Assymetric, Functional, Inverse Functional, Reflexive, Irreflexive, Disjoint, Transitive OWL property restrictions All values from, Some Values From, Intersection, Union, Min Cardinallity, Max Cardinality, Exact Cardinality Representation of temporal properties affects their semantics and restrictions Technical University of Crete

Temporal Representation (N-ary) ProfessorCourse ProfessorTeaching Course Interval teaches Technical University of Crete

Temporal Representation (4D-fluents) ProfessorCourse Professor TimeSlice Course Timeslice Interval teaches timesliceOf interval Technical University of Crete

Property Restrictions & Semantics Domains-Ranges are adjusted Domain timesliceOf Professor Range timesliceOf Course Property Semantics Retained Symmetric, Equivalent, Reflexive, Subproperty Course TimeSlice Professor Timeslice Course Professor Interval teaches Technical University of Crete

Property Restrictions Problems Cardinality Restrictions (min, max, exact) Imposing cardinality on new property affects meaning (many timeslices, perhaps for overlapping intervals exist) Imposing restriction on property chains is not supported because it leads to undecidability (Horrocks et.al. Practical Reasoning for Expressive Description Logics, 1999). Course TimeSlice Professor TimeSLice Course Professor Interval Technical University of Crete

Imposing Cardinality Restrictions SWRL DL safe rules are applied Decidability is retained, supported by reasoners (e.g. Pellet) Rules apply only on named individuals (ABox) and not class descriptions (TBox) into the ontology Open world assumption is adopted, thus min cardinality restrictions cannot be directly applied. Restrictions have two different interpretations On the entire existence of the object On every specific temporal interval Technical University of Crete

First Interpretation-entire existence A professor cant teach more than n different courses in his career: Professor(x) (timesliceOf(x 1, x) … timesliceOf(x n+1,x) teaches(x 1, y1) teaches(x n+1, y n+1 ) timesliceOf(y 1,z 1 )… timesliceOf(y n+1, z n+1 ) Alldifferent(z 1, z 2,…, z n+1 ) Course(z 1 )… error(x, z 1 ) Rule directly detects inconsistencies for max cardinality For min cardinality a similar rule asserts which individuals are related with more than n objects, and a SPARQL query detects individuals without the assertion. Technical University of Crete

Second Interpretation-every interval A professor cant teach more than n different courses simultaneously : Professor(x) (timesliceOf(x 1, x) … timesliceOf(x n+1,x) teaches(x 1, y1) teaches(x n+1, y n+1 ) timesliceOf(y 1,z 1 )… hasinterval(x 1,w 1 )… hasinterval(x n+1,w n+1 ) timesliceOf(y n+1, z n+1 ) Alldifferent(z 1, z 2,…, z n+1 ) pairwiseoverlapping(w 1, …w n+1 ) Course(z 1 )… error(x, z 1 ) Rule directly detects inconsistencies for max cardinality Detecting overlapping intervals is achieved using temporal reasoning rules (S. Batsakis and E.G.M. Petrakis. SOWL: A Framework for Handling Spatio-Temporal Information in OWL 2.0, RuleML 2011) Technical University of Crete

Temporal Reasoning Implemented in SWRL Applies on interval Allens relations (e.g., before, after, overlaps) Based on Path Consistency Intersects and composes existing relations until no rules apply or inconsistency is detected Example Composition During(x,y) Meets(y,z) Before(x,z) Example Intersection (Before(x,y) OR Meets(x,y)) Meets(x,y) Meets(x,y) Tractable Sound and Complete for specific sets of temporal relations Technical University of Crete

Additional Property Semantics Functional and Inverse functional are handled as at most one cardinality restrictions Asymmetric: This is handled as a cardinality restriction, where the same property cannot hold for interchanged subjects and objects for timeslices with overlapping intervals. Irreflexive: This is handled as a cardinality restriction; two timeslices of an object cannot be related with the property. Transitive: Fluent properties are declared transitive since related timeslices must have equal intervals (by the definition of the 4D-fluent model) and for these intervals transitivity is applied. Technical University of Crete

Contributions and limitations Contributions Offer support for property restrictions and semantics over temporal representations in OWL Rule based approach that retains decidability Compliance with existing standards and tools (OWL, SWRL, Pellet) Limitations Applies only on named individuals Exponential to the number of the cardinality restriction at hand (e.g. at most n rule is exponential to n) Technical University of Crete

Future Work Detecting the maximal decidable description logic that supports temporal cardinality restrictions Optimize SWRL implementations of OWL reasoners Optimize the rules Technical University of Crete

Thank You QUESTIONS?