DL-LITE: TRACTABLE DESCRIPTION LOGICS FOR ONTOLOGIES AUTHORS: DIEGO CALVANESE, GIUSEPPE DE GIACOMO, DOMENICO LEMBO, MAURIZIO LENZERINI, RICCARDO ROSATI.

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

ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
The 20th International Conference on Software Engineering and Knowledge Engineering (SEKE2008) Department of Electrical and Computer Engineering
Knowledge Representation and Reasoning using Description Logic Presenter Shamima Mithun.
OWL - DL. DL System A knowledge base (KB) comprises two components, the TBox and the ABox The TBox introduces the terminology, i.e., the vocabulary of.
Time Complexity P vs NP.
Constraint Propagation Algorithms for Temporal Reasoning Marc Vilain, Henry Kautz (AAAI 1986) Presentation by Lin XU March 4, 2002.
1June 7, 2004Ontologies for interoperability1 Ontology-based data integration Maurizio Lenzerini Dipartimento di Informatica e Sistemistica “A. Ruberti”
Ontological Logic Programming by Murat Sensoy, Geeth de Mel, Wamberto Vasconcelos and Timothy J. Norman Computing Science, University of Aberdeen, UK 1.
Organizing research publications in Web 3 enviroment Anastasiou Lucas Vasilis Tzouvaras
High-level Data Access Based on Query Rewritings Ekaterina Stepalina Higher School of Economics.
INTRODUCTION TO ARTIFICIAL INTELLIGENCE Massimo Poesio LECTURE 4: Semantic Networks and Description Logics.
1 WSML Presentation Variance in e-Business Service Discovery Uwe Keller based on a paper by S. Grimm, B. Motik and C. Preist (to be published) and slides.
Analyzing Minerva1 AUTORI: Antonello Ercoli Alessandro Pezzullo CORSO: Seminari di Ingegneria del SW DOCENTE: Prof. Giuseppe De Giacomo.
A Principled Approach to Data Integration and Reconciliation in Data Warehousing Diego Calvanese Giuseppe De Giacomo Maurizio Lenzerini Daniele Nardi Riccardo.
Proof methods Proof methods divide into (roughly) two kinds: –Application of inference rules Legitimate (sound) generation of new sentences from old Proof.
How can Computer Science contribute to Research Publishing?
Description Logics. Outline Knowledge Representation Knowledge Representation Ontology Language Ontology Language Description Logics Description Logics.
The Semantic Web Week 12 Term 1 Recap Lee McCluskey, room 2/07 Department of Computing And Mathematical Sciences Module Website:
TAMBIS Transparent Access to Multiple Biological Information Sources.
Fall 2004COMP 3351 Time Complexity We use a multitape Turing machine We count the number of steps until a string is accepted We use the O(k) notation.
Part 6: Description Logics. Languages for Ontologies In early days of Artificial Intelligence, ontologies were represented resorting to non-logic-based.
THE MODEL OF ASIS FOR PROCESS CONTROL APPLICATIONS P.Andreeva, T.Atanasova, J.Zaprianov Institute of Control and System Researches Topic Area: 12. Intelligent.
Scalable Ontology-Based Information Systems Ian Horrocks Information Systems Group Oxford University Computing Laboratory.
Knowledge Mediation in the WWW based on Labelled DAGs with Attached Constraints Jutta Eusterbrock WebTechnology GmbH.
Integrating DLs with Logic Programming Boris Motik, University of Manchester Joint work with Riccardo Rosati, University of Rome.
Semantics and Reasoning Algorithms for a Faithful Integration of Description Logics and Rules Boris Motik, University of Oxford.
PROGRAMMING LANGUAGES The Study of Programming Languages.
An Introduction to Description Logics. What Are Description Logics? A family of logic based Knowledge Representation formalisms –Descendants of semantic.
Ming Fang 6/12/2009. Outlines  Classical logics  Introduction to DL  Syntax of DL  Semantics of DL  KR in DL  Reasoning in DL  Applications.
Using the TBox to Optimise SPARQL Queries Birte Glimm Yevgeny Kazakov Ilianna Kollia and Giorgos Stamou CS 848 Paper Critique Vishnu Prathish.
Logical Agents Logic Propositional Logic Summary
Temporal Reasoning and Planning in Medicine Frame-Based Representations and Description Logics Yuval Shahar, M.D., Ph.D.
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.
Updating ABoxes in DL-Lite D. Calvanese, E. Kharlamov, W. Nutt, D. Zheleznyakov Free University of Bozen-Bolzano AMW 2010, May 2010.
THE SUPPORTING ROLE OF ONTOLOGY IN A SIMULATION SYSTEM FOR COUNTERMEASURE EVALUATION Nelia Lombard DPSS, CSIR.
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.
NP-Complete Problems. Running Time v.s. Input Size Concern with problems whose complexity may be described by exponential functions. Tractable problems.
The Semantic Web Riccardo Rosati Dottorato in Ingegneria Informatica Sapienza Università di Roma a.a. 2006/07.
Approach to building ontologies A high-level view Chris Wroe.
Costas Busch - LSU1 Time Complexity. Costas Busch - LSU2 Consider a deterministic Turing Machine which decides a language.
Solving the Logic Satisfiability problem Solving the Logic Satisfiability problem Jesus De Loera.
1 Time Complexity We use a multitape Turing machine We count the number of steps until a string is accepted We use the O(k) notation.
Hitzler ● OWL1.1 Rules ● DedSys Saarbrücken ● March 2008 AIFB ReaSem Slide 1 OWL 1.1 Rules Markus Krötzsch Sebastian Rudolph Pascal Hitzler AIFB, University.
1 Instance Store Database Support for Reasoning over Individuals S Bechhofer, I Horrocks, D Turi. Instance Store - Database Support for Reasoning over.
Using OWL 2 For Product Modeling David Leal Caesar Systems April 2009 Henson Graves Lockheed Martin Aeronautics.
Knowledge Representation and Reasoning University "Politehnica" of Bucharest Department of Computer Science Fall 2011 Adina Magda Florea
Presented by Kyumars Sheykh Esmaili Description Logics for Data Bases (DLHB,Chapter 16) Semantic Web Seminar.
Of 29 lecture 15: description logic - introduction.
CSE-291: Ontologies in Data Integration Department of Computer Science & Engineering University of California, San Diego CSE-291: Ontologies in Data Integration.
Chapter 13: Query Processing
Ontology Technology applied to Catalogues Paul Kopp.
Prof. Busch - LSU1 Time Complexity. Prof. Busch - LSU2 Consider a deterministic Turing Machine which decides a language.
Definition and Technologies Knowledge Representation.
1 WSML Presentation Variance in e-Business Service Discovery Uwe Keller based on a paper by S. Grimm, B. Motik and C. Preist and slides by S. Grimm for.
The TONES Consortium: Free University of Bozen-Bolzano Università di Roma “La Sapienza” The University of Manchester Technische Universität Dresden Hamburg.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
1 Representing and Reasoning on XML Documents: A Description Logic Approach D. Calvanese, G. D. Giacomo, M. Lenzerini Presented by Daisy Yutao Guo University.
OWL (Ontology Web Language and Applications) Maw-Sheng Horng Department of Mathematics and Information Education National Taipei University of Education.
Knowledge Representation Part II Description Logic & Introduction to Protégé Jan Pettersen Nytun.
ece 720 intelligent web: ontology and beyond
Computational Complexity of Terminological Reasoning in BACK
Time Complexity Costas Busch - LSU.
Small is Again Beautiful in Description Logics
Updating TBoxes in DL-Lite
Computational Complexity
Time Complexity We use a multitape Turing machine
NP-Complete Problems.
Presentation transcript:

DL-LITE: TRACTABLE DESCRIPTION LOGICS FOR ONTOLOGIES AUTHORS: DIEGO CALVANESE, GIUSEPPE DE GIACOMO, DOMENICO LEMBO, MAURIZIO LENZERINI, RICCARDO ROSATI FREE UNIVERSITY OF BOLZANO/BOZEN & UNIVERSIT`A DI ROMA “LA SAPIENZA” 20TH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE PRESENTED BY: AHSAN RAZA

CONTENT BACKGROUND GOALS, FEATURES AND APPLICATIONS CONCEPTS HIGH LEVEL APPROACH/DESIGN DISCUSSION REMARKS

BACKGROUND DL research on expressive power and computational complexity Need to balance out expressive power and computational complexity DLs with worst-case polynomial complexity tend to be weak Lacking in modeling power required to capture conceptual model Lacking in power to capture basic ontology languages DLs with strong modeling power tend to suffer from worst-case exponential time

DL-LITE: GOALS, FEATURES AND APPLICATIONS Capture basic ontology languages while keeping low reasoning complexity Polynomial in the size of the instances in the knowledge base Reasoning means computing subsumption between concepts, checking satisfiability of the KB and answering complex queries Suitable for representing and answering variety of representation languages Conceptual data models, object oriented Conjunctive query answering Containment between conjunctive queries over concepts and roles

CONCEPTS

DL-LITE: GOALS, FEATURES AND APPLICATIONS

HIGH-LEVEL APPROACH

HIGH-LEVEL APPROACH (KB NORMALIZATION, SATISFIABILITY)

HIGH-LEVEL APPROACH (QUERY REFORMULATION)

HIGH-LEVEL APPROACH (QUERY EVALUATION) Query evaluation First evaluate conjunctive queries returned by PerfectRef Transform into SQL Transformation is not described due to “lack of space” Run the query in SQL DB

DISCUSSION Existing DLs that can perform KB satisfiability, instance checking, and reason with conjunctive queries are all EXPHARD-time Data complexity is generally not a concern

REMARKS Algorithms are not described in details E.g., parts of the PerfectRef and Answer algorithm are not described atom reformulation and reduce method SQL transformation Lack of space, but introduction could have been shorter. However, in general, good attention to detail and written concisely