ANDREAS PIERIS JOURNAL PAPERS
|
|
|
- Alaina Ross
- 5 years ago
- Views:
Transcription
1 ANDREAS PIERIS School of Informatics, University of Edinburgh Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB, Scotland, UK PUBLICATIONS (authors in alphabetical order) JOURNAL PAPERS 2018 [1] Marcelo Arenas, Georg Gottlob and Andreas Pieris. Expressive Languages for Querying the Semantic Web. ACM Transactions on Database Systems. Accepted for publication [2] Georg Gottlob, Andreas Pieris and Mantas Šimkus. The Impact of Active Domain Predicates on Guarded Existential Rules. Fundamenta Informaticae, 159(1-2): [3] Pablo Barceló, Andreas Pieris and Miguel Romero. Semantic Optimization in Tractable Classes of Conjunctive Queries. SIGMOD Record, 46(2): [4] Pierre Bourhis, Marco Manna, Michael Morak and Andreas Pieris. Guarded-Based Disjunctive Tuple- Generating Dependencies. ACM Transactions on Database Systems, 41(4): 27:1-27: [5] Georg Gottlob, Giorgio Orsi and Andreas Pieris. Query Rewriting and Optimization for Ontological Databases. ACM Transactions on Database Systems, 39(3): 25:1-25: [6] Georg Gottlob, Marco Manna and Andreas Pieris. Combining Decidability Paradigms for Existential Rules. Theory and Practice of Logic Programming, 13(4-5): [7] Andrea Calì, Georg Gottlob and Andreas Pieris. Towards More Expressive Ontology Languages: The Query Answering Problem. Artificial Intelligence, 193: [8] Andrea Calì, Georg Gottlob and Andreas Pieris. Ontological Query Answering under Expressive Entity- Relationship Schemata. Information Systems, 37(4): [9] Giorgio Orsi and Andreas Pieris. Optimizing Query Answering under Ontological Constraints. Proceedings of the VLDB Endowment (PVLDB), 4(11): [10] Andrea Calì, Georg Gottlob and Andreas Pieris. A Logical Toolbox for Ontological Reasoning. SIGMOD Record, 40(3): 5-14
2 2010 [11] Andrea Calì, Georg Gottlob and Andreas Pieris. Advanced Processing for Ontological Queries. Proceedings of the VLDB Endowment (PVLDB), 3(1): [12] Rainer Feldmann, Marios Mavronicolas and Andreas Pieris. Facets of the Fully Mixed Nash Equilibrium Conjecture. Theory of Computing Systems, 47(1): CONFERENCE PAPERS 2019 [13] Marco Calautti and Andreas Pieris. Oblivious Chase Termination: The Sticky Case. Proceeding of the 22 nd International Conference on Database Theory (ICDT). To appear [14] Gerald Berger, Martin Otto, Andreas Pieris, Dimitri Surinx and Jan Van den Bussche. Additive First-Order Queries. Proceeding of the 22 nd International Conference on Database Theory (ICDT). To appear 2018 [15] Marco Calautti, Leonid Libkin and Andreas Pieris. An Operational Approach to Consistent Query Answering. Proceeding of the 37 th Symposium on Principles of Database Systems (PODS): [16] Pablo Barceló, Gerald Berger and Andreas Pieris. Containment for Rule-Based Ontology Mediated Queries. Proceeding of the 37 th Symposium on Principles of Database Systems (PODS): [17] Pablo Barceló, Gerald Berger, Carsten Lutz and Andreas Pieris. First-Order Rewritability of Frontier- Guarded Ontology-Mediated Queries. Proceedings of the 27 th International Joint Conference on Artificial Intelligence (IJCAI): [18] Georg Gottlob, Marco Manna and Andreas Pieris. Finite Model Reasoning in Hybrid Classes of Existential Rules. Proceedings of the 27 th International Joint Conference on Artificial Intelligence (IJCAI): [19] Luigi Bellomarini, Georg Gottlob, Andreas Pieris and Emanuel Sallinger. Swift Logic for Big Data and Knowledge Graphs Overview of Requirements, Language, and System. Proceedings of the 44 th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM): [20] Mario Alviano, Michael Morak and Andreas Pieris. Stable Model Semantics for Tuple-Generating Dependencies Revisited. Proceeding of the 36 th Symposium on Principles of Database Systems (PODS): [21] Pierre Bourhis, Michael Morak and Andreas Pieris. Making Cross Products and Guarded Ontology Languages Compatible. Proceedings of the 26 th International Joint Conference on Artificial Intelligence (IJCAI): [22] Luigi Bellomarini, Georg Gottlob, Andreas Pieris and Emanuel Sallinger. Swift Logic for Big Data and Knowledge Graphs. Proceedings of the 26 th International Joint Conference on Artificial Intelligence (IJCAI): 2-10 [23] Georg Gottlob, Christoph Koch and Andreas Pieris. Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data. Proceeding of the 11th International Conference on Language and Automata Theory and Applications (LATA): 27-47
3 2016 [24] Pablo Barceló, Georg Gottlob and Andreas Pieris. Semantic Acyclicity Under Constraints. Proceeding of the 35 th Symposium on Principles of Database Systems (PODS): [25] Gerald Berger and Andreas Pieris. Ontology-Mediated Queries Distributing Over Components. Proceedings of the 25 th International Joint Conference on Artificial Intelligence (IJCAI): [26] Georg Gottlob, Andreas Pieris and Mantas Šimkus. The Impact of Active Domain Predicates on Guarded Existential Rules. Proceeding of the 10 th International Conference on Web Reasoning and Rule Systems (RR): [27] Mario Alviano and Andreas Pieris. Default Negation for Non-Guarded Existential Rules. Proceeding of the 34 th Symposium on Principles of Database Systems (PODS): [28] Marco Calautti, Georg Gottlob and Andreas Pieris. Chase Termination for Guarded Existential Rules. Proceeding of the 34 th Symposium on Principles of Database Systems (PODS): [29] Marco Manna, Georg Gottlob and Andreas Pieris. Polynomial Rewritings for Linear Existential Rules. Proceedings of the 24 th International Joint Conference on Artificial Intelligence (IJCAI): [30] Georg Gottlob and Andreas Pieris. Beyond SPARQL under OWL 2 QL Entailment Regimes: Rules to the Rescue. Proceedings of the 24 th International Joint Conference on Artificial Intelligence (IJCAI): [31] Thomas Lukasiewicz, Maria Vanina Martinez, Andreas Pieris and Gerardo I. Simari. From Classical to Consistent Query Answering under Existential Rules. Proceedings of the 29 th Conference on Artificial Intelligence (AAAI): [32] Georg Gottlob, Giorgio Orsi and Andreas Pieris. Consistency Checking of Re-Engineered UML Class Diagrams via Datalog+/-. Proceedings of the 9 th International Web Rule Symposium (RuleML): [33] Marcelo Arenas, Georg Gottlob and Andreas Pieris. Expressive Languages for Querying the Semantic Web. Proceeding of the 33 rd Symposium on Principles of Database Systems (PODS): [34] Georg Gottlob, Marco Manna and Andreas Pieris. Polynomial Combined Rewritings for Existential Rules. Proceedings of the 14 th International Conference on Principles of Knowledge Representation and Reasoning (KR): [35] Pierre Bourhis, Michael Morak and Andreas Pieris. Towards Efficient Reasoning under Guarded-based Disjunctive Existential Rules. Proceedings of the 39 th International Symposium on Mathematical Foundations of Computer Science (MFCS): [36] Georg Gottlob, Andreas Pieris and Lidia Tendera. Querying the Guarded Fragment with Transitivity. Proceedings of the 40 th International Colloquium on Automata, Languages and Programming (ICALP): [37] Pierre Bourhis, Michael Morak and Andreas Pieris. The Impact of Disjunction on Query Answering Under Guarded-based Existential Rules. Proceedings of the 23 rd International Joint Conference on Artificial Intelligence (IJCAI):
4 2012 [38] Andrea Calì, Georg Gottlob, Giorgio Orsi and Andreas Pieris. Querying UML Class Diagrams. Proceedings of the 15 th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS): 1-25 [39] Georg Gottlob, Marco Manna, Michael Morak and Andreas Pieris. On the Complexity of Ontological Reasoning under Disjunctive Existential Rules. Proceedings of the 37 th International Symposium on Mathematical Foundations of Computer Science (MFCS): [40] Georg Gottlob, Giorgio Orsi and Andreas Pieris. Ontological Queries: Rewriting and Optimization. Proceedings of the 27 th International Conference on Data Engineering (ICDE): 2-13 [41] Andrea Calì, Georg Gottlob and Andreas Pieris. New Expressive Languages for Ontological Query Answering. Proceedings of the 25 th Conference on Artificial Intelligence (AAAI): [42] Andrea Calì, Georg Gottlob and Andreas Pieris. Querying Conceptual Schemata with Expressive Equality Constraints. Proceedings of the 30 th International Conference on Conceptual Modeling (ER): [43] Andrea Calì and Andreas Pieris. On Equality-Generating Dependencies in Ontology Querying (Extended Abstract). Proceedings of the 19 th Italian Symposium on Advanced Database Systems (SEBD): [44] Georg Gottlob, Giorgio Orsi and Andreas Pieris. Ontological Query Answering via Rewriting. Proceedings of the 14 th East European Conference on Advances in Databases and Information Systems (ADBIS): [45] Andrea Calì, Georg Gottlob, Thomas Lukasiewicz, Bruno Marnette and Andreas Pieris. Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications. Proceedings of the 25 th Annual IEEE Symposium on Logic in Computer Science (LICS): [46] Andrea Calì, Georg Gottlob, Michael Kifer, Thomas Lukasiewicz and Andreas Pieris. Ontological Reasoning with F-Logic Lite and its Extensions. Proceedings of the 24 th Conference on Artificial Intelligence (AAAI): [47] Andrea Calì, Georg Gottlob and Andreas Pieris. Query Answering under Expressive Entity-Relationship Schemata. In Proceedings of the 29 th International Conference on Conceptual Modeling (ER): [48] Andrea Calì, Georg Gottlob and Andreas Pieris. Query Answering under Non-Guarded Rules in Datalog+/-. In Proceedings of the 4 th International Conference on Web Reasoning and Rule Systems (RR): 1-17 [49] Andrea Calì, Georg Gottlob and Andreas Pieris. Tractable Query Answering over Conceptual Schemata (Extended Abstract). Proceedings of the 18 th Italian Symposium on Advanced Database Systems (SEBD): [50] Andrea Calì, Georg Gottlob and Andreas Pieris. Tractable Query Answering over Conceptual Schemata. In Proceedings of the 28 th International Conference on Conceptual Modeling (ER): [51] Rainer Feldmann, Marios Mavronicolas and Andreas Pieris. Facets of the Fully Mixed Nash Equilibrium Conjecture. Proceedings of the 1 st International Symposium on Algorithmic Game Theory (SAGT):
5 WORKSHOP PAPERS 2018 [52] Marco Calautti, Leonid Libkin and Andreas Pieris. An Operational Approach to Consistent Query Answering. Proceeding of the 12 th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW) [53] Pablo Barceló, Gerald Berger, Carsten Lutz and Andreas Pieris. First-Order Rewritability of Frontier- Guarded Ontology-Mediated Queries. Proceeding of the 12 th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW) [54] Luigi Bellomarini, Georg Gottlob, Andreas Pieris and Emanuel Sallinger. The Vadalog System: Swift Logic for Big Data and Enterprise Knowledge Graphs. Proceeding of the 12 th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW) 2017 [55] Pablo Barceló, Gerald Berger and Andreas Pieris. Guarded Ontology-Mediated Queries Distributing Over Components. Proceeding of the 11 th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW) 2016 [56] Pablo Barceló, Georg Gottlob and Andreas Pieris. Semantic Acyclicity Under Constraints. Proceeding of the 10 th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW) [57] Marcelo Arenas, Georg Gottlob and Andreas Pieris. A Datalog-Based Language for Querying RDF Graphs. Proceeding of the 10 th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW) 2015 [58] Marco Calautti, Georg Gottlob and Andreas Pieris. Chase Termination for Guarded Existential Rules. Proceeding of the 9 th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2015) [59] Thomas Lukasiewicz, Maria Vanina Martinez, Andreas Pieris and Gerardo I. Simari. From Classical to Consistent Query Answering under Existential Rules. Proceeding of the 9 th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW) [60] Marco Manna, Georg Gottlob and Andreas Pieris. Polynomial Combined Rewritings for Linear Existential Rules and DL-Lite with n-ary Relations. Proceedings of the 28 th International Workshop on Description Logics (DL) 2014 [61] Marcelo Arenas, Georg Gottlob and Andreas Pieris. Expressive Languages for Querying the Semantic Web. Proceeding of the 8 th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW) [62] Pierre Bourhis, Michael Morak and Andreas Pieris. Acyclic Query Answering Under Guarded Disjunctive Existential Rules and Consequences to DLs. Proceedings of the 27 th International Workshop on Description Logics (DL)
6 2013 [63] Pierre Bourhis, Michael Morak and Andreas Pieris. The Impact of Disjunction on Query Answering Under Guarded-based Existential Rules. Proceedings of the 26 th International Workshop on Description Logics (DL) 2011 [64] Andrea Calì and Andreas Pieris. On Equality-Generating Dependencies in Ontology Querying Preliminary Report. Proceedings of the 5 th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW) 2010 [65] Andrea Calì, Georg Gottlob and Andreas Pieris. Query Rewriting under Non-Guarded Rules. Proceedings of the 4 th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW) [66] Andrea Calì, Georg Gottlob, Thomas Lukasiewicz and Andreas Pieris. Datalog+/-: A Family of Languages for Ontology Querying. Proceedings of the 1 st Datalog 2.0 International Workshop: BOOK CHAPTERS [67] Andrea Calì, Georg Gottlob and Andreas Pieris. The Return of the Entity-Relationship Model: Ontological Query Answering. Semantic Search over the Web, Roberto de Virgilio, Francesco Guerra, and Yannis Velegrakis eds., Springer-Verlag, 2012 MISCELLANEOUS [68] Georg Gottlob, Michael Morak and Andreas Pieris. Recent Advances in Datalog+/-. Proceedings of the 11 th Reasoning Web Summer School: , 2015 [69] Andrea Calì, Georg Gottlob and Andreas Pieris. Tractable Reasoning in Description Logics with Functionality Constraints. Search of Elegance in the Theory and Practice of Computation Essays Dedicated to Peter Buneman: , 2013 [70] Georg Gottlob, Giorgio Orsi, Andreas Pieris and Mantas Šimkus. Datalog and Its Extensions for Semantic Web Databases. Proceedings of the 8 th Reasoning Web Summer School: 54-77, 2012 [71] Andrea Calì, Georg Gottlob, Giorgio Orsi and Andreas Pieris. On the Interaction of Existential Rules and Equality Constraints in Ontology Querying. Proceedings of Correct Reasoning Essays on Logic-Based AI in Honour of Vladimir Lifschitz: , 2012 THESES [72] Ontological Query Answering: New Languages, Algorithms and Complexity. Doctoral thesis, Department of Computer Science, University of Oxford, 2011 [73] Data Exchange and Schema Mappings. Master s thesis, Mathematical Institute, University of Oxford, 2007 [74] The Fully Mixed Nash Equilibrium Conjecture. Bachelor s thesis, Department of Computer Science, University of Cyprus, 2006
The VADALOG System: Swift Logic for Big Data and Enterprise Knowledge Graphs
The VADALOG System: Swift Logic for Big Data and Enterprise Knowledge Graphs Luigi Bellomarini 12, Georg Gottlob 13, Andreas Pieris 4, Emanuel Sallinger 1 1 Introduction 1 University of Oxford, UK 2 Banca
Rewrite 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
Approximation Algorithms for Computing Certain Answers over Incomplete Databases
Approximation Algorithms for Computing Certain Answers over Incomplete Databases Sergio Greco, Cristian Molinaro, and Irina Trubitsyna {greco,cmolinaro,trubitsyna}@dimes.unical.it DIMES, Università della
Publications of Pablo Barceló by type
Publications of Pablo Barceló by type Type A 1. Pablo Barceló. Logical Foundations of Relational Data Exchange. SIGMOD Record 38(1):49-58, Mar 2009. ACM Press, New York, NY, USA. ISSN 0163-5808. 2. Leonid
Graph Databases. Advanced Topics in Foundations of Databases, University of Edinburgh, 2017/18
Graph Databases Advanced Topics in Foundations of Databases, University of Edinburgh, 2017/18 Graph Databases and Applications Graph databases are crucial when topology is as important as the data Several
Bibliographic 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
Datalog : A Unifying Framework for Ontological Reasoning and Query Answering
Datalog : A Unifying Framework for Ontological Reasoning and Query Answering Georg Gottlob and Andreas Pieris Department of Computer Science University of Oxford Ontology, Rules, and Logic Programming
PPDL: Probabilistic Programming with Datalog
PPDL: Probabilistic Programming with Datalog Balder ten Cate 1, Benny Kimelfeld 2,1, and Dan Olteanu 3,1 1 LogicBlox, Inc., USA 2 Technion, Israel 3 University of Oxford, UK 1 Introduction There has been
Checking 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,
Logical reconstruction of RDF and ontology languages
Logical reconstruction of RDF and ontology languages Jos de Bruijn 1, Enrico Franconi 2, and Sergio Tessaris 2 1 Digital Enterprise Research Institute, University of Innsbruck, Austria jos.debruijn@deri.org
Publications of Magdalena Ortiz September 26, 2014
Publications of Magdalena Ortiz September 26, 2014 Journals [1] Diego Calvanese, Thomas Eiter, and Magdalena Ortiz. Answering Regular Path Queries in Expressive Description Logics via Alternating Tree-Automata.
Probabilistic Information Integration and Retrieval in the Semantic Web
Probabilistic Information Integration and Retrieval in the Semantic Web Livia Predoiu Institute of Computer Science, University of Mannheim, A5,6, 68159 Mannheim, Germany livia@informatik.uni-mannheim.de
Conjunctive Query Containment in Description Logics with n-ary Relations
Conjunctive Query Containment in Description Logics with n-ary Relations Diego Calvanese and Giuseppe De Giacomo and Maurizio Lenzerini Dipartimento di Informatica e Sistemistica Università di Roma La
Scalable 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
Query Rewriting Under Ontology Evolution
Query Rewriting Under Ontology Evolution Eleni Tsalapati, Giorgos Stoilos, Giorgos Stamou, and George Koletsos School of Electrical and Computer Engineering, National Technical University of Athens, Zographou
Outline. Database Theory. Prerequisites and Admission. Classes VU , SS 2018
Database Theory Database Theory Outline Database Theory VU 181.140, SS 2018 0. General Information Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 6 March,
TrOWL: Tractable OWL 2 Reasoning Infrastructure
TrOWL: Tractable OWL 2 Reasoning Infrastructure Edward Thomas, Jeff Z. Pan, and Yuan Ren Department of Computing Science, University of Aberdeen, Aberdeen AB24 3UE, UK Abstract. The Semantic Web movement
Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability
Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability Georg Gottlob 1,2, Reinhard Pichler 1, and Emanuel Sallinger 2 1 TU Wien and 2 University of Oxford Tuple-generating
a 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
XXXII 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
Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data
Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data Georg Gottlob 1, Christoph Koch 2, and Andreas Pieris 3 1 University of Oxford georg.gottlob@cs.ox.ac.uk 2 École Polytechnique
Craig 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
Evaluation of Query Rewriting Approaches for OWL 2
Evaluation of Query Rewriting Approaches for OWL 2 Héctor Pérez-Urbina, Edgar Rodríguez-Díaz, Michael Grove, George Konstantinidis, and Evren Sirin Clark & Parsia, LLC United States {hector,edgar,mike,george,evren}@clarkparsia.com
Department 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
Expressive Identification Constraints to Capture Functional Dependencies in Description Logics
Expressive Identification Constraints to Capture Functional Dependencies in Description Logics Diego Calvanese 1, Wolfgang Fischl 2, Reinhard Pichler 2, Emanuel Sallinger 2, and Mantas Šimkus2 1 KRDB Research
The 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
RECENT ADVANCES IN REASONING WITH EXISTENTIAL RULES
RECENT ADVANCES IN REASONING WITH EXISTENTIAL RULES Markus Krötzsch Knowledge-Based Systems reporting joint work with David Carral (TUD), Irina Dragoste (TUD), Ceriel Jacobs (VUE), Jacopo Urbani (VUE)
Answer Sets and the Language of Answer Set Programming. Vladimir Lifschitz
Answer Sets and the Language of Answer Set Programming Vladimir Lifschitz Answer set programming is a declarative programming paradigm based on the answer set semantics of logic programs. This introductory
Using ontologies for semantic data integration
Using ontologies for semantic data integration Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Antonella Poggi, Riccardo Rosati Dipartimento di Ingegneria Informatica, Automatica e Gestionale
Center for Semantic Web Research.
Center for Semantic Web Research www.ciws.cl, @ciwschile Three institutions PUC, Chile Marcelo Arenas (Boss) SW, data exchange, semistrucured data Juan Reutter SW, graph DBs, DLs Cristian Riveros data
Nonmonotonic Databases and Epistemic Queries*
Nonmonotonic Databases and Epistemic Queries* Vladimir Lifschitz Department of Computer Sciences and Department of Philosophy University of Texas at Austin Austin, TX 78712, U. S. A. Abstract The approach
Choice Logic Programs and Nash Equilibria in Strategic Games
Choice Logic Programs and Nash Equilibria in Strategic Games Marina De Vos and Dirk Vermeir Dept. of Computer Science Free University of Brussels, VUB Pleinlaan 2, Brussels 1050, Belgium Tel: +32 2 6293308
OWL Rules, OK? Ian Horrocks Network Inference Carlsbad, CA, USA
OWL Rules, OK? Ian Horrocks Network Inference Carlsbad, CA, USA ian.horrocks@networkinference.com Abstract Although the OWL Web Ontology Language adds considerable expressive power to the Semantic Web
Updating data and knowledge bases
Updating data and knowledge bases Towards introducing updates in Ontology-Based Data Management systems Antonella Poggi 23rd Italian Symposium on Advanced Database Systems (2015) June 14th, 2015 Overview
ATFD: material for presentations, projects, and essays
ATFD: material for presentations, projects, and essays Winter 2016 The references are taken from DBLP (http://dblp.uni-trier.de), the main bibliographical source for computer science research. You can
INCONSISTENT DATABASES
INCONSISTENT DATABASES Leopoldo Bertossi Carleton University, http://www.scs.carleton.ca/ bertossi SYNONYMS None DEFINITION An inconsistent database is a database instance that does not satisfy those integrity
Visualization and Management of Mappings in Ontology-based Data Access (Progress Report)
Visualization and Management of Mappings in Ontology-based Data Access (Progress Report) Domenico Lembo, Riccardo Rosati, Marco Ruzzi, Domenico Fabio Savo, Emanuele Tocci Dipartimento di Ingegneria Informatica
Consistent Query Answering: Opportunities and Limitations
Consistent Query Answering: Opportunities and Limitations Jan Chomicki Dept. Computer Science and Engineering University at Buffalo, SUNY Buffalo, NY 14260-2000, USA chomicki@buffalo.edu Abstract This
Data integration lecture 3
PhD course on View-based query processing Data integration lecture 3 Riccardo Rosati Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza {rosati}@dis.uniroma1.it Corso di Dottorato
Automata Theory for Reasoning about Actions
Automata Theory for Reasoning about Actions Eugenia Ternovskaia Department of Computer Science, University of Toronto Toronto, ON, Canada, M5S 3G4 eugenia@cs.toronto.edu Abstract In this paper, we show
Improving Data Management Using Domain Knowledge
Improving Data Management Using Domain Knowledge Magdalena Ortiz Faculty of Informatics, TU Wien, Austria ortiz@kr.tuwien.ac.at Abstract The development of tools and techniques for flexible and reliable
Inconsistency Management in Generalized Knowledge and Action Bases.
Inconsistency Management in Generalized Knowledge and ction Bases. Diego Calvanese, Marco Montali, and rio Santoso Free University of Bozen-Bolzano, Bolzano, Italy lastname@inf.unibz.it 1 Introduction
Query Rewriting Using Views in the Presence of Inclusion Dependencies
Query Rewriting Using Views in the Presence of Inclusion Dependencies Qingyuan Bai Jun Hong Michael F. McTear School of Computing and Mathematics, University of Ulster at Jordanstown, Newtownabbey, Co.
Mastro Studio: a system for Ontology-Based Data Management
Mastro Studio: a system for Ontology-Based Data Management Cristina Civili, Marco Console, Domenico Lembo, Lorenzo Lepore, Riccardo Mancini, Antonella Poggi, Marco Ruzzi, Valerio Santarelli, and Domenico
Logic Programs for Consistently Querying Data Integration Systems
Logic Programs for Consistently Querying Data Integration Systems Loreto Bravo Pontificia Universidad Católica de Chile Departamento de Ciencia de Computación Santiago, Chile. lbravo@ing.puc.cl Leopoldo
jcel: A Modular Rule-based Reasoner
jcel: A Modular Rule-based Reasoner Julian Mendez Theoretical Computer Science, TU Dresden, Germany mendez@tcs.inf.tu-dresden.de Abstract. jcel is a reasoner for the description logic EL + that uses a
Structural Characterization of Graph Navigational Languages (Extended Abstract)
Structural Characterization of Graph Navigational Languages (Extended Abstract) Valeria Fionda 1 and Giuseppe Pirrò 2 1 DeMaCS, University of Calabria, Italy fionda@mat.unical.it 2 Institute for High Performance
Data Integration: A Logic-Based Perspective
Data Integration: A Logic-Based Perspective Diego Calvanese Faculty of Computer Science Free University of Bolzano/Bozen Piazza Domenicani 3, 39100 Bolzano, Italy calvanese@inf.unibz.it Giuseppe De Giacomo
Description Logics. Description Logics and Databases
1 + Description Logics Description Logics and Databases Enrico Franconi Department of Computer Science University of Manchester http://www.cs.man.ac.uk/~franconi 2 + Description Logics and Databases Queries
Deliverable D1.4 First Year Report on Work Package 1 Dissemination level: PU Date: 11 June 2010
FoX FET-Open grant FP7-ICT-233599 Deliverable D1.4 First Year Report on Work Package 1 Dissemination level: PU Date: 11 June 2010 1 Overview Objective of the WP. The key objectives of this work package
Processing 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
Learning Queries for Relational, Semi-structured, and Graph Databases
Learning Queries for Relational, Semi-structured, and Graph Databases Radu Ciucanu University of Lille & INRIA, France Supervised by Angela Bonifati & S lawek Staworko SIGMOD 13 PhD Symposium June 23,
Foundations of SPARQL Query Optimization
Foundations of SPARQL Query Optimization Michael Schmidt, Michael Meier, Georg Lausen Albert-Ludwigs-Universität Freiburg Database and Information Systems Group 13 th International Conference on Database
Introduction Data Integration Summary. Data Integration. COCS 6421 Advanced Database Systems. Przemyslaw Pawluk. CSE, York University.
COCS 6421 Advanced Database Systems CSE, York University March 20, 2008 Agenda 1 Problem description Problems 2 3 Open questions and future work Conclusion Bibliography Problem description Problems Why
Reasonable Highly Expressive Query Languages
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) IJCAI-15 Distinguished Paper, Honorary Mention Reasonable Highly Expressive Query Languages Pierre
<is web> Information Systems & Semantic Web University of Koblenz Landau, Germany
Information Systems University of Koblenz Landau, Germany Joint Metamodels for UML and OWL Ontologies & Software Tech: Starting Point @Koblenz IST Institute for Software Technology @Koblenz OWL Model theory
Query Answering in Peer-to-Peer Data Exchange Systems
Query Answering in Peer-to-Peer Data Exchange Systems Leopoldo Bertossi and Loreto Bravo Carleton University, School of Computer Science, Ottawa, Canada. {bertossi,lbravo}@scs.carleton.ca Abstract. The
following syntax: R ::= > n j P j $i=n : C j :R j R 1 u R 2 C ::= > 1 j A j :C j C 1 u C 2 j 9[$i]R j (» k [$i]r) where i and j denote components of r
![following syntax: R ::= > n j P j $i=n : C j :R j R 1 u R 2 C ::= > 1 j A j :C j C 1 u C 2 j 9[$i]R j (» k [$i]r) where i and j denote components of r](/thumbs/80/82451722.jpg "following syntax: R ::= > n j P j $i=n : C j :R j R 1 u R 2 C ::= > 1 j A j :C j C 1 u C 2 j 9[$i]R j (» k [$i]r) where i and j denote components of r")
Answering Queries Using Views in Description Logics Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini Dipartimento di Informatica e Sistemistica, Universit a di Roma La Sapienza" Via Salaria 113,
A Tool for Storing OWL Using Database Technology
A Tool for Storing OWL Using Database Technology Maria del Mar Roldan-Garcia and Jose F. Aldana-Montes University of Malaga, Computer Languages and Computing Science Department Malaga 29071, Spain, (mmar,jfam)@lcc.uma.es,
1 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.................................
Practical Aspects of Query Rewriting for OWL 2
Practical Aspects of Query Rewriting for OWL 2 Héctor Pérez-Urbina, Ian Horrocks, and Boris Motik Oxford University Computing Laboratory, Oxford, England {hector.perez-urbina,ian.horrocks,boris.motik}@comlab.ox.ac.uk
Database Optimization Techniques for Semantic Queries
Database Optimization Techniques for Semantic Queries Ioana Manolescu INRIA, France ioana.manolescu@inria.fr, http://pages.saclay.inria.fr/ioana.manolescu https://team.inria.fr/oak SEBD 2015, Gaeta I.
OWL and tractability. Based on slides from Ian Horrocks and Franz Baader. Combining the strengths of UMIST and The Victoria University of Manchester
OWL and tractability Based on slides from Ian Horrocks and Franz Baader Where are we? OWL Reasoning DL Extensions Scalability OWL OWL in practice PL/FOL XML RDF(S)/SPARQL Practical Topics Repetition: DL
OWL 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
Edinburgh Research Explorer
Edinburgh Research Explorer Hippo: A System for Computing Consistent Answers to a Class of SQL Queries Citation for published version: Chomicki, J, Marcinkowski, J & Staworko, S 2004, Hippo: A System for
RELATIONAL 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
On 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
a 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
On the Reduction of Dublin Core Metadata Application Profiles to Description Logics and OWL
On the Reduction of Dublin Core Metadata Application Profiles to Description Logics and OWL Dimitrios A. Koutsomitropoulos High Performance Information Systems Lab, Computer Engineering and Informatics
Scalable Data Exchange with Functional Dependencies
Scalable Data Exchange with Functional Dependencies Bruno Marnette 1, 2 Giansalvatore Mecca 3 Paolo Papotti 4 1: Oxford University Computing Laboratory Oxford, UK 2: INRIA Saclay, Webdam Orsay, France
The Formal Argumentation Libraries of Tweety
The Formal Argumentation Libraries of Tweety Matthias Thimm Institute for Web Science and Technologies (WeST), University of Koblenz-Landau, Germany Abstract. We provide an overview on the argumentation
Essential Gringo (Draft)
Essential Gringo (Draft) Vladimir Lifschitz, University of Texas 1 Introduction The designers of the Abstract Gringo language AG [Gebser et al., 2015a] aimed at creating a relatively simple mathematical
Analyzing Real-World SPARQL Queries in the Light of Probabilistic Data
Analyzing Real-World SPARQL Queries in the Light of Probabilistic Data Joerg Schoenfisch and Heiner Stuckenschmidt Data and Web Science Group University of Mannheim B6 26, 68159 Mannheim, Germany {joerg,heiner}@informatik.uni-mannheim.de
Efficiently Managing Data Intensive Ontologies
Efficiently Managing Data Intensive Ontologies Diego Calvanese 1, Giuseppe De Giacomo 2, Domenico Lembo 2, Maurizio Lenzerini 2, Riccardo Rosati 2 1 Faculty of Computer Science Free University of Bozen-Bolzano
Provable data privacy
Provable data privacy Kilian Stoffel 1 and Thomas Studer 2 1 Université de Neuchâtel, Pierre-à-Mazel 7, CH-2000 Neuchâtel, Switzerland kilian.stoffel@unine.ch 2 Institut für Informatik und angewandte Mathematik,
Rewriting Ontology-Mediated Queries. Carsten Lutz University of Bremen
Rewriting Ontology-Mediated Queries Carsten Lutz University of Bremen Data Access and Ontologies Today, data is often highly incomplete and very heterogeneous Examples include web data and large-scale
Description Logic: A Formal Foundation for Ontology Languages and Tools
Description Logic: A Formal Foundation for Ontology Languages and Tools Part 2: Tools Ian Horrocks Information Systems Group Oxford University Computing Laboratory Contents
Description Logic Programs: Overview for DAML and WebOnt
Description Logic Programs: Overview for DAML and WebOnt Adapted from Presentation for DAML PI Meeting, made Oct. 17, 2002, Portland, OR, USA This version is from Oct. 21, 2002. Benjamin Grosof MIT Sloan
SeMFIS: A Tool for Managing Semantic Conceptual Models
Workshop on Graphical Modeling Language Development July 3, 2012 Kgs. Lyngby, Denmark SeMFIS: A Tool for Managing Semantic Conceptual Models Hans-Georg Fill Co-sponsored by the Austrian Science Fund: Grant
Master Thesis Presentation
Master Thesis Presentation ebiss Summer School 2017 Active Business Intelligence Compact and Efficient Query Processing under Updates Presenter: Muhammad Idris Advisors: Prof. Stijn Vansummeren Prof. Wolfgang
Opus: University of Bath Online Publication Store
Patel, M. (2004) Semantic Interoperability in Digital Library Systems. In: WP5 Forum Workshop: Semantic Interoperability in Digital Library Systems, DELOS Network of Excellence in Digital Libraries, 2004-09-16-2004-09-16,
Supporting the Design of Ontologies for Data Access
Supporting the Design of Ontologies for Data Access A Preliminary Investigation Lina Lubyte and Sergio Tessaris Faculty of Computer Science Free University of Bozen-Bolzano Abstract. The benefits of using
Giorgio Orsi 89, Great Clarendon Street, Oxford (UK) Mobile: +44 (0)
Giorgio Orsi 89, Great Clarendon Street, Oxford (UK) Mobile: +44 (0) 7575252546 orsi.giorgio@gmail.com http://orsigiorgio.net/ Academic appointments Dec 2015 - current Apr 13 - Nov 15 Jan 11 March 13 Feb
An Archiving System for Managing Evolution in the Data Web
An Archiving System for Managing Evolution in the Web Marios Meimaris *, George Papastefanatos and Christos Pateritsas * Institute for the Management of Information Systems, Research Center Athena, Greece
Regular Expressions for Data Words
Regular Expressions for Data Words Leonid Libkin and Domagoj Vrgoč School of Informatics, University of Edinburgh Abstract. In data words, each position carries not only a letter form a finite alphabet,
Designing Views to Answer Queries under Set, Bag,and BagSet Semantics
Designing Views to Answer Queries under Set, Bag,and BagSet Semantics Rada Chirkova Department of Computer Science, North Carolina State University Raleigh, NC 27695-7535 chirkova@csc.ncsu.edu Foto Afrati
DLP isn t so bad after all
DLP isn t so bad after all Pascal Hitzler, Peter Haase, Markus Krötzsch, York Sure, and Rudi Studer AIFB, Universität Karlsruhe, Germany Abstract. We discuss some of the recent controversies concerning
Mining the Web of Data with Metaqueries
Mining the Web of Data with Metaqueries Francesca A. Lisi University of Bari Aldo Moro Department of Computer Science Lab of Knowledge Acquisition and Machine Learning (LACAM) FrancescaAlessandra.Lisi@uniba.it
Schema-Agnostic Query Rewriting in SPARQL 1.1
Fakultät Informatik, Institut Künstliche Intelligenz, Professur Computational Logic Schema-Agnostic Query Rewriting in SPARQL 1.1 Stefan Bischof, Markus Krötzsch, Axel Polleres and Sebastian Rudolph Plain
U2R2 The Ulm University Relational Reasoner: System Description
U2R2 The Ulm University Relational Reasoner: System Description Timo Weithöner Inst. of AI, Ulm University, 89069 Ulm, Germany timo.weithoener@uni-ulm.de Abstract. This is a system description of the Ulm
Logical Foundations of Relational Data Exchange
Logical Foundations of Relational Data Exchange Pablo Barceló Department of Computer Science, University of Chile pbarcelo@dcc.uchile.cl 1 Introduction Data exchange has been defined as the problem of
Monadic 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,
Requirements Engineering for Enterprise Systems
Association for Information Systems AIS Electronic Library (AISeL) AMCIS 2001 Proceedings Americas Conference on Information Systems (AMCIS) December 2001 Requirements Engineering for Enterprise Systems
Schema Equivalence and Optimization
Reference: Mustafa Jarrar: Lecture Notes on Schema Equivalence and Optimization in ORM Birzeit University, Palestine, 2015 Schema Equivalence and Optimization Dr. Mustafa Jarrar University of Birzeit mjarrar@birzeit.edu
OWL 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
Ontologies, OWL, OWL profiles
Knowledge Representation and Semantic Technologies Ontologies, OWL, OWL profiles Riccardo Rosati Corso di Laurea Magistrale in Ingegneria Informatica Sapienza Università di Roma 2013/2014 The Semantic
Data Integration A Logic-Based Perspective
AI Magazine Volume 26 Number 1 (2005) ( AAAI) Articles Data Integration A Logic-Based Perspective Diego Calvanese and Giuseppe De Giacomo Data integration is the problem of combining data residing at different
A Novel Method for the Comparison of Graphical Data Models
3RD INTERNATIONAL CONFERENCE ON INFORMATION SYSTEMS DEVELOPMENT (ISD01 CROATIA) A Novel Method for the Comparison of Graphical Data Models Katarina Tomičić-Pupek University of Zagreb, Faculty of Organization
Personalised Search for the Social Semantic Web
Personalised Search for the Social Semantic Web Oana Tifrea-Marciuska Wolfson College Department of Computer Science University of Oxford Supervised by Prof. Thomas Lukasiewicz Trinity 2016 A thesis submitted
On Order Dependencies for the Semantic Web
On Order Dependencies for the Semantic Web David Toman and Grant Weddell David R. Cheriton School of Computer Science University of Waterloo, Canada Email: {david,gweddell}@uwaterloo.ca Faculty of Computer