Annotation algebras for RDFS
|
|
- Loreen Madeline Mathews
- 6 years ago
- Views:
Transcription
1 University of Edinburgh Semantic Web in Provenance Management, 2010
2 RDF definition U a set of RDF URI references (s, p, o) U U U an RDF triple s subject p predicate o object A finite set of triples an RDF graph
3 RDFS vocabulary RDF Schema a vocabulary of URI s with special semantics: rdfs:resource, rdfs:class, rdfs:literal, rdfs:subclassof, rdfs:subpropertyof, rdfs:domain, rdfs:range, rdf:, rdf:list,... ρdf [S. Muñoz, et al.] a fragment of RDFS vocabulary: sc, sp, dom, range,
4 RDFS vocabulary RDF Schema a vocabulary of URI s with special semantics: rdfs:resource, rdfs:class, rdfs:literal, rdfs:subclassof, rdfs:subpropertyof, rdfs:domain, rdfs:range, rdf:, rdf:list,... ρdf [S. Muñoz, et al.] a fragment of RDFS vocabulary: sc, sp, dom, range,
5 RDFS deductive system Sub-class: (A, sc, B) (B, sc, C) ; (A, sc, C) Sub-property: (A, sp, B) (B, sp, C) ; (A, sp, C) Typing: (X, A, Y) (A, dom, B) ; (X,, B) (X,, A) (A, sc, B). (X,, B) (X, A, Y) (A, sp, B). (X, B, Y) (X, A, Y) (A, range, B). (Y,, B)
6 Example of RDF graph {(Picasso, Paints, Guernica), (Picasso,, Cubist), (Paints, dom, Painter), (Cubist, sc, Painter) } (Picasso,, Painter)} Cubist sc Painter dom Picasso Paints Guernica
7 Example of RDF graph {(Picasso, Paints, Guernica), (Picasso,, Cubist), (Paints, dom, Painter), (Cubist, sc, Painter), } (Picasso,, Painter)} Cubist sc Painter dom Picasso Paints Guernica
8 Annotations for RDF Named graphs [J. Caroll, et al.] trust annotations, Temporal RDF [C. Gutierrez, et al.] temporal annotations, Colored RDF [G. Flouris, et al.] provenance annotations, Fuzzy RDF [U. Straccia] probabilistic annotations. In all of these works the fourth column introduced to store an annotation information about an RDF triple: (s, p, o) : v Last two of them introduce approaches how annotations pass through the RDFS inference rules.
9 Annotations for RDF Named graphs [J. Caroll, et al.] trust annotations, Temporal RDF [C. Gutierrez, et al.] temporal annotations, Colored RDF [G. Flouris, et al.] provenance annotations, Fuzzy RDF [U. Straccia] probabilistic annotations. In all of these works the fourth column introduced to store an annotation information about an RDF triple: (s, p, o) : v Last two of them introduce approaches how annotations pass through the RDFS inference rules.
10 Examples of annotated RDF graphs Cubist sc Painter dom Picasso Paints Guernica ({ } { }) ({1937} { 29, 000 Now}) = { , 1937} max( , 0.3 1) = 0.32
11 Examples of annotated RDF graphs Cubist sc : [ ] Painter : [ ] : [ , 1937] dom : [-29,000-Now] Picasso Paints : [1937] Guernica ({ } { }) ({1937} { 29, 000 Now}) = { , 1937} max( , 0.3 1) = 0.32
12 Examples of annotated RDF graphs sc Cubist Painter : 0.4 : 0.8 : 0.32 dom : 1 Picasso Paints : 0.3 Guernica ({ } { }) ({1937} { 29, 000 Now}) = { , 1937} max( , 0.3 1) = 0.32
13 Questions of this work What is similar in this examples? U. Straccia: Residuated Lattice What are the requirements for an annotation domain to be compatible with RDFS inference rules? Can we build the universal annotation domain such that any annotation can be obtained from it via a homomorphism?
14 Questions of this work What is similar in this examples? U. Straccia: Residuated Lattice What are the requirements for an annotation domain to be compatible with RDFS inference rules? Can we build the universal annotation domain such that any annotation can be obtained from it via a homomorphism?
15 Questions of this work What is similar in this examples? U. Straccia: Residuated Lattice What are the requirements for an annotation domain to be compatible with RDFS inference rules? Can we build the universal annotation domain such that any annotation can be obtained from it via a homomorphism?
16 Questions of this work What is similar in this examples? U. Straccia: Residuated Lattice What are the requirements for an annotation domain to be compatible with RDFS inference rules? Can we build the universal annotation domain such that any annotation can be obtained from it via a homomorphism?
17 Connection to relational databases Similar questions for relational databases world: What are the requirements for an annotation domain to be compatible with positive relational algebra queries? What is the universal annotation domain such that any annotation can be obtained from it via a homomorphism? How-provenance [T. J. Green, G. Karvounarakis, V. Tannen]: annotation domain commutative semi-ring universal (free) structure semi-ring of positive polynomials over N
18 Connection to relational databases Similar questions for relational databases world: What are the requirements for an annotation domain to be compatible with positive relational algebra queries? What is the universal annotation domain such that any annotation can be obtained from it via a homomorphism? How-provenance [T. J. Green, G. Karvounarakis, V. Tannen]: annotation domain commutative semi-ring universal (free) structure semi-ring of positive polynomials over N
19 Annotated RDFS deductive system Sub-class: (A, sc, B) : v 1 (B, sc, C) : v 2 (A, sc, C) : v 1 v 2 ; (X,, A) : v 1 (A, sc, B) : v 2 (X,, B) : v 1 v 2. Sub-property: (A, sp, B) : v 1 (B, sp, C) : v 2 (A, sp, C) : v 1 v 2 ; (X, A, Y) : v 1 (A, sp, B) : v 2 (X, B, Y) : v 1 v 2. Typing: (X, A, Y) : v 1 (A, dom, B) : v 2 (X,, B) : v 1 v 2 ; (X, A, Y) : v 1(A, range, B) : v 2 (Y,, B) : v 1 v 2. Generalisation: (X, A, Y) : v 1 (X, A, Y) : v 2 (X, A, Y) : v 1 v 2.
20 Annotated RDFS deductive system Sub-class: (A, sc, B) : v 1 (B, sc, C) : v 2 (A, sc, C) : v 1 v 2 ; (X,, A) : v 1 (A, sc, B) : v 2 (X,, B) : v 1 v 2. Sub-property: (A, sp, B) : v 1 (B, sp, C) : v 2 (A, sp, C) : v 1 v 2 ; (X, A, Y) : v 1 (A, sp, B) : v 2 (X, B, Y) : v 1 v 2. Typing: (X, A, Y) : v 1 (A, dom, B) : v 2 (X,, B) : v 1 v 2 ; (X, A, Y) : v 1(A, range, B) : v 2 (Y,, B) : v 1 v 2. Generalisation: (X, A, Y) : v 1 (X, A, Y) : v 2 (X, A, Y) : v 1 v 2.
21 Annotated RDFS deductive system Sub-class: (A, sc, B) : v 1 (B, sc, C) : v 2 (A, sc, C) : v 1 v 2 ; (X,, A) : v 1 (A, sc, B) : v 2 (X,, B) : v 1 v 2. Sub-property: (A, sp, B) : v 1 (B, sp, C) : v 2 (A, sp, C) : v 1 v 2 ; (X, A, Y) : v 1 (A, sp, B) : v 2 (X, B, Y) : v 1 v 2. Typing: (X, A, Y) : v 1 (A, dom, B) : v 2 (X,, B) : v 1 v 2 ; (X, A, Y) : v 1(A, range, B) : v 2 (Y,, B) : v 1 v 2. Generalisation: (X, A, Y) : v 1 (X, A, Y) : v 2 (X, A, Y) : v 1 v 2.
22 Properties of annotation algebras (A, sc, B) : v 1 (B, sc, C) : v 2 (A, sc, C) : v 1 v 2 (Sub-class transitivity) = associativity of, (X, A, Y) : v 1 (X, A, Y) : v 2 (X, A, Y) : v 1 v 2 (Generalisation) = associativity and commutativity of,...
23 Dioids K = K,,,, is a dioid iff it is an idempotent semi-ring: semi-lattice by : (a b) c = a (b c), a b = b a, a = a, a a = a; monoid by : (a b) c = a (b c), a = a = a; distributivity over : a (b c) = (a b) (a c), (b c) a = (b a) (c a); -annihilation of : a = = a. A dioid is a -dioid iff: -annihilation of : a =.
24 Dioids K = K,,,, is a dioid iff it is an idempotent semi-ring: semi-lattice by : (a b) c = a (b c), a b = b a, a = a, a a = a; monoid by : (a b) c = a (b c), a = a = a; distributivity over : a (b c) = (a b) (a c), (b c) a = (b a) (c a); -annihilation of : a = = a. A dioid is a -dioid iff: -annihilation of : a =.
25 String dioids Σ an alphabet. Subsequence ordering u u on words in Σ : u = u 1 u 2... u n u = u 1 w 1 u 2 w 2... w n 1 u n. A finite set m Σ is an antichain if for all its elements are noncomparable. M[Σ] set of antichains. min(m) the set of minimal elements (w.r.t. ) of m. On M[Σ] are defined: m 1 + m 2 = min(m 1 m 2 ), m 1 m 2 = min({w 1 w 2 w 1 m 1, w 2 m 2 }). M[Σ] = M[Σ], +,,, {ɛ} string dioid over Σ.
26 Free -dioids Theorem Given a set of generators Σ the string dioid M[Σ] = M[Σ], +,,, {ɛ} is the free -dioid on Σ. That means, that for any -dioid K f = K,,,, and a valuation φ : Σ K there exists a unique homomorphism Eval φ : M[Σ] K such that for each a Σ holds Eval φ (a) = φ(a).
27 Application of string annotations Cubist sc Painter dom Picasso Paints Guernica
28 Application of string annotations Cubist sc : b Painter : a dom : d Picasso Paints : c Guernica Σ = {a, b, c, d}
29 Application of string annotations Cubist sc : b Painter : a : a b + c d dom : d Picasso Paints : c Guernica Σ = {a, b, c, d}
30 Application of string annotations Cubist sc : b : [ ] Painter : a : [ ] Picasso : a b + c d Paints : c : [1937] dom : d : [-29,000-Now] Guernica φ T : φ T (a) = [ ], φ T (b) = [ ], φ T (c) = [1937], φ T (d) = [ 29, 000 Now]
31 Application of string annotations Cubist sc : b : [ ] Painter : a : [ ] Picasso : a b + c d Paints : c : [1937] dom : d : [ , 1937] : [-29,000-Now] Guernica φ T : φ T (a) = [ ], φ T (b) = [ ], φ T (c) = [1937], φ T (d) = [ 29, 000 Now] Eval φt (a b + c d) = [ , 1937]
32 Application of string annotations sc Cubist : b : 0.4 Painter : a : 0.8 Picasso : a b + c d Paints : c : 0.3 dom : d : 1 Guernica φ P : φ P (a) = 0.8, φ P (b) = 0.4, φ P (c) = 0.3, φ P (d) = 1
33 Application of string annotations sc Cubist : b : 0.4 Painter : a : a b + c d : 0.8 : 0.32 Paints Picasso : c : 0.3 dom : d : 1 Guernica φ P : φ P (a) = 0.8, φ P (b) = 0.4, φ P (c) = 0.3, φ P (d) = 1 Eval φp (a b + c d) = 0.32
34 Discussion In both of the examples the instantiations of is commutative. In the work from relational databases world we are inspired of [T. J. Green, et al.] the product is also commutative. In our work the product in not commutative. Why? There is no evidence in the deductive system that it should be commutative. We do not say that it must be non-commutative, but may be non-commutative. In the paper we present an example of a form of default reasoning where we appear to need a non-commutative product.
35 Discussion In both of the examples the instantiations of is commutative. In the work from relational databases world we are inspired of [T. J. Green, et al.] the product is also commutative. In our work the product in not commutative. Why? There is no evidence in the deductive system that it should be commutative. We do not say that it must be non-commutative, but may be non-commutative. In the paper we present an example of a form of default reasoning where we appear to need a non-commutative product.
36 Thank You
37 Default RDFS... sc: Plantae sc: Linnaeus Pinophyta sc:... sc: Araucariaceae sc: sc: Noble Noble... Linnaeus... = = Noble Araucaria Wollemia sc: sc: A. araucana W. nobilis
38 Default RDFS... sc: Plantae sc: Linnaeus Pinophyta sc:... sc: Araucariaceae sc: sc: Noble Noble... Linnaeus... = = Noble Araucaria Wollemia sc: sc: A. araucana W. nobilis
Minimal Deductive Systems for RDF
Minimal Deductive Systems for RDF Sergio Muñoz, Jorge Pérez, Claudio Gutierrez Department of Computer Science Universidad de Chile Pontificia Universidad Católica de Chile Center for Web Research http://www.cwr.cl
More informationResource Description Framework (RDF) A basis for knowledge representation on the Web
Resource Description Framework (RDF) A basis for knowledge representation on the Web Simple language to capture assertions (as statements) Captures elements of knowledge about a resource Facilitates incremental
More informationProvenance Semirings. Todd Green Grigoris Karvounarakis Val Tannen. presented by Clemens Ley
Provenance Semirings Todd Green Grigoris Karvounarakis Val Tannen presented by Clemens Ley place of origin Provenance Semirings Todd Green Grigoris Karvounarakis Val Tannen presented by Clemens Ley place
More informationA note on the history of the document: RDF Formalization, by Draltan Marin
A note on the history of the document: RDF Formalization, by Draltan Marin Claudio Gutierrez Computer Science Department, Universidad de Chile Santiago de Chile, May 2006 Draltan Marin, in 2004 a student
More informationApproximation and Relaxation of Semantic Web Path Queries
*Manuscript Click here to view linked References Approximation and Relaxation of Semantic Web Path Queries Alexandra Poulovassilis a, Petra Selmer a, Peter T. Wood a a Knowledge Lab, Department of Computer
More information03 Review of First-Order Logic
CAS 734 Winter 2014 03 Review of First-Order Logic William M. Farmer Department of Computing and Software McMaster University 18 January 2014 What is First-Order Logic? First-order logic is the study of
More informationnsparql: A Navigational Language for RDF 1
nsparql: A Navigational Language for RDF 1 Jorge Pérez a,c, Marcelo Arenas a,c, Claudio Gutierrez b,c a Department of Computer Science, Pontificia Universidad Católica de Chile b Department of Computer
More informationExtended RDF as a Semantic Foundation of Rule Markup Languages
Journal of Artificial Intelligence Research (2008) Submitted 3/06; published /08 Extended RDF as a Semantic Foundation of Rule Markup Languages Anastasia Analyti Institute of Computer Science, FORTH-ICS,
More informationFuzzy Answer Set semantics for Residuated Logic programs
semantics for Logic Nicolás Madrid & Universidad de Málaga September 23, 2009 Aims of this paper We are studying the introduction of two kinds of negations into residuated : Default negation: This negation
More informationFlexible Querying for SPARQL
Flexible Querying for SPARQL Andrea Calì 1,2, Riccardo Frosini 1, Alexandra Poulovassilis 1, Peter T. Wood 1 1 Dept. of Computer Science and Inf. Systems, Birkbeck University of London, UK 2 Oxford-Man
More informationQuery Processing on RDF data
Query Processing on RDF data Hai Huang B.E. (HFUT, China) M.E. (IIM of CAS, China) A dissertation submitted to the Faculty of Information and Communication Technologies Swinburne University of Technology
More informationIncomplete Information in RDF
Incomplete Information in RDF Charalampos Nikolaou and Manolis Koubarakis charnik@di.uoa.gr koubarak@di.uoa.gr Department of Informatics and Telecommunications National and Kapodistrian University of Athens
More informationRDFLog: It s like Datalog for RDF
RDFLog: It s like Datalog for RDF François Bry 1, Tim Furche 1, Clemens Ley 2, Benedikt Linse 1, and Bruno Marnette 2 1 Institute for Informatics, University of Munich, Oettingenstraße 67, D-80538 München,
More informationPeter Wood. Department of Computer Science and Information Systems Birkbeck, University of London Automata and Formal Languages
and and Department of Computer Science and Information Systems Birkbeck, University of London ptw@dcs.bbk.ac.uk Outline and Doing and analysing problems/languages computability/solvability/decidability
More informationKleene Algebra and Arden s Theorem. Anshul Kumar Inzemamul Haque
Kleene Algebra and Arden s Theorem Anshul Kumar Inzemamul Haque Motivation Regular Expression is a Kleene Algebra. We can use the properties and theorems of Kleene Algebra to simplify regular expressions
More informationAn Ontology and Concept Lattice Based Inexact Matching Method for Service Discovery
An Ontology and Concept Lattice Based Inexact Matching Method for Service Discovery Tang Shancheng Communication and Information Institute, Xi an University of Science and Technology, Xi an 710054, China
More informationProvenance for Aggregate Queries
Provenance for Aggregate Queries Yael Amsterdamer Tel Aviv University and University of Pennsylvania yaelamst@post.tau.ac.il Daniel Deutch Ben Gurion University and University of Pennsylvania deutchd@cs.bgu.ac.il
More informationBGP Query Answering against Dynamic RDF Databases
BGP Query Answering against Dynamic RDF Databases François Goasdoué, Ioana Manolescu, Alexandra Roatis To cite this version: François Goasdoué, Ioana Manolescu, Alexandra Roatis. BGP Query Answering against
More informationKnowledge Representation and Description Logic Part 3
Knowledge Representation and Description Logic Part 3 Renata Wassermann renata@ime.usp.br Computer Science Department University of São Paulo September 2014 IAOA School Vitória Renata Wassermann Knowledge
More information12 Algebraic Structure and Coding Theory
12.1 The Structure of Algebra Def 1 Let S be a set and be a binary operation on S( : S S S). 2. The operation is associative over S, if a (b c) = (a b) c. 1. The operation is commutative over S, if a b
More informationRepresenting and Querying Validity Time in RDF and OWL: A Logic-Based Approach
Representing and Querying Validity Time in RDF and OWL: A Logic-Based Approach Boris Motik a a Oxford University Computing Laboratory, Oxford, UK Abstract RDF(S) and OWL 2 can currently represent only
More informationSemantic Web Languages Towards an Institutional Perspective
Semantic Web Languages Towards an Institutional Perspective Dorel Lucanu 1,YuanFangLi 2, and Jin Song Dong 2 1 Faculty of Computer Science A.I.Cuza University Iaşi, Romania dlucanu@info.uaic.ro 2 School
More information12 Algebraic Structure and Coding Theory
12.1 The Structure of Algebra Def 1 Let S be a set and be a binary operation on S( : S S S). 2. The operation is associative over S, if a (b c) = (a b) c. 1. The operation is commutative over S, if a b
More informationRDF and Logic: Reasoning and Extension
RDF and Logic: Reasoning and Extension Jos de Bruijn Faculty of Computer Science, Free University of Bozen-Bolzano, Italy debruijn@inf.unibz.it Stijn Heymans Digital Enterprise Research Institute (DERI),
More informationProvenance Semirings
Provenance Semirings Todd J. Green tjgreen@cis.upenn.edu Grigoris Karvounarakis gkarvoun@cis.upenn.edu Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104,
More informationImage schemas via finite-state methods structured category-theoretically
Objective predication Subjective predication Reconciliation Image schemas via finite-state methods structured category-theoretically Tim Fernando Bolzano, 22 August 2016, PROSECCO a recurring structure
More informationA Minimal Deductive System for General Fuzzy RDF
A Minimal Deductive System for General Fuzzy RDF Umberto Straccia Istituto di Scienza e Tecnologie dell Informazione (ISTI - CNR), Pisa, Italy straccia@isti.cnr.it Abstract. It is well-known that crisp
More informationSPARQL Formalization
SPARQL Formalization Marcelo Arenas, Claudio Gutierrez, Jorge Pérez Department of Computer Science Pontificia Universidad Católica de Chile Universidad de Chile Center for Web Research http://www.cwr.cl
More informationA Weak Bisimulation for Weighted Automata
Weak Bisimulation for Weighted utomata Peter Kemper College of William and Mary Weighted utomata and Semirings here focus on commutative & idempotent semirings Weak Bisimulation Composition operators Congruence
More informationAnswering Ontological Ranking Queries Based on Subjective Reports
Answering Ontological Ranking Queries Based on Subjective Reports Thomas Lukasiewicz 1, Maria Vanina Martinez 1, Cristian Molinaro 2, Livia Predoiu 1, and Gerardo I. Simari 1 1 Department of Computer Science,
More informationTuple Relational Calculus
Tuple Relational Calculus Université de Mons (UMONS) May 14, 2018 Motivation S[S#, SNAME, STATUS, CITY] P[P#, PNAME, COLOR, WEIGHT, CITY] SP[S#, P#, QTY)] Get all pairs of city names such that a supplier
More informationAPPLICATION OF ONTOLOGIES AND SEMANTIC WEB FOR FACILITATION OF ECOLOGY
Доклади на Българската академия на науките Comptes rendus de l Académie bulgare des Sciences Tome 65, No 5, 2012 MATHEMATIQUES Informatique APPLICATION OF ONTOLOGIES AND SEMANTIC WEB FOR FACILITATION OF
More informationACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes)
ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes) Steve Vickers CS Theory Group Birmingham 2. Theories and models Categorical approach to many-sorted
More informationCompositions of Tree Series Transformations
Compositions of Tree Series Transformations Andreas Maletti a Technische Universität Dresden Fakultät Informatik D 01062 Dresden, Germany maletti@tcs.inf.tu-dresden.de December 03, 2004 1. Motivation 2.
More informationUniversität Augsburg
Universität Augsburg Algebraic Separation Logic H.-H. Dang P. Höfner B. Möller Report 2010-06 July 2010 Institut für Informatik D-86135 Augsburg Copyright c H.-H. Dang P. Höfner B. Möller Institut für
More informationDatabase Design and Implementation
Database Design and Implementation CS 645 Data provenance Provenance provenance, n. The fact of coming from some particular source or quarter; origin, derivation [Oxford English Dictionary] Data provenance
More informationExtended Index. 89f depth (of a prime ideal) 121f Artin-Rees Lemma. 107f descending chain condition 74f Artinian module
Extended Index cokernel 19f for Atiyah and MacDonald's Introduction to Commutative Algebra colon operator 8f Key: comaximal ideals 7f - listings ending in f give the page where the term is defined commutative
More informationData Cleaning and Query Answering with Matching Dependencies and Matching Functions
Data Cleaning and Query Answering with Matching Dependencies and Matching Functions Leopoldo Bertossi 1, Solmaz Kolahi 2, and Laks V. S. Lakshmanan 2 1 Carleton University, Ottawa, Canada. bertossi@scs.carleton.ca
More informationUnit I (Logic and Proofs)
SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : Part A questions : R2013 UPDATED ON : April-May 2018 (Scan the above QR code for the direct download of this material)
More informationarxiv:cs/ v1 [cs.db] 26 May 2006
Semantics and Complexity of SPARQL Jorge Pérez 1, Marcelo Arenas 2, and Claudio Gutierrez 3 arxiv:cs/0605124v1 [cs.db] 26 May 2006 1 Universidad de Talca 2 Pontificia Universidad Católica de Chile 3 Universidad
More informationWhat is (certain) Spatio-Temporal Data?
What is (certain) Spatio-Temporal Data? A spatio-temporal database stores triples (oid, time, loc) In the best case, this allows to look up the location of an object at any time 2 What is (certain) Spatio-Temporal
More informationUnification of terms and language expansions
Unification of terms and language expansions in Heyting algebras and commutative residuated lattices Wojciech Dzik Instytut Matematyki Uniwersytet Sl aski, Katowice wojciech.dzik@us.edu.pl joint work with
More informationApplied Logics - A Review and Some New Results
Applied Logics - A Review and Some New Results ICLA 2009 Esko Turunen Tampere University of Technology Finland January 10, 2009 Google Maps Introduction http://maps.google.fi/maps?f=d&utm_campaign=fi&utm_source=fi-ha-...
More informationQuerying for Provenance, Trust, Uncertainty and other Meta Knowledge in RDF 1
Querying for Provenance, Trust, Uncertainty and other Meta Knowledge in RDF 1 Renata Dividino a, Sergej Sizov a, Steffen Staab a, Bernhard Schueler a a ISWeb - Information Systems and Semantic Web University
More informationDesigning a Query Language for RDF: Marrying Open and Closed Worlds
Designing a Query Language for RDF: Marrying Open and Closed Worlds Marcelo Arenas Pontificia Universidad Católica de Chile & Center for Semantic Web Research marenas@ing.puc.cl Martín Ugarte Université
More informationPUG: A Framework and Practical Implementation for Why & Why-Not Provenance (extended version)
arxiv:808.05752v [cs.db] 6 Aug 208 PUG: A Framework and Practical Implementation for Why & Why-Not Provenance (extended version) Seokki Lee, Bertram Ludäscher, Boris Glavic IIT DB Group Technical Report
More informationExtended RDF: Computability and Complexity Issues
Extended RDF: Computability and Complexity Issues Anastasia Analyti 1, Carlos Viegas Damásio 2, and Grigoris Antoniou 1,3 1 Institute of Computer Science, FRTH-ICS, Greece 2 CENTRIA, Departamento de Informatica,
More informationPreuves de logique linéaire sur machine, ENS-Lyon, Dec. 18, 2018
Université de Lorraine, LORIA, CNRS, Nancy, France Preuves de logique linéaire sur machine, ENS-Lyon, Dec. 18, 2018 Introduction Linear logic introduced by Girard both classical and intuitionistic separate
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationRAPPORT DE RECHERCHE. On Querying Simple Conceptual Graphs With Negation
RAPPORT DE RECHERCHE On Querying Simple Conceptual Graphs With Negation Marie-Laure Mugnier and Michel Leclère 3/07/005 R.R.LIRMM 05-05 6, rue Ada 3439 Montpellier Cedex 5 France Tél. : 33 (0) 4 67 4 85
More informationQuery-Oriented Summarization of RDF Graphs
Query-Oriented Summarization of RDF Graphs Šejla Čebirić, François Goasdoué, Ioana Manolescu To cite this version: Šejla Čebirić, François Goasdoué, Ioana Manolescu. Query-Oriented Summarization of RDF
More informationA Survey of Temporal Knowledge Representations
A Survey of Temporal Knowledge Representations Advisor: Professor Abdullah Tansel Second Exam Presentation Knowledge Representations logic-based logic-base formalisms formalisms more complex and difficult
More informationSemantics and Inference for Probabilistic Ontologies
Semantics and Inference for Probabilistic Ontologies Fabrizio Riguzzi, Elena Bellodi, Evelina Lamma, and Riccardo Zese ENDIF University of Ferrara, Italy, email: {fabrizio.riguzzi, elena.bellodi, evelina.lamma}@unife.it,
More informationQueries and Materialized Views on Probabilistic Databases
Queries and Materialized Views on Probabilistic Databases Nilesh Dalvi Christopher Ré Dan Suciu September 11, 2008 Abstract We review in this paper some recent yet fundamental results on evaluating queries
More informationSemirings for Breakfast
Semirings for Breakfast Marc Pouly marc.pouly@unifr.ch Interdisciplinary Center for Security, Reliability and Trust University of Luxembourg July 2010 Marc Pouly Semirings for Breakfast 1/ 27 Semirings
More informationDescription Logics. Foundations of Propositional Logic. franconi. Enrico Franconi
(1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge
More informationAn Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California. 2. Background: Semirings and Kleene algebras
An Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California 1. Residuated Lattices with iteration 2. Background: Semirings and Kleene algebras 3. A Gentzen system
More informationLogic and Reasoning in the Semantic Web (part II OWL)
Logic and Reasoning in the Semantic Web (part II OWL) Fulvio Corno, Laura Farinetti Politecnico di Torino Dipartimento di Automatica e Informatica e-lite Research Group http://elite.polito.it Outline Reasoning
More informationOverview of Topics. Finite Model Theory. Finite Model Theory. Connections to Database Theory. Qing Wang
Overview of Topics Finite Model Theory Part 1: Introduction 1 What is finite model theory? 2 Connections to some areas in CS Qing Wang qing.wang@anu.edu.au Database theory Complexity theory 3 Basic definitions
More informationPath Queries under Distortions: Answering and Containment
Path Queries under Distortions: Answering and Containment Gosta Grahne Concordia University Alex Thomo Suffolk University Foundations of Information and Knowledge Systems (FoIKS 04) Postulate 1 The world
More informationData Cleaning and Query Answering with Matching Dependencies and Matching Functions
Data Cleaning and Query Answering with Matching Dependencies and Matching Functions Leopoldo Bertossi Carleton University Ottawa, Canada bertossi@scs.carleton.ca Solmaz Kolahi University of British Columbia
More informationSyntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.
First-Order Logic Syntax The alphabet of a first-order language is organised into the following categories. Logical connectives:,,,,, and. Auxiliary symbols:.,,, ( and ). Variables: we assume a countable
More informationExtension theorems for homomorphisms
Algebraic Geometry Fall 2009 Extension theorems for homomorphisms In this note, we prove some extension theorems for homomorphisms from rings to algebraically closed fields. The prototype is the following
More informationAlgebraic Proof Systems
Algebraic Proof Systems Pavel Pudlák Mathematical Institute, Academy of Sciences, Prague and Charles University, Prague Fall School of Logic, Prague, 2009 2 Overview 1 a survey of proof systems 2 a lower
More informationDisplacement Logic for Grammar
Displacement Logic for Grammar Glyn Morrill & Oriol Valentín Department of Computer Science Universitat Politècnica de Catalunya morrill@cs.upc.edu & oriol.valentin@gmail.com ESSLLI 2016 Bozen-Bolzano
More informationA Dichotomy. in in Probabilistic Databases. Joint work with Robert Fink. for Non-Repeating Queries with Negation Queries with Negation
Dichotomy for Non-Repeating Queries with Negation Queries with Negation in in Probabilistic Databases Robert Dan Olteanu Fink and Dan Olteanu Joint work with Robert Fink Uncertainty in Computation Simons
More informationProvenance-Based Analysis of Data-Centric Processes
Noname manuscript No. will be inserted by the editor) Provenance-Based Analysis of Data-Centric Processes Daniel Deutch Yuval Moskovitch Val Tannen the date of receipt and acceptance should be inserted
More informationUnSAID: Uncertainty and Structure in the Access to Intensional Data
UnSAID: Uncertainty and Structure in the Access to Intensional Data Pierre Senellart 3 July 214, Univ. Rennes 1 Uncertain data is everywhere Numerous sources of uncertain data: Measurement errors Data
More informationRelational Algebra by Way of Adjunctions. Jeremy Gibbons (joint work with Fritz Henglein, Ralf Hinze, Nicolas Wu) DBPL, October 2015
Relational Algebra by Way of Adjunctions Jeremy Gibbons (joint work with Fritz Henglein, Ralf Hinze, Nicolas Wu) DBPL, October 2015 Relational Algebra by Way of Adjunctions 2 1. Summary bulk types (sets,
More informationA Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries
A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries Bas Ketsman Dan Suciu Abstract We study the optimal communication cost for computing a full conjunctive query
More informationFrom Monadic Second-Order Definable String Transformations to Transducers
From Monadic Second-Order Definable String Transformations to Transducers Rajeev Alur 1 Antoine Durand-Gasselin 2 Ashutosh Trivedi 3 1 University of Pennsylvania 2 LIAFA, Université Paris Diderot 3 Indian
More informationOn Factorisation of Provenance Polynomials
On Factorisation of Provenance Polynomials Dan Olteanu and Jakub Závodný Oxford University Computing Laboratory Wolfson Building, Parks Road, OX1 3QD, Oxford, UK 1 Introduction Tracking and managing provenance
More informationSPARQL Query Containment under RDFS Entailment Regime
SPARQL Query Containment under RDFS Entailment Regime Melisachew Wudage Chekol 1, Jérôme Euzenat 1, Pierre Genevès 2, and Nabil Layaïda 1 1 INRIA and LIG 2 CNRS {melisachew.chekol firstname.lastname}@inria.fr
More informationCompositions of Bottom-Up Tree Series Transformations
Compositions of Bottom-Up Tree Series Transformations Andreas Maletti a Technische Universität Dresden Fakultät Informatik D 01062 Dresden, Germany maletti@tcs.inf.tu-dresden.de May 17, 2005 1. Motivation
More informationSkills Practice Skills Practice for Lesson 10.1
Skills Practice Skills Practice for Lesson.1 Name Date Higher Order Polynomials and Factoring Roots of Polynomial Equations Problem Set Solve each polynomial equation using factoring. Then check your solution(s).
More informationAn Overview of A Formal Framework For Managing Mathematics
An Overview of A Formal Framework For Managing Mathematics William M. Farmer (wmfarmer@mcmaster.ca) Martin v. Mohrenschildt (mohrens@mcmaster.ca) Department of Computing and Software McMaster University
More informationThe Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees
The Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees Karsten Lehmann a, Rafael Peñaloza b a Optimisation Research Group, NICTA Artificial Intelligence Group, Australian National
More informationQuick course in Universal Algebra and Tame Congruence Theory
Quick course in Universal Algebra and Tame Congruence Theory Ross Willard University of Waterloo, Canada Workshop on Universal Algebra and the Constraint Satisfaction Problem Nashville, June 2007 (with
More informationFunctional Many-valued Logic and Global Predicate Compression
Functional Many-valued Logic and Global Predicate Compression Zoran Majkić University of Maryland, College Park, USA zoran@cs.umd.edu Abstract. Knowledge-base systems must typically deal with imperfection
More informationHigh-order consistency in valued constraint satisfaction
High-order consistency in valued constraint satisfaction Martin C. Cooper IRIT University of Toulouse III 118 route de Narbonne, 31062 Toulouse, France cooper@irit.fr Abstract k-consistency operations
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationREPRESENTATION THEOREMS FOR IMPLICATION STRUCTURES
Wojciech Buszkowski REPRESENTATION THEOREMS FOR IMPLICATION STRUCTURES Professor Rasiowa [HR49] considers implication algebras (A,, V ) such that is a binary operation on the universe A and V A. In particular,
More informationFully Lexicalized Pregroup Grammars
Fully Lexicalized Pregroup Grammars Annie Foret joint work with Denis Béchet Denis.Bechet@lina.univ-nantes.fr and foret@irisa.fr http://www.irisa.fr/prive/foret LINA Nantes University, FRANCE IRISA University
More informationGeomRDF : A Geodata Converter with a Fine-Grained Structured Representation of Geometry in the Web
GeomRDF : A Geodata Converter with a Fine-Grained Structured Representation of Geometry in the Web Fayçal Hamdi 1 Nathalie Abadie 2 Bénédicte Bucher 2 Abdelfettah Feliachi 2 1 ISID TEAM, CEDRIC Lab Conservatoire
More informationTowards an Effective Calculus for Object Query Languages. The Gap between Theory & Practice
Towards an Effective Calculus for Object Query Languages Leonidas Fegaras David Maier Oregon Graduate Institute - 1 - The Gap between Theory & Practice Most commercial relational query languages go beyond
More informationRecent Developments in and Around Coaglgebraic Logics
Recent Developments in and Around Coaglgebraic Logics D. Pattinson, Imperial College London (in collaboration with G. Calin, R. Myers, L. Schröder) Example: Logics in Knowledge Representation Knowledge
More informationOn the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice
On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice arxiv:0811.2107v2 [math.lo] 2 Oct 2009 FÉLIX BOU, FRANCESC ESTEVA and LLUÍS GODO, Institut d Investigació en Intel.ligència Artificial,
More informationGrounding Formulas with Complex Terms
Grounding Formulas with Complex Terms Amir Aavani, Xiongnan (Newman) Wu, Eugenia Ternovska, David Mitchell Simon Fraser University {aaa78,xwa33,ter,mitchel}@sfu.ca Abstract. Given a finite domain, grounding
More informationAn Entailment Checker for Separation Logic with Inductive Definitions
An Entailment Checker for Separation Loic with Inductive Definitions Radu Iosif, Cristina Serban Université de Grenoble Alpes, CNRS, VERIMAG July 18, 2018 Cristina Serban (VERIMAG) An Entailment Checker
More informationOn Incomplete XML Documents with Integrity Constraints
On Incomplete XML Documents with Integrity Constraints Pablo Barceló 1, Leonid Libkin 2, and Juan Reutter 2 1 Department of Computer Science, University of Chile 2 School of Informatics, University of
More informationSolving fixed-point equations over semirings
Solving fixed-point equations over semirings Javier Esparza Technische Universität München Joint work with Michael Luttenberger and Maximilian Schlund Fixed-point equations We study systems of equations
More informationLecture 8: The Field B dr
Lecture 8: The Field B dr October 29, 2018 Throughout this lecture, we fix a perfectoid field C of characteristic p, with valuation ring O C. Fix an element π C with 0 < π C < 1, and let B denote the completion
More informationAlgebraic Model Counting
Algebraic Model Counting Angelika Kimmig a,, Guy Van den Broeck b, Luc De Raedt a a Department of Computer Science, KU Leuven, Celestijnenlaan 200a box 2402, 3001 Heverlee, Belgium. b UCLA Computer Science
More informationPropositional logic. First order logic. Alexander Clark. Autumn 2014
Propositional logic First order logic Alexander Clark Autumn 2014 Formal Logic Logical arguments are valid because of their form. Formal languages are devised to express exactly that relevant form and
More informationCylindrical Algebraic Decomposition in Coq
Cylindrical Algebraic Decomposition in Coq MAP 2010 - Logroño 13-16 November 2010 Assia Mahboubi INRIA Microsoft Research Joint Centre (France) INRIA Saclay Île-de-France École Polytechnique, Palaiseau
More informationAxioms of Kleene Algebra
Introduction to Kleene Algebra Lecture 2 CS786 Spring 2004 January 28, 2004 Axioms of Kleene Algebra In this lecture we give the formal definition of a Kleene algebra and derive some basic consequences.
More informationStates of free product algebras
States of free product algebras Sara Ugolini University of Pisa, Department of Computer Science sara.ugolini@di.unipi.it (joint work with Tommaso Flaminio and Lluis Godo) Congreso Monteiro 2017 Background
More informationQuery Answering in DL-Lite with Datatypes: A Non-Uniform Approach
1 / 20 Department of Computer Science Query Answering in DL-Lite with Datatypes: A Non-Uniform Approach February 2, 2017 André Hernich, Julio Lemos, Frank Wolter OBDM In Ontology-Based Data Management,
More informationGraphical Models for Text Mining: Knowledge Extraction and Performance Estimation
UNIVERSITÀ DEGLI STUDI DI MILANO - BICOCCA Facoltà di Scienze Matematiche, Fisiche e Naturali Dipartimento di Informatica Sistemistica e Comunicazione Dottorato di Ricerca in Informatica - XXIII Ciclo
More informationPropositional Logic: Logical Agents (Part I)
Propositional Logic: Logical Agents (Part I) This lecture topic: Propositional Logic (two lectures) Chapter 7.1-7.4 (this lecture, Part I) Chapter 7.5 (next lecture, Part II) Next lecture topic: First-order
More information