Rewriting Ontology-Mediated Queries. Carsten Lutz University of Bremen
|
|
- Norman Gordon
- 6 years ago
- Views:
Transcription
1 Rewriting Ontology-Mediated Queries Carsten Lutz University of Bremen
2 Data Access and Ontologies Today, data is often highly incomplete and very heterogeneous Examples include web data and large-scale data integration Director(ww) Person(jj) Movie(dbl) directed(jj,dbl) Ontology is semantic technology from AI: adds domain knowledge to data and interrelates diverging vocabularies 2
3 Example Ontology: 8x( Director(x)! (Person(x) ^9y(directed(x, y) ^ Movie(y))) ) Query: q(x) =9y( Person(x) ^ directed(x, y) ^ Movie(y) ) Database: Person Movie Director jj dbl ww directed Person directed Movie Answers: jj ww Will be interested in ontologies formulated in description logics, standardised as web ontology language OWL 3
4 Ontology-Mediated Query Ontology-mediated query (OMQ): triple Q =(O,,q) where O is ontology is data signature (schema), possibly full q is query, e.g. atomic query (AQ) / conjunctive query (CQ) / UCQ A(x) Certain answer semantics: a answer to Q on D iff D [ O = q(a) OMQ language: pair (L, Q) with L ontology language and Q query language for example (EL, AQ), (ALC, UCQ), etc. Now interested in query answering, containment, rewriting, etc.
5 Query Rewriting Attaining scalable querying on large-scale data is far from trivial Existing database systems (SQL, Datalog) highly optimised, but (mostly) not prepared to deal with ontologies Query rewriting: Data Query and Ontology DB query DB 5
6 (Non-)Existence of Rewritings Rewritings into SQL (= FO, for now) need not exist: O: 8x8y (R(x, y) ^ A(y))! A(x) q: A(x) = all nodes that reach an A-labeled node along an R-path Same true for Datalog: O: every node must be labeled with R or G or B (disjunction!) + any two endpoints of an edge with same color satisfy D q: 9xD(x) = non-3-colorability But ontologies from practice tend to have very simple structure Challenges: construct rewritings when they exist, characterise existence, etc 6
7 The EL-Family of Description Logics (a tgd / datalog world) 7
8 EL Family of Description Logics The basic description logic EL (existential language) For example: Director v Person u 9directed.Movie Often used for medical and bio-ontologies: Pericardium v Tissue u 9partOf.Heart Pericarditis. = Inflammation u9location.pericardium Inflammation v Disease u 9actsOn.Tissue E.g. medical ontology SNOMED CT, ~500 ontologies on bioportal Spirit: a little semantics goes a long way 8
9 EL Family of Description Logics Concept formation: > A C u D 9r.C Ontology: set of C v D A u9r.b v 9r.A u9s.b A x ) x r r s B A B EL ontology set of tuple-generating dependencies w. single frontier variable + tree shaped body and head ELI: extension of EL with inverse roles (i.e., body and head are now trees in the undirected sense) (EL, CQ) and (ELI, CQ) have PTime data complexity, universal models 9
10 Computing vs Deciding Given an OMQ from (EL, CQ) or a related language, we would like to construct an (efficiently executable) FO-rewriting when it exists and report failure otherwise First aim: characterise and decide the existence of a rewriting, without necessarily computing it Allows to study complexity, abstract away from representation issues
11 Unraveling Tolerance OMQ (O,, A(x)) is unraveling tolerant if for every -database D: D [ O = A[a] iff D u a [ O = A[a] D r, s D u a r s a t a t b s t r t r s Theorem [L_WolterKR12] Every OMQ from (ELI, AQ) is unraveling tolerant.
12 Characterizing Non-Rewritability Unraveling tolerance enables characterization of FO-rewritability Theorem [BienvenuL_WolterIJCAI13] OMQ (O,,A(x)) in (ELI, AQ) is not FO-rewritable iff there are -databases D 1 D 2 D 3 D 4 D D D D4 0 4 such that for all i 1: D i [ O = A(a 0 ), but D 0 i [ O 6 = A(a 0)
13 Decidability and Complexity Only two more steps to decidability and tight upper bounds: bound depth of tree-databases to consider (single exponential) via pumping argument use tree-automata to check existence of tree-db exceeding bound For CQs, tree databases are not quite trees anymore. Theorem [BienvenuL_WolterIJCAI13,BienvenuHansenL_WolterIJCAI16] Complexity of FO-rewritability: (EL, AQ) (EL, CQ) (ELI, AQ) ExpTime-c. (ELI, CQ) 2ExpTime-c.
14 Constructing FO-Rewritings: Backwards Chaining Proposed in [KönigLeclereMugnierThomazoRR12] for tgds, here adapted to (EL, AQ): Ontology: 9r.A u9r.b v A 0 Query: A 0 (x) A 0 9r.9s.> va 0 9s.B v B r r r r r A B A s s B Termination for positive cases guaranteed, general termination achievable via pumping argument [HansenL_SeylanWolterIJCAI15] 14
15 Constructing FO-Rewritings: Backwards Chaining Proposed in [KönigLeclereMugnierThomazoRR12] for tgds, here adapted to (EL, AQ): Ontology: 9r.A u9r.b v A 0 Query: A 0 (x) A 0 9r.9s.> va 0 9s.B v B r r r r r A B A s s B Yields UCQ-rewriting (c.f. Rossman s homomorphism theorem) But UCQ representation of rewriting quickly grows out of bounds 15
16 Constructing FO-Rewritings Efficiently Backwards chaining can be realized in decomposed calculus so that [HansenL_SeylanWolterIJCAI15] Implements structure sharing, generates non-recursive Datalog rewriting
17 Digression: Linear Datalog Rewritability Since SQL3 (1999), linear recursion is available (unlike in FO) This suggests linear Datalog as a target language for rewritings Again admits elegant characterisations: Theorem [L_SabellekSubmitted] OMQ (O,,A(x)) in (EL, AQ) is not LDLog-rewritable iff there are tree-shaped -databases D 1,D 2,... such that D i [ O = A(a 0 ) and is -minimal with this property D i contains a full binary tree of depth i as a minor From this (via other steps) decidability and ExpTime-completeness, LDLog-rewritable iff in NL data complexity, and other interesting things
18 The ALC-Family of Description Logics (a modal logic world)
19 ALC Family of Description Logics ALC extends EL with negation, disjunction, universal quantification (attributive language with complement) ALC concept formation: >? A C C u D C t D 9r.C 8r.D For example: Director v Person u9directed.(movie t TVseries) These features are costly : (ALC, AQ) and (ALC, CQ) are conp-complete in data complexity there are no universal models Again many extensions, e.g. with inverse roles: ALCI 19
20 No Unraveling Tolerance ALC is NOT unraveling tolerant: Ontology: 9x.9y.P u9y.9x.p v A 0 9x.9y. P u9y.9x. P v A 0 Query: A 0 (x) y P? P? y P P x x x x A 0 y A 0 y How can we find useful characterizations / algorithms? 20
21 Recap: Constraint Satisfaction Problems CSPs emerged in AI, can be viewed as generalized coloring problems Several equivalent definitions; here: homomorphism problems A template is a finite relational structure T. CSP(T ) is: Given: finite relational structure (i.e.: database) S Question: T S? I.e., is there a homomorphism from S to T? For example: S T R G B 21
22 OMQ and CSP A BAQ is a query of the form 9xA(x) Theorem [BienvenuTenCateL_WolterPODS13] Every OMQ from (ALCI, BAQ) is equivalent to the complement of a CSP from (ALCI, AQ) is equivalent to the complement of a multi-template CSP with a single constant (The converses are actually also true!) Construction incurs (unavoidable) exponential blowup Theorem [LaroseLotenTardiffLMCS07] FO-definability of (co)csps is NP-complete 22
23 FO-Rewritability Theorem [BienvenuTenCateL_WolterPODS13] FO-rewritability in (ALCI, BAQ), (ALCI, AQ) are NEXPTIME-complete. Characterization: OMQ (O,, 9xA(x)) not FO-rewritable iff there are -databases D 1 D 2 D 3 D 4 D 0 2 such that for all i 1: D 0 3 D i [ O 6 = 9xA(x), but D 0 i D 0 4 [ O = 9xA(x) Bound size of D 1 (actually D 1 = T 2!), establish bound on i by pumping do some further magic (since bound is double exponential) 23
24 Shape of FO-Rewritings Corollary of [Atserias07EuJComb, RossmanJACM08] If an OMQ from (ALCI, BAQ) is FO-rewritable then it is UCQ-rewritable. This can be improved further: UCQ-rewritability implies monadic Datalog (MDLog)-rewritability MDLog-rewritability equivalent to unraveling tolerance [FederVardi98] one can thus replace every CQ in a UCQ-rewriting with all its tree-shaped identifications Theorem If an OMQ from (ALCI, BAQ) is FO-rewritable then it is tucq-rewritable. Wanted: more practical procedure For non-boolean queries, this is not true: cycles through answer variable can occur, but no other cycles. 24
25 Datalog-Rewritability Theorem [BartoKozikFOCS09,BartoJLC16] 1. Datalog-rewritability of cocsps is decidable and NP-complete 2. Whenever a cocsp is Datalog-rewritable, there is a width two rewriting Theorem [BienvenuTenCateL_WolterPODS13] Datalog-rewritability in (ALCI, BAQ), (ALCI, AQ) is NEXPTIME-complete. Canonical Datalog-program of width two [FederVardiSIAMJComp98]: derives everything that any width two rewriting could ever derive is a rewriting whenever there is one Unfortunate: is of double exponential size, even in the best case 25
26 From AQs to UCQs We replace atomic queries in OMQs with unions of conjunctive queries Theorem [BienvenuTenCateL_WolterPODS13] Every OMQ from (ALCI,UCQ) is equivalent to a monadic disjunctive Datalog (MDDLog) program; the converse also holds. Translation involves double exponential blowup Beyond CSP in expressive power, but CSP still a valuable tool 26
27 From MDDLog to cocsp MDDLog program is simple if each rule body contains single EDB atom and this atom contains all body variables, exactly once [FederVardiSIAMJComp98]: Each MDDLog program can be translated into simple one of same complexity (signature change, exponential blowup) Each simple MDDLog program equivalent to complement of CSP (exponential blowup) Important: this cannot happen in structures of high girth! 27
28 Reducing Rewritability Translation of to simple program S : UCQ-rewriting of S yields UCQ-rewriting of UCQ-rewriting of yields UCQ-rewriting of S that is - unconditionally complete (that is, D = S implies D = S ) - sound on inputs of girth > rule diameter of Same is true for monadic Datalog and for Datalog But if there is such a flawed UCQ-rewriting, there is also a good one: Girth Lemma For all cocsps and k>0: UCQ-rewritability on inputs of girth >kimplies UCQ-rewritability. Can be proved using combinatorial lemma due to Erdös / FederVardi 28
29 FO-Rewritability: Results Theorem [FeierKuusistoL ICDT17,BourhisL_KR16] FO-rewritability is decidable and 2NEXPTIME-complete in MDDLog and in (ALCI, UCQ). Note: 2-exponential succinctness gap does not materialise in complexity Result also holds for non-boolean queries (non-trivial, involves blowups) Approach also serves to analyse shape of rewritings Theorem [FeierKuusistoL ICDT17] In (ALCI, BUCQ), every FO-rewritable OMQ has a UCQ-rewriting in which every CQ has tree-width (1,k), k = max{2, q }. Again not quite true for non-boolean queries (tree-width with parameters) 29
30 Datalog-Rewritability It is unclear whether girth lemma holds for Datalog-rewritability Observations: it does hold for monadic Datalog-rewritability, thus we obtain decidability for that (between 2NExpTime and 3ExpTime) CSPs constructed from MDDLog programs that have equality, that is, there is binary EDB eq such that for all IDBs P : P (x) ^ eq(x, y)! P (y) and P (y) ^ eq(x, y)! P (x) Theorem [FeierKuusistoL ICDT17] For MDDLog programs that have equality, Datalog-rewritability is 2NExpTime-complete. Every MDDLog program can be extended with equality Unclear whether this preserves Datalog-rewritability (for CSPs it does) 30
31 Future Directions Natural next Questions: Is Datalog-rewritability of MDDLog programs decidable? Find practically feasible procedures for computing rewritings for OMQs from the ALC family More general question: There are many querying-based classes of problems for which people study complexity classification and rewriting, e.g. consistent query answering, deletion propagation, etc. Can we understand better how they interrelate? 31
Structural characterizations of schema mapping languages
Structural characterizations of schema mapping languages Balder ten Cate INRIA and ENS Cachan (research done while visiting IBM Almaden and UC Santa Cruz) Joint work with Phokion Kolaitis (ICDT 09) Schema
More informationConjunctive queries. Many computational problems are much easier for conjunctive queries than for general first-order queries.
Conjunctive queries Relational calculus queries without negation and disjunction. Conjunctive queries have a normal form: ( y 1 ) ( y n )(p 1 (x 1,..., x m, y 1,..., y n ) p k (x 1,..., x m, y 1,..., y
More informationProcessing Regular Path Queries Using Views or What Do We Need for Integrating Semistructured Data?
Processing Regular Path Queries Using Views or What Do We Need for Integrating Semistructured Data? Diego Calvanese University of Rome La Sapienza joint work with G. De Giacomo, M. Lenzerini, M.Y. Vardi
More informationSchema.org as a Description Logic
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) Schema.org as a Description Logic Andre Hernich 1, Carsten Lutz 2, Ana Ozaki 1 and Frank Wolter 1
More informationOntology-Based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP
Ontology-Based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP MEGHYN BIENVENU, CNRS and Université Paris Sud BALDER TEN CATE, University of California, Santa Cruz CARSTEN LUTZ, Universität
More informationA Retrospective on Datalog 1.0
A Retrospective on Datalog 1.0 Phokion G. Kolaitis UC Santa Cruz and IBM Research - Almaden Datalog 2.0 Vienna, September 2012 2 / 79 A Brief History of Datalog In the beginning of time, there was E.F.
More informationScalable Ontology-Based Information Systems
Scalable Ontology-Based Information Systems Ian Horrocks Information Systems Group Oxford University Computing Laboratory What is an Ontology? What is an Ontology? A model
More informationLecture 1: Conjunctive Queries
CS 784: Foundations of Data Management Spring 2017 Instructor: Paris Koutris Lecture 1: Conjunctive Queries A database schema R is a set of relations: we will typically use the symbols R, S, T,... to denote
More informationOWL 2 Profiles. An Introduction to Lightweight Ontology Languages. Markus Krötzsch University of Oxford. Reasoning Web 2012
University of Oxford Department of Computer Science OWL 2 Profiles An Introduction to Lightweight Ontology Languages Markus Krötzsch University of Oxford Reasoning Web 2012 Remark for the Online Version
More informationDATABASE THEORY. Lecture 11: Introduction to Datalog. TU Dresden, 12th June Markus Krötzsch Knowledge-Based Systems
DATABASE THEORY Lecture 11: Introduction to Datalog Markus Krötzsch Knowledge-Based Systems TU Dresden, 12th June 2018 Announcement All lectures and the exercise on 19 June 2018 will be in room APB 1004
More informationGuarded Negation in query languages
Guarded Negation in query languages Vince Bárány (TU Darmstadt) joint work with Balder ten Cate (UC Santa Cruz) & Martin Otto (TU Darmstadt) Oxford June 2012 Bárány-ten Cate-Otto (TU Darmstadt) Guarded
More informationThe Complexity of Relational Queries: A Personal Perspective
The Complexity of Relational Queries: A Personal Perspective Moshe Y. Vardi Rice University http://www.cs.rice.edu/ vardi Relational Query Theory in 1980 Codd, 1972: FO=RA Chandra&Merlin, 1977: basic theory
More informationView-based query processing: On the relationship between rewriting, answering and losslessness
Theoretical Computer Science 371 (2007) 169 182 www.elsevier.com/locate/tcs View-based query processing: On the relationship between rewriting, answering and losslessness Diego Calvanese a,, Giuseppe De
More informationThe Inverse of a Schema Mapping
The Inverse of a Schema Mapping Jorge Pérez Department of Computer Science, Universidad de Chile Blanco Encalada 2120, Santiago, Chile jperez@dcc.uchile.cl Abstract The inversion of schema mappings has
More informationInverting Schema Mappings: Bridging the Gap between Theory and Practice
Inverting Schema Mappings: Bridging the Gap between Theory and Practice Marcelo Arenas Jorge Pérez Juan Reutter Cristian Riveros PUC Chile PUC Chile PUC Chile R&M Tech marenas@ing.puc.cl jperez@ing.puc.cl
More informationOntologies and Databases
Ontologies and Databases Diego Calvanese KRDB Research Centre Free University of Bozen-Bolzano Reasoning Web Summer School 2009 September 3 4, 2009 Bressanone, Italy Overview of the Tutorial 1 Introduction
More informationQuery Rewriting under EL-TBoxes: Efficient Algorithms
Query Rewriting under EL-Boxes: Efficient Algorithms Peter Hansen 1, Carsten Lutz 1, İnanç Seylan1, and Frank Wolter 2 1 University of Bremen, Germany, {hansen,clu,seylan}@informatik.uni-bremen.de 2 University
More informationMaurizio Lenzerini. Dipartimento di Ingegneria Informatica Automatica e Gestionale Antonio Ruberti
Query rewriting for ontology-based (big) data access Maurizio Lenzerini Dipartimento di Ingegneria Informatica Automatica e Gestionale Antonio Ruberti Global scientific data infrastructures: The findability
More informationData integration lecture 2
PhD course on View-based query processing Data integration lecture 2 Riccardo Rosati Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza {rosati}@dis.uniroma1.it Corso di Dottorato
More informationOn the Hardness of Counting the Solutions of SPARQL Queries
On the Hardness of Counting the Solutions of SPARQL Queries Reinhard Pichler and Sebastian Skritek Vienna University of Technology, Faculty of Informatics {pichler,skritek}@dbai.tuwien.ac.at 1 Introduction
More informationFinite Model Theory and Its Applications
Erich Grädel Phokion G. Kolaitis Leonid Libkin Maarten Marx Joel Spencer Moshe Y. Vardi Yde Venema Scott Weinstein Finite Model Theory and Its Applications With 35 Figures and 2 Tables Springer Contents
More informationSemantic Characterizations of XPath
Semantic Characterizations of XPath Maarten Marx Informatics Institute, University of Amsterdam, The Netherlands CWI, April, 2004 1 Overview Navigational XPath is a language to specify sets and paths in
More informationNonstandard Inferences in Description Logics
Nonstandard Inferences in Description Logics Franz Baader Theoretical Computer Science Germany Short introduction to Description Logics Application in chemical process engineering Non-standard inferences
More informationDatabase Theory VU , SS Introduction: Relational Query Languages. Reinhard Pichler
Database Theory Database Theory VU 181.140, SS 2018 1. Introduction: Relational Query Languages Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 6 March,
More informationAccess Patterns and Integrity Constraints Revisited
Access Patterns and Integrity Constraints Revisited Vince Bárány Department of Mathematics Technical University of Darmstadt barany@mathematik.tu-darmstadt.de Michael Benedikt Department of Computer Science
More informationOn the Boolean Algebra of Shape Analysis Constraints
On the Boolean Algebra of Shape Analysis Constraints Viktor Kuncak and Martin Rinard Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge, MA 02139, USA
More informationRELATIONAL REPRESENTATION OF ALN KNOWLEDGE BASES
RELATIONAL REPRESENTATION OF ALN KNOWLEDGE BASES Thomas Studer ABSTRACT The retrieval problem for a knowledge base O and a concept C is to find all individuals a such that O entails C(a). We describe a
More informationFOUNDATIONS OF DATABASES AND QUERY LANGUAGES
FOUNDATIONS OF DATABASES AND QUERY LANGUAGES Lecture 14: Database Theory in Practice Markus Krötzsch TU Dresden, 20 July 2015 Overview 1. Introduction Relational data model 2. First-order queries 3. Complexity
More informationRange Restriction for General Formulas
Range Restriction for General Formulas 1 Range Restriction for General Formulas Stefan Brass Martin-Luther-Universität Halle-Wittenberg Germany Range Restriction for General Formulas 2 Motivation Deductive
More informationComposition and Inversion of Schema Mappings
Composition and Inversion of Schema Mappings Marcelo Arenas Jorge Pérez Juan Reutter Cristian Riveros PUC Chile PUC Chile U. of Edinburgh Oxford University marenas@ing.puc.cl jperez@ing.puc.cl juan.reutter@ed.ac.uk
More informationRelative Information Completeness
Relative Information Completeness Abstract Wenfei Fan University of Edinburgh & Bell Labs wenfei@inf.ed.ac.uk The paper investigates the question of whether a partially closed database has complete information
More informationOWL 2 The Next Generation. Ian Horrocks Information Systems Group Oxford University Computing Laboratory
OWL 2 The Next Generation Ian Horrocks Information Systems Group Oxford University Computing Laboratory What is an Ontology? What is an Ontology? A model of (some aspect
More informationDatabase Theory VU , SS Introduction: Relational Query Languages. Reinhard Pichler
Database Theory Database Theory VU 181.140, SS 2011 1. Introduction: Relational Query Languages Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 8 March,
More informationCraig Interpolation Theorems and Database Applications
Craig Interpolation Theorems and Database Applications Balder ten Cate! LogicBlox & UC Santa Cruz!!!! November 7, 2014, UC Berkeley - Logic Colloquium! 1 Craig Interpolation William Craig (1957): For all
More informationSQL, DLs, Datalog, and ASP: comparison
SQL, DLs, Datalog, and ASP: comparison Riccardo Rosati Knowledge Representation and Semantic Technologies Corso di Laurea in Ingegneria informatica Sapienza Università di Roma 2014/2015 CWA vs. OWA DLs
More informationDatabase Theory: Beyond FO
Database Theory: Beyond FO CS 645 Feb 11, 2010 Some slide content based on materials of Dan Suciu, Ullman/Widom 1 TODAY: Coming lectures Limited expressiveness of FO Adding recursion (Datalog) Expressiveness
More informationFoundations of Schema Mapping Management
Foundations of Schema Mapping Management Marcelo Arenas Jorge Pérez Juan Reutter Cristian Riveros PUC Chile PUC Chile University of Edinburgh Oxford University marenas@ing.puc.cl jperez@ing.puc.cl juan.reutter@ed.ac.uk
More informationLogic and Databases. Phokion G. Kolaitis. UC Santa Cruz & IBM Research - Almaden
Logic and Databases Phokion G. Kolaitis UC Santa Cruz & IBM Research - Almaden 1 Logic and Databases are inextricably intertwined. C.J. Date -- 2007 2 Logic and Databases Extensive interaction between
More informationStructural Characterizations of Schema-Mapping Languages
Structural Characterizations of Schema-Mapping Languages Balder ten Cate University of Amsterdam and UC Santa Cruz balder.tencate@uva.nl Phokion G. Kolaitis UC Santa Cruz and IBM Almaden kolaitis@cs.ucsc.edu
More informationLTCS Report. Concept Descriptions with Set Constraints and Cardinality Constraints. Franz Baader. LTCS-Report 17-02
Technische Universität Dresden Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report Concept Descriptions with Set Constraints and Cardinality Constraints Franz Baader LTCS-Report
More informationSchema Mappings and Data Exchange
Schema Mappings and Data Exchange Lecture #2 EASSLC 2012 Southwest University August 2012 1 The Relational Data Model (E.F. Codd 1970) The Relational Data Model uses the mathematical concept of a relation
More informationPosets, graphs and algebras: a case study for the fine-grained complexity of CSP s
Posets, graphs and algebras: a case study for the fine-grained complexity of CSP s Part 1: Preliminaries on Complexity and CSP s Benoit Larose 1 2 1 Department of Mathematics and Statistics Concordia University,
More informationPositive higher-order queries
Positive higher-order queries Michael Benedikt, Gabriele Puppis, Huy u To cite this version: Michael Benedikt, Gabriele Puppis, Huy u. Positive higher-order queries. Proceedings of PODS 2010, 2010, Indianapolis,
More informationDatabase Theory VU , SS Codd s Theorem. Reinhard Pichler
Database Theory Database Theory VU 181.140, SS 2011 3. Codd s Theorem Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 29 March, 2011 Pichler 29 March,
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationOWL 2 Profiles. An Introduction to Lightweight Ontology Languages. Маркус Крёч (Markus Krötzsch) University of Oxford. KESW Summer School 2012
University of Oxford Department of Computer Science OWL 2 Profiles An Introduction to Lightweight Ontology Languages Маркус Крёч (Markus Krötzsch) University of Oxford KESW Summer School 2012 Remark for
More informationXML Research for Formal Language Theorists
XML Research for Formal Language Theorists Wim Martens TU Dortmund Wim Martens (TU Dortmund) XML for Formal Language Theorists May 14, 2008 1 / 65 Goal of this talk XML Research vs Formal Languages Wim
More informationMonadic Datalog Containment on Trees
Monadic Datalog Containment on Trees André Frochaux 1, Martin Grohe 2, and Nicole Schweikardt 1 1 Goethe-Universität Frankfurt am Main, {afrochaux,schweika}@informatik.uni-frankfurt.de 2 RWTH Aachen University,
More informationCOMP718: Ontologies and Knowledge Bases
1/35 COMP718: Ontologies and Knowledge Bases Lecture 9: Ontology/Conceptual Model based Data Access Maria Keet email: keet@ukzn.ac.za home: http://www.meteck.org School of Mathematics, Statistics, and
More informationRewrite and Conquer: Dealing with Integrity Constraints in Data Integration
Rewrite and Conquer: Dealing with Integrity Constraints in Data Integration Andrea Calì, Diego Calvanese, Giuseppe De Giacomo, and Maurizio Lenzerini Abstract The work Data Integration under Integrity
More informationDepartment of Computer Science CS-RR-15-01
Department of Computer Science INFORMATION INTEGRATION WITH PROVENANCE ON THE SEMANTIC WEB VIA PROBABILISTIC DATALOG+/ Thomas Lukasiewicz, Maria Vanina Martinez, Livia Predoiu, Gerardo I. Simari CS-RR-15-01
More informationVertex Cover is Fixed-Parameter Tractable
Vertex Cover is Fixed-Parameter Tractable CS 511 Iowa State University November 28, 2010 CS 511 (Iowa State University) Vertex Cover is Fixed-Parameter Tractable November 28, 2010 1 / 18 The Vertex Cover
More informationLogical Aspects of Massively Parallel and Distributed Systems
Logical Aspects of Massively Parallel and Distributed Systems Frank Neven Hasselt University PODS Tutorial June 29, 2016 PODS June 29, 2016 1 / 62 Logical aspects of massively parallel and distributed
More informationKnowledge Compilation Properties of Tree-of-BDDs
Knowledge Compilation Properties of Tree-of-BDDs Sathiamoorthy Subbarayan IT University of Copenhagen, Denmark sathi@itu.dk Lucas Bordeaux and Youssef Hamadi Microsoft Research, Cambridge, UK lucasb,youssefh@microsoft.com
More informationRegular Path Queries on Graphs with Data
Regular Path Queries on Graphs with Data Leonid Libkin Domagoj Vrgoč ABSTRACT Graph data models received much attention lately due to applications in social networks, semantic web, biological databases
More informationWeek 4. COMP62342 Sean Bechhofer, Uli Sattler
Week 4 COMP62342 Sean Bechhofer, Uli Sattler sean.bechhofer@manchester.ac.uk, uli.sattler@manchester.ac.uk Today Some clarifications from last week s coursework More on reasoning: extension of the tableau
More informationQuery Minimization. CSE 544: Lecture 11 Theory. Query Minimization In Practice. Query Minimization. Query Minimization for Views
Query Minimization CSE 544: Lecture 11 Theory Monday, May 3, 2004 Definition A conjunctive query q is minimal if for every other conjunctive query q s.t. q q, q has at least as many predicates ( subgoals
More informationSemantic Acyclicity on Graph Databases
Semantic Acyclicity on Graph Databases Pablo Barceló Department of Computer Science, Universidad de Chile pbarcelo@dcc.uchile.cl Miguel Romero Department of Computer Science, Universidad de Chile miromero@ing.uchile.cl
More informationThe Logic of the Semantic Web. Enrico Franconi Free University of Bozen-Bolzano, Italy
The Logic of the Semantic Web Enrico Franconi Free University of Bozen-Bolzano, Italy What is this talk about 2 What is this talk about A sort of tutorial of RDF, the core semantic web knowledge representation
More informationSemantic reasoning for dynamic knowledge bases. Lionel Médini M2IA Knowledge Dynamics 2018
Semantic reasoning for dynamic knowledge bases Lionel Médini M2IA Knowledge Dynamics 2018 1 Outline Summary Logics Semantic Web Languages Reasoning Web-based reasoning techniques Reasoning using SemWeb
More informationTECHNICAL REPORT Leapfrog Triejoin: A Worst-Case Optimal Join Algorithm. October 1, 2012 Todd L. Veldhuizen LB1201
TECHNICAL REPORT Leapfrog Triejoin: A Worst-Case Optimal Join Algorithm October, 22 Todd L. Veldhuizen LB2 Leapfrog Triejoin: a worst-case optimal join algorithm Todd L. Veldhuizen Contents Introduction......................................
More informationModularity in Ontologies: Introduction (Part A)
Modularity in Ontologies: Introduction (Part A) Thomas Schneider 1 Dirk Walther 2 1 Department of Computer Science, University of Bremen, Germany 2 Faculty of Informatics, Technical University of Madrid,
More informationFinding Equivalent Rewritings in the Presence of Arithmetic Comparisons
Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons Foto Afrati 1, Rada Chirkova 2, Manolis Gergatsoulis 3, and Vassia Pavlaki 1 1 Department of Electrical and Computing Engineering,
More informationData Integration: A Theoretical Perspective
Data Integration: A Theoretical Perspective Maurizio Lenzerini Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza Via Salaria 113, I 00198 Roma, Italy lenzerini@dis.uniroma1.it ABSTRACT
More informationNotes. Notes. Introduction. Notes. Propositional Functions. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry.
Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 1 / 1 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.3 1.4 of Rosen cse235@cse.unl.edu Introduction
More informationIntegrity Constraints For Access Control Models
1 / 19 Integrity Constraints For Access Control Models Romuald THION, Stéphane COULONDRE November 27 2008 2 / 19 Outline 1 Introduction 2 3 4 5 3 / 19 Problem statement From Role-BAC to time (Generalized-Temporal-RBAC,
More informationAn Evolution of Mathematical Tools
An Evolution of Mathematical Tools From Conceptualization to Formalization Here's what we do when we build a formal model (or do a computation): 0. Identify a collection of objects/events in the real world.
More informationCSE 544: Principles of Database Systems
CSE 544: Principles of Database Systems Semijoin Reductions Theory Wrap-up CSE544 - Spring, 2012 1 Announcements Makeup lectures: Friday, May 18, 10:30-11:50, CSE 405 Friday, May 25, 10:30-11:50, CSE 405
More informationThe Relational Model
The Relational Model David Toman School of Computer Science University of Waterloo Introduction to Databases CS348 David Toman (University of Waterloo) The Relational Model 1 / 28 The Relational Model
More informationBibliographic citation
Bibliographic citation Andrea Calì, Georg Gottlob, Andreas Pieris: Tractable Query Answering over Conceptual Schemata. In Alberto H. F. Laender, Silvana Castano, Umeshwar Dayal, Fabio Casati, Jos Palazzo
More informationFoundations of Databases
Foundations of Databases Relational Query Languages with Negation Free University of Bozen Bolzano, 2009 Werner Nutt (Slides adapted from Thomas Eiter and Leonid Libkin) Foundations of Databases 1 Queries
More informationWe ve studied the main models and concepts of the theory of computation:
CMPSCI 601: Summary & Conclusions Lecture 27 We ve studied the main models and concepts of the theory of computation: Computability: what can be computed in principle Logic: how can we express our requirements
More information( A(x) B(x) C(x)) (A(x) A(y)) (C(x) C(y))
1 Introduction Finite model theory studies the expressive power of logics on finite models. Classical model theory, on the other hand, concentrates on infinite structures: its origins are in mathematics,
More informationTowards Efficient Reasoning for Description Logics with Inverse Roles
Towards Efficient Reasoning for Description Logics with Inverse Roles Yu Ding and Volker Haarslev Concordia University, Montreal, Quebec, Canada {ding yu haarslev}@cse.concordia.ca Abstract This paper
More informationExercises Computational Complexity
Exercises Computational Complexity March 22, 2017 Exercises marked with a are more difficult. 1 Chapter 7, P and NP Exercise 1. Suppose some pancakes are stacked on a surface such that no two pancakes
More informationWhen Can We Answer Queries Using Result-Bounded Data Interfaces?
When Can We Answer Queries Using Result-Bounded Data Interfaces? Antoine Amarilli 1, Michael Benedikt 2 June 12th, 2018 1 Télécom ParisTech 2 Oxford University 1/16 Problem: Answering Queries Using Web
More informationIntroduction to Finite Model Theory. Jan Van den Bussche Universiteit Hasselt
Introduction to Finite Model Theory Jan Van den Bussche Universiteit Hasselt 1 Books Finite Model Theory by Ebbinghaus & Flum 1999 Finite Model Theory and Its Applications by Grädel et al. 2007 Elements
More informationOn the Data Complexity of Consistent Query Answering over Graph Databases
On the Data Complexity of Consistent Query Answering over Graph Databases Pablo Barceló and Gaëlle Fontaine Department of Computer Science University of Chile pbarcelo@dcc.uchile.cl, gaelle@dcc.uchile.cl
More informationLOGIC AND DISCRETE MATHEMATICS
LOGIC AND DISCRETE MATHEMATICS A Computer Science Perspective WINFRIED KARL GRASSMANN Department of Computer Science University of Saskatchewan JEAN-PAUL TREMBLAY Department of Computer Science University
More informationStatic, Incremental and Parameterized Complexity of Consistent Query Answering in Databases Under Cardinality-Based Semantics
Static, Incremental and Parameterized Complexity of Consistent Query Answering in Databases Under Cardinality-Based Semantics Leopoldo Bertossi Carleton University Ottawa, Canada Based in part on join
More informationChecking Containment of Schema Mappings (Preliminary Report)
Checking Containment of Schema Mappings (Preliminary Report) Andrea Calì 3,1 and Riccardo Torlone 2 Oxford-Man Institute of Quantitative Finance, University of Oxford, UK Dip. di Informatica e Automazione,
More informationCapturing Topology in Graph Pattern Matching
Capturing Topology in Graph Pattern Matching Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tianyu Wo University of Edinburgh Graphs are everywhere, and quite a few are huge graphs! File systems Databases
More informationReasoning and Query Answering in Description Logics
Reasoning and Query Answering in Description Logics Magdalena Ortiz Vienna University of Technology AMW School, 20 May 2013 1/117 Reasoning and Querying in DLs 1. Motivation Ontologies An ontology is a
More informationNews on Temporal Conjunctive Queries
News on Temporal Conjunctive Queries Veronika Thost TU Dresden WSP@ISWC October 22, 2017 Ontology-Based Data Access Use Case: Finding Participants for Clinical Trial Example 1 Previously infected with
More informationTreewidth and graph minors
Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under
More informationa standard database system
user queries (RA, SQL, etc.) relational database Flight origin destination airline Airport code city VIE LHR BA VIE Vienna LHR EDI BA LHR London LGW GLA U2 LGW London LCA VIE OS LCA Larnaca a standard
More informationOn Reconciling Data Exchange, Data Integration, and Peer Data Management
On Reconciling Data Exchange, Data Integration, and Peer Data Management Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati Dipartimento di Informatica e Sistemistica Sapienza
More informationIntroduction to Data Management CSE 344. Lecture 14: Datalog
Introduction to Data Management CSE 344 Lecture 14: Datalog CSE 344 - Fall 2016 1 Announcements WQ 4 and HW 4 are out Both due next week Midterm on 11/7 in class Previous exams on course webpage Midterm
More informationInfinite transducers on terms denoting graphs
Infinite transducers on terms denoting graphs Irène Durand and Bruno Courcelle LaBRI, Université de Bordeaux June, 2013 European Lisp Symposium, ELS2013 2/30 Objectives What : Compute information about
More informationComputing Complete Answers to Queries in the Presence of Limited Access Patterns (Revision)
Computing Complete Answers to Queries in the Presence of Limited Access Patterns (Revision) Chen Li Department of Information and Computer Science University of California at Irvine, CA 92697-3425 chenli@ics.uci.edu
More informationData Exchange in the Relational and RDF Worlds
Data Exchange in the Relational and RDF Worlds Marcelo Arenas Department of Computer Science Pontificia Universidad Católica de Chile This is joint work with Jorge Pérez, Juan Reutter, Cristian Riveros
More informationStream Reasoning For Linked Data
5/30/11 Stream Reasoning For Linked Data and Emanuele Della Valle Agenda Introduction to Linked Data and OWL 2 (90m) C-SPARQL: A Continuous Extension of SPARQL (90m) Stream Reasoning techniques for RDFS
More informationDATABASE THEORY. Lecture 18: Dependencies. TU Dresden, 3rd July Markus Krötzsch Knowledge-Based Systems
DATABASE THEORY Lecture 18: Dependencies Markus Krötzsch Knowledge-Based Systems TU Dresden, 3rd July 2018 Review: Databases and their schemas Lines: Line Type 85 bus 3 tram F1 ferry...... Stops: SID Stop
More informationV1.0: Seth Gilbert, V1.1: Steven Halim August 30, Abstract. d(e), and we assume that the distance function is non-negative (i.e., d(x, y) 0).
CS4234: Optimisation Algorithms Lecture 4 TRAVELLING-SALESMAN-PROBLEM (4 variants) V1.0: Seth Gilbert, V1.1: Steven Halim August 30, 2016 Abstract The goal of the TRAVELLING-SALESMAN-PROBLEM is to find
More informationPART 1 GRAPHICAL STRUCTURE
PART 1 GRAPHICAL STRUCTURE in this web service in this web service 1 Treewidth and Hypertree Width Georg Gottlob, Gianluigi Greco, Francesco Scarcello This chapter covers methods for identifying islands
More informationSafe Stratified Datalog With Integer Order Does not Have Syntax
Safe Stratified Datalog With Integer Order Does not Have Syntax Alexei P. Stolboushkin Department of Mathematics UCLA Los Angeles, CA 90024-1555 aps@math.ucla.edu Michael A. Taitslin Department of Computer
More informationXXXII Conference on Very Large Data Bases VLDB 2006 Seoul, Korea, 15 th September 2006
Andrea Calì Faculty of Computer Science Free University of Bolzano State University of New York at Stony Brook XXXII Conference on Very Large Data Bases VLDB 2006 Seoul, Korea, 15 th September 2006 F-Logic
More informationA Knowledge Compilation Technique for ALC Tboxes
A Knowledge Compilation Technique for ALC Tboxes Ulrich Furbach and Heiko Günther and Claudia Obermaier University of Koblenz Abstract Knowledge compilation is a common technique for propositional logic
More informationToward Analytics for RDF Graphs
Toward Analytics for RDF Graphs Ioana Manolescu INRIA and Ecole Polytechnique, France ioana.manolescu@inria.fr http://pages.saclay.inria.fr/ioana.manolescu Joint work with D. Bursztyn, S. Cebiric (Inria),
More information1 Introduction... 1 1.1 A Database Example... 1 1.2 An Example from Complexity Theory...................... 4 1.3 An Example from Formal Language Theory................. 6 1.4 An Overview of the Book.................................
More information