Minimal Deductive Systems for RDF
|
|
- Horace Ross
- 6 years ago
- Views:
Transcription
1 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 European Semantic Web Conference 2007 S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 1 / 24
2 RDF Language and Model Theory looks a little bit complicated at first sight... S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 2 / 24
3 RDF Language and Model Theory looks a little bit complicated at first sight... S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 2 / 24
4 RDF Language and Model Theory looks a little bit complicated at first sight... S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 2 / 24
5 RDF Language and Model Theory looks a little bit complicated at first sight... S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 2 / 24
6 RDF Language and Model Theory looks a little bit complicated at first sight... S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 2 / 24
7 Several dozens of reserved keywords... rdfs:resource [res] rdf:type [type] rdfs:isdefinedby [isdefined] rdf:property [prop] rdfs:domain [dom] rdfs:comment [comment] rdfs:class [class] rdfs:range [range] rdfs:label [label] rdfs:literal [literal] rdfs:subclassof [sc] rdf:value [value] rdfs:datatype [datatype] rdfs:subpropertyof [] rdf:nil [nil] rdf:xmlliteral [xmllit] rdf:subject [subj] rdf: 1 [ 1] rdfs:container [cont] rdf:predicate [pred] rdf: 2 [ 2] rdf:statement [stat] rdf:object [obj]... rdf:list [list] rdfs:member [member] rdf: i [ i] rdf:alt [alt] rdf:first [first]... rdf:bag [bag] rdf:rest [rest] rdf:seq [seq] rdfs:seealso [seealso] rdfs:containermembershipproperty [contmp] S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 3 / 24
8 ...plus axiomatic triples... (type, type, prop) (subj, type, prop) (pred, type, prop) (obj, type, prop) (first, type, prop) (rest, type, prop) (value, type, prop) ( 1, type, prop) ( 1, type, contmp) ( 2, type, prop) ( 2, type, contmp)... ( i, type, prop) ( i, type, contmp)... (nil, type, prop) (xmllit, type, datatype) S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 4 / 24
9 ...plus more axiomatic triples... (type, dom, res) (dom, dom, prop) (range, dom, prop) (, dom, prop) (sc, dom, class) (subj, dom, stat) (pred, dom, stat) (obj, dom, stat) (member, dom, res) (first, dom, list) (rest, dom, list) (seealso, dom, res) (isdefined, dom, res) (comment, dom, res) (label, dom, res) (value, dom, res) ( 1, dom, res) ( 2, dom, res)... ( i, dom, res)... (type, range, class) (dom, range, class) (range, range, class) (, range, prop) (sc, range, class) (subj, range, res) (pred, range, res) (obj, range, res) (member, range, res) (first, range, res) (rest, range, list) (seealso, range, res) (isdefined, range, res) (comment, range, literal) (label, range, literal) (value, range, res) ( 1, range, res) ( 2, range, res)... ( i, range, res)... S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 5 / 24
10 ...plus more axiomatic triples... (alt, sc, cont) (bag, sc, cont) (seq, sc, cont) (contmp, sc, prop) (xmllit, sc, literal) (datatype, sc, class) (isdefined,, seealso) S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 6 / 24
11 ...and on top of this a (slightly) non-standard model theory A notion of interpretation (Res, Prop, Class, Lit, PExt, CExt, Int) including subsets of the universe denoting properties, classes and literals, and mapping defining their extensions. Notion of interpretation of blank nodes Definition of reflexivity, transitivity and semi-extensionality of subclass and subproperty Typing restrictions S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 7 / 24
12 But...we need a workable language to bring to reality the vision of the Semantic Web Would like to: Have a simple user-language to be able to popularize RDF among Web users. Have a simple ecification to allow sound development work. Have a language in streamlined form to make it easy to formalize and prove results about its properties. S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 8 / 24
13 What is to be done?: To simplify the language S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 9 / 24
14 What is to be done?: To simplify the language There is a minimal fragment of the theory preserving the essential core of RDFS S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 9 / 24
15 What is to be done?: To simplify the language There is a minimal fragment of the theory preserving the essential core of RDFS Basic idea: Separate user-language from features and constructors which define and ecificy the language. Concentrate in vocabulary with non-trivial semantics. S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 9 / 24
16 Main contributions & Outline Identify a fragment of RDFS that covers the crucial vocabulary and preserves the original RDFS semantics. Study dependencies among vocabulary and develop sound and complete proof systems for each fragment. Present algorithms to modularize reasoning according to relevant vocabulary. S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 10 / 24
17 Main contributions & Outline Identify a fragment of RDFS that covers the crucial vocabulary and preserves the original RDFS semantics. Study dependencies among vocabulary and develop sound and complete proof systems for each fragment. Present algorithms to modularize reasoning according to relevant vocabulary. S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 10 / 24
18 Main contributions & Outline Identify a fragment of RDFS that covers the crucial vocabulary and preserves the original RDFS semantics. Study dependencies among vocabulary and develop sound and complete proof systems for each fragment. Present algorithms to modularize reasoning according to relevant vocabulary. S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 10 / 24
19 The core vocabulary rdfs:resource [res] rdf:type [type] rdfs:isdefinedby [isdefined] rdf:property [prop] rdfs:domain [dom] rdfs:comment [comment] rdfs:class [class] rdfs:range [range] rdfs:label [label] rdfs:literal [literal] rdfs:subclassof [sc] rdf:value [value] rdfs:datatype [datatype] rdfs:subpropertyof [] rdf:nil [nil] rdf:xmlliteral [xmllit] rdf:subject [subj] rdf: 1 [ 1] rdfs:container [cont] rdf:predicate [pred] rdf: 2 [ 2] rdf:statement [stat] rdf:object [obj]... rdf:list [list] rdfs:member [member] rdf: i [ i] rdf:alt [alt] rdf:first [first]... rdf:bag [bag] rdf:rest [rest] rdf:seq [seq] rdfs:seealso [seealso] rdfs:containermembershipproperty [contmp] S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 11 / 24
20 The core vocabulary rdfs:resource [res] rdf:type [type] rdfs:isdefinedby [isdefined] rdf:property [prop] rdfs:domain [dom] rdfs:comment [comment] rdfs:class [class] rdfs:range [range] rdfs:label [label] rdfs:literal [literal] rdfs:subclassof [sc] rdf:value [value] rdfs:datatype [datatype] rdfs:subpropertyof [] rdf:nil [nil] rdf:xmlliteral [xmllit] rdf:subject [subj] rdf: 1 [ 1] rdfs:container [cont] rdf:predicate [pred] rdf: 2 [ 2] rdf:statement [stat] rdf:object [obj]... rdf:list [list] rdfs:member [member] rdf: i [ i] rdf:alt [alt] rdf:first [first]... rdf:bag [bag] rdf:rest [rest] rdf:seq [seq] rdfs:seealso [seealso] rdfs:containermembershipproperty [contmp] S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 11 / 24
21 The core vocabulary rdfs:resource [res] rdf:type [type] rdfs:isdefinedby [isdefined] rdf:property [prop] rdfs:domain [dom] rdfs:comment [comment] rdfs:class [class] rdfs:range [range] rdfs:label [label] rdfs:literal [literal] rdfs:subclassof [sc] rdf:value [value] rdfs:datatype [datatype] rdfs:subpropertyof [] rdf:nil [nil] rdf:xmlliteral [xmllit] rdf:subject [subj] rdf: 1 [ 1] rdfs:container [cont] rdf:predicate [pred] rdf: 2 [ 2] rdf:statement [stat] rdf:object [obj]... rdf:list [list] rdfs:member [member] rdf: i [ i] rdf:alt [alt] rdf:first [first]... rdf:bag [bag] rdf:rest [rest] rdf:seq [seq] rdfs:seealso [seealso] rdfs:containermembershipproperty [contmp] ρdf = {,sc,type,dom,range} S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 11 / 24
22 Blank node rule G H if there is a homomorphism µ : H G S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 12 / 24
23 Core rules Subproperty (transitivity, definition) (A,,B) (B,,C) (A,,C) (A,,B) (X,A,Y) (X,B,Y) Subclass (transitivity, definition) (A,sc,B) (B,sc,C) (A,sc,C) (A,sc,B) (X,type,A) (X,type,B) Typing (domain, range) (A,dom,B) (X,A,Y) (X,type,B) (A,range,B) (X,A,Y) (Y,type,B) Implicit Typing (strange case...) (A,dom,B) (C,,A) (X,C,Y) (X,type,B) (A,range,B) (C,,A) (X,C,Y) (Y,type,B) S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 13 / 24
24 Core rules Subproperty (transitivity, definition) (A,,B) (B,,C) (A,,C) (A,,B) (X,A,Y) (X,B,Y) Subclass (transitivity, definition) (A,sc,B) (B,sc,C) (A,sc,C) (A,sc,B) (X,type,A) (X,type,B) Typing (domain, range) (A,dom,B) (X,A,Y) (X,type,B) (A,range,B) (X,A,Y) (Y,type,B) Implicit Typing (strange case...) (A,dom,B) (C,,A) (X,C,Y) (X,type,B) (A,range,B) (C,,A) (X,C,Y) (Y,type,B) S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 13 / 24
25 Core rules Subproperty (transitivity, definition) (A,,B) (B,,C) (A,,C) (A,,B) (X,A,Y) (X,B,Y) Subclass (transitivity, definition) (A,sc,B) (B,sc,C) (A,sc,C) (A,sc,B) (X,type,A) (X,type,B) Typing (domain, range) (A,dom,B) (X,A,Y) (X,type,B) (A,range,B) (X,A,Y) (Y,type,B) Implicit Typing (strange case...) (A,dom,B) (C,,A) (X,C,Y) (X,type,B) (A,range,B) (C,,A) (X,C,Y) (Y,type,B) S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 13 / 24
26 Core rules Subproperty (transitivity, definition) (A,,B) (B,,C) (A,,C) (A,,B) (X,A,Y) (X,B,Y) Subclass (transitivity, definition) (A,sc,B) (B,sc,C) (A,sc,C) (A,sc,B) (X,type,A) (X,type,B) Typing (domain, range) (A,dom,B) (X,A,Y) (X,type,B) (A,range,B) (X,A,Y) (Y,type,B) Implicit Typing (strange case...) (A,dom,B) (C,,A) (X,C,Y) (X,type,B) (A,range,B) (C,,A) (X,C,Y) (Y,type,B) S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 13 / 24
27 Core rules Subproperty (transitivity, definition) (A,,B) (B,,C) (A,,C) (A,,B) (X,A,Y) (X,B,Y) Subclass (transitivity, definition) (A,sc,B) (B,sc,C) (A,sc,C) (A,sc,B) (X,type,A) (X,type,B) Typing (domain, range) (A,dom,B) (X,A,Y) (X,type,B) (A,range,B) (X,A,Y) (Y,type,B) Implicit Typing (strange case...) (A,dom,B) (C,,A) (X,C,Y) (X,type,B) (A,range,B) (C,,A) (X,C,Y) (Y,type,B) S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 13 / 24
28 Reflexivity rules If (A, type, Property) then (A,, A) Subproperty Reflexivity (X,A,Y) (A,,A) (A,,B) (A,,A) (B,,B) (p,,p) (A,dom,X) (A,,A) for p ρdf (A,range,X) (A,,A) Subclass Reflexivity (A,sc,B) (A,sc,A) (B,sc,B) (X,dom,A) (A,sc,A) (X,range,A) (A,sc,A) (X,type,A) (A,sc,A) S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 14 / 24
29 Reflexivity rules If (A, type, Property) then (A,, A) Subproperty Reflexivity (X,A,Y) (A,,A) (A,,B) (A,,A) (B,,B) (p,,p) (A,dom,X) (A,,A) for p ρdf (A,range,X) (A,,A) Subclass Reflexivity (A,sc,B) (A,sc,A) (B,sc,B) (X,dom,A) (A,sc,A) (X,range,A) (A,sc,A) (X,type,A) (A,sc,A) S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 14 / 24
30 Soundness and Completeness Let = denote the standard RDFS entailment, and ρdf a proof system based on the rules presented. Theorem Let G and H be graphs in ρdf then G = H if and only if G ρdf H. S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 15 / 24
31 Blank Nodes Modularization Blank nodes can be treated in an orthogonal form to ρdf vocabulary. Theorem Let G and H be graphs in ρdf and G = H, then there is a proof of H from G where the blank rule is used at most once and at the end. S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 16 / 24
32 The role of reflexivity The only consequence of reflexivity of and sc in RDFS is the possible entailment of triples of the form (x,,x),(x,sc,x). Theorem Let G and H be ρdf graphs. Assume that H does not contain triples of the form (x,,x) and (x,sc,x). Then, G ρdf H without using reflexivity rules. (Also, by not imposing reflexivity, axiomatic triples can be completely avoided.) S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 17 / 24
33 Dependence diagram among ρdf vocabulary type V 0 sc dom range To determine G = H it is enough to test G = H where G is the subgraph of G which involves only nodes in voc(h) and their dependencies in the diagram. S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 18 / 24
34 It is possible to avoid the closure to test RDFS entailment A naive approach to test G = H is: (pre-)compute the closure of G check if H is contained in the closure of G. Theorem The size of the closure of G is O( G 2 ), and this bound is tight. S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 19 / 24
35 It is possible to avoid the closure to test RDFS entailment A naive approach to test G = H is: (pre-)compute the closure of G check if H is contained in the closure of G. Theorem The size of the closure of G is O( G 2 ), and this bound is tight. Alternative: to use a goal oriented approach based on the dependencies diagram. S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 19 / 24
36 Goal oriented entailment algorithm Does the graph entails (x,d,y)? Look for triples of the form (x,a,y) and -paths from a to d. x a b c d y S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 20 / 24
37 Goal oriented entailment algorithm Does the graph entails (x,d,y)? Look for triples of the form (x,a,y) and -paths from a to d. x a b c d y S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 20 / 24
38 Goal oriented entailment algorithm Does the graph entails (x,d,y)? Look for triples of the form (x,a,y) and -paths from a to d. x a b c d y S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 20 / 24
39 Goal oriented entailment algorithm Does the graph entails (x,d,y)? Look for triples of the form (x,a,y) and -paths from a to d. x a b c d y S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 20 / 24
40 Goal oriented entailment algorithm Does the graph entails (x,d,y)? Look for triples of the form (x,a,y) and -paths from a to d. x a b c d y S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 20 / 24
41 Goal oriented entailment algorithm Does the graph entails (x,d,y)? Look for triples of the form (x,a,y) and -paths from a to d. x a b c d y S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 20 / 24
42 Goal oriented entailment algorithm Does the graph entails (x,d,y)? Look for triples of the form (x,a,y) and -paths from a to d. x a b c d y x a y b e c d S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 20 / 24
43 Goal oriented entailment algorithm Does the graph entails (x,d,y)? Look for triples of the form (x,a,y) and -paths from a to d. x a b c d y x a y b e c d S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 20 / 24
44 Goal oriented entailment algorithm Does the graph entails (x,d,y)? Look for triples of the form (x,a,y) and -paths from a to d. x a b c d y x a y b e c d S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 20 / 24
45 Goal oriented entailment algorithm Let G = {...,(x,p,z),(p,,q),(q,,r),(r,,s),(s,dom,c), (c,sc,d),(d,sc,y),... } Does the graph entails (x,type,y)? x z p q r s dom sc c sc d y S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 21 / 24
46 Goal oriented entailment algorithm Let G = {...,(x,p,z),(p,,q),(q,,r),(r,,s),(s,dom,c), (c,sc,d),(d,sc,y),... } Does the graph entails (x,type,y)? x z p q r s dom sc c sc d y S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 21 / 24
47 Goal oriented entailment algorithm Let G = {...,(x,p,z),(p,,q),(q,,r),(r,,s),(s,dom,c), (c,sc,d),(d,sc,y),... } Does the graph entails (x,type,y)? x z p q r s dom sc c sc d y S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 21 / 24
48 Goal oriented entailment algorithm Let G = {...,(x,p,z),(p,,q),(q,,r),(r,,s),(s,dom,c), (c,sc,d),(d,sc,y),... } Does the graph entails (x,type,y)? x z p q r s dom sc c sc d y S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 21 / 24
49 Goal oriented entailment algorithm Let G = {...,(x,p,z),(p,,q),(q,,r),(r,,s),(s,dom,c), (c,sc,d),(d,sc,y),... } Does the graph entails (x,type,y)? x z p q r s dom sc c sc d y S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 21 / 24
50 Goal oriented entailment algorithm Let G = {...,(x,p,z),(p,,q),(q,,r),(r,,s),(s,dom,c), (c,sc,d),(d,sc,y),... } Does the graph entails (x,type,y)? x z p q r s dom sc c sc d y S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 21 / 24
51 Goal oriented entailment algorithm Let G = {...,(x,p,z),(p,,q),(q,,r),(r,,s),(s,dom,c), (c,sc,d),(d,sc,y),... } Does the graph entails (x,type,y)? x z p q r s dom sc c sc d y S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 21 / 24
52 Goal oriented entailment algorithm Let G = {...,(x,p,z),(p,,q),(q,,r),(r,,s),(s,dom,c), (c,sc,d),(d,sc,y),... } Does the graph entails (x,type,y)? x z p q r s dom sc c sc d y S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 21 / 24
53 Goal oriented entailment algorithm Let G = {...,(x,p,z),(p,,q),(q,,r),(r,,s),(s,dom,c), (c,sc,d),(d,sc,y),... } Does the graph entails (x,type,y)? x z p q r s dom sc c sc d y S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 21 / 24
54 Entailment can be done in O(n logn) time Theorem The goal oriented algorithm takes O( G log G ) time in testing the entailment G = t. Correctness follows by the dependencies diagram. Essentially time G log G in constructing the necessary graph data-structures. Time G in traversing these data-structures. There is no more efficient approach to test G = t! S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 22 / 24
55 Entailment can be done in O(n logn) time Theorem The goal oriented algorithm takes O( G log G ) time in testing the entailment G = t. Correctness follows by the dependencies diagram. Essentially time G log G in constructing the necessary graph data-structures. Time G in traversing these data-structures. There is no more efficient approach to test G = t! S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 22 / 24
56 The O(n log n) bound is tight. Theorem Testing G = t takes time Ω( G log G ). Idea: Coding the set-disjointness problem, which is Ω(n log n) S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 23 / 24
57 Conclusions Core fragment of RDFS well-behaved, representative, and simple. S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 24 / 24
58 Conclusions Core fragment of RDFS well-behaved, representative, and simple. Efficient algorithm to check entailment S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 24 / 24
59 Conclusions Core fragment of RDFS well-behaved, representative, and simple. Efficient algorithm to check entailment Suggestions Add missing rules Eliminate reflexivity Treat bnodes orthogonal to rest S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 24 / 24
60 Conclusions Core fragment of RDFS well-behaved, representative, and simple. Efficient algorithm to check entailment Suggestions Add missing rules Eliminate reflexivity Treat bnodes orthogonal to rest Next: Navigational language based on testing algorithm S. Muñoz, J. Pérez, C. Gutierrez Minimal Deductive Systems for RDF 24 / 24
A 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 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 informationAnnotation algebras for RDFS
University of Edinburgh Semantic Web in Provenance Management, 2010 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
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 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 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 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 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 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 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 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 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 informationWeb Ontology Language (OWL)
Web Ontology Language (OWL) Need meaning beyond an object-oriented type system RDF (with RDFS) captures the basics, approximating an object-oriented type system OWL provides some of the rest OWL standardizes
More informationI4-DX2 RDF Querying in Xcerpt
I4-DX2 RDF Querying in Xcerpt Project title: Reasoning on the Web with Rules and Semantics Project acronym: REWERSE Project number: IST-2004-506779 Project instrument: EU FP6 Network of Excellence (NoE)
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 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 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 informationOn the Properties of Metamodeling in OWL
On the Properties of Metamodeling in OWL Boris Motik University of Manchester Manchester, UK bmotik cs.man.ac.uk August 25, 2007 Abstract A common practice in conceptual modeling is to separate the
More informationDenotational semantics of linear logic
Denotational semantics of linear logic Lionel Vaux I2M, Université d Aix-Marseille, France LL2016, Lyon school: 7 and 8 November 2016 L. Vaux (I2M) Denotational semantics of linear logic LL2016 1 / 31
More informationNon-deterministic Matrices for Semi-canonical Deduction Systems
Non-deterministic Matrices for Semi-canonical Deduction Systems Ori Lahav School of Computer Science Tel Aviv University Tel-Aviv, Israel Email: orilahav@post.tau.ac.il Abstract We use non-deterministic
More informationOWL Semantics COMP Sean Bechhofer Uli Sattler
OWL Semantics COMP62342 Sean Bechhofer sean.bechhofer@manchester.ac.uk Uli Sattler uli.sattler@manchester.ac.uk 1 Toward Knowledge Formalization Acquisition Process Elicit tacit knowledge A set of terms/concepts
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 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 informationKnowledge Base Exchange: The Case of OWL 2 QL
Knowledge Base Exchange: The Case of OWL 2 QL Marcelo Arenas Pontificia Universidad Católica de Chile, Chile Elena Botoeva, Diego Calvanese, Vladislav Ryzhikov Free University of Bozen-Bolzano, Italy Abstract
More information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
More informationKnowledge Sharing. A conceptualization is a map from the problem domain into the representation. A conceptualization specifies:
Knowledge Sharing A conceptualization is a map from the problem domain into the representation. A conceptualization specifies: What sorts of individuals are being modeled The vocabulary for specifying
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 informationSemaDrift: A Protégé Plugin for Measuring Semantic Drift in Ontologies
GRANT AGREEMENT: 601138 SCHEME FP7 ICT 2011.4.3 Promoting and Enhancing Reuse of Information throughout the Content Lifecycle taking account of Evolving Semantics [Digital Preservation] SemaDrift: A Protégé
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 informationImproved Algorithms for Module Extraction and Atomic Decomposition
Improved Algorithms for Module Extraction and Atomic Decomposition Dmitry Tsarkov tsarkov@cs.man.ac.uk School of Computer Science The University of Manchester Manchester, UK Abstract. In recent years modules
More informationChapter 3: Propositional Calculus: Deductive Systems. September 19, 2008
Chapter 3: Propositional Calculus: Deductive Systems September 19, 2008 Outline 1 3.1 Deductive (Proof) System 2 3.2 Gentzen System G 3 3.3 Hilbert System H 4 3.4 Soundness and Completeness; Consistency
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 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 information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 5 CHAPTER 2 FINITE AUTOMATA 1. Deterministic Finite Automata DFA 2. Nondeterministic Finite Automata NDFA 3. Finite Automata
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 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 informationTHE EQUATIONAL THEORIES OF REPRESENTABLE RESIDUATED SEMIGROUPS
TH QUATIONAL THORIS OF RPRSNTABL RSIDUATD SMIGROUPS SZABOLCS MIKULÁS Abstract. We show that the equational theory of representable lower semilattice-ordered residuated semigroups is finitely based. We
More information07 Practical Application of The Axiomatic Method
CAS 701 Fall 2002 07 Practical Application of The Axiomatic Method Instructor: W. M. Farmer Revised: 28 November 2002 1 What is the Axiomatic Method? 1. A mathematical model is expressed as a set of axioms
More informationTableau Systems for Logics of Formal Inconsistency
Tableau Systems for Logics of Formal Inconsistency Walter A. Carnielli Centre for Logic and Epistemology, and Department of Philosophy State University of Campinas CLE/Unicamp, Campinas, Brazil João Marcos
More informationUnivalent Foundations and Set Theory
Univalent Foundations and Set Theory Talk by Vladimir Voevodsky from Institute for Advanced Study in Princeton, NJ. May 8, 2013 1 Univalent foundations - are based on a class of formal deduction systems
More informationThe Curry-Howard Isomorphism
The Curry-Howard Isomorphism Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) The Curry-Howard Isomorphism MFES 2008/09
More informationModel-theoretic Semantics
Model-theoretic Semantics 1 Semantics Intro I What is the semantics of the following statement, according to RDF and according to RDFS? Ex:SpaceAccessory rdfs:subclassof ex:product 2 Semantics Intro II
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 informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 3 CHAPTER 1 SETS, RELATIONS, and LANGUAGES 6. Closures and Algorithms 7. Alphabets and Languages 8. Finite Representation
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 informationBeyond First-Order Logic
Beyond First-Order Logic Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) Beyond First-Order Logic MFES 2008/09 1 / 37 FOL
More informationCHAPTER 10. Gentzen Style Proof Systems for Classical Logic
CHAPTER 10 Gentzen Style Proof Systems for Classical Logic Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. By humans, not mentioning
More informationOn the Complexity of the Reflected Logic of Proofs
On the Complexity of the Reflected Logic of Proofs Nikolai V. Krupski Department of Math. Logic and the Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Moscow 119899,
More informationA brief introduction to Logic. (slides from
A brief introduction to Logic (slides from http://www.decision-procedures.org/) 1 A Brief Introduction to Logic - Outline Propositional Logic :Syntax Propositional Logic :Semantics Satisfiability and validity
More informationOutline. 1 Background and Aim. 2 Main results (in the paper) 3 More results (not in the paper) 4 Conclusion
Outline 1 Background and Aim 2 Main results (in the paper) 3 More results (not in the paper) 4 Conclusion De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016
More informationLanguages. Languages. An Example Grammar. Grammars. Suppose we have an alphabet V. Then we can write:
Languages A language is a set (usually infinite) of strings, also known as sentences Each string consists of a sequence of symbols taken from some alphabet An alphabet, V, is a finite set of symbols, e.g.
More informationP, NP, NP-Complete, and NPhard
P, NP, NP-Complete, and NPhard Problems Zhenjiang Li 21/09/2011 Outline Algorithm time complicity P and NP problems NP-Complete and NP-Hard problems Algorithm time complicity Outline What is this course
More informationPropositional and Predicate Logic - V
Propositional and Predicate Logic - V Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - V WS 2016/2017 1 / 21 Formal proof systems Hilbert s calculus
More informationFinite Automata and Regular Languages (part III)
Finite Automata and Regular Languages (part III) Prof. Dan A. Simovici UMB 1 / 1 Outline 2 / 1 Nondeterministic finite automata can be further generalized by allowing transitions between states without
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 informationAxiomatizing Conditional Independence and Inclusion Dependencies
Axiomatizing Conditional Independence and Inclusion Dependencies Miika Hannula University of Helsinki 6.3.2014 Miika Hannula (University of Helsinki) Axiomatizing Conditional Independence and Inclusion
More informationInducing syntactic cut-elimination for indexed nested sequents
Inducing syntactic cut-elimination for indexed nested sequents Revantha Ramanayake Technische Universität Wien (Austria) IJCAR 2016 June 28, 2016 Revantha Ramanayake (TU Wien) Inducing syntactic cut-elimination
More informationJustification logic - a short introduction
Institute of Computer Science and Applied Mathematics University of Bern Bern, Switzerland January 2013 Modal Logic A Modal Logic A A B and Modal Logic A A B B and thus Modal Logic A A B B and thus A (A
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
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 informationExchanging More than Complete Data
Exchanging More than Complete Data Marcelo Arenas Jorge Pérez Juan Reutter PUC Chile, Universidad de Chile, University of Edinburgh Father Andy Bob Bob Danny Danny Eddie Mother Carrie Bob Father(x, y)
More informationFormal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University
Formal Epistemology: Lecture Notes Horacio Arló-Costa Carnegie Mellon University hcosta@andrew.cmu.edu Logical preliminaries Let L 0 be a language containing a complete set of Boolean connectives, including
More informationIntensionality, Extensionality, and Proof Irrelevance in Modal Type Theory
Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory Frank Pfenning LICS 01 Boston, Massachusetts June 17, 2001 Acknowledgments: Alberto Momigliano,... 1 Outline 1. Introduction 2.
More informationTopics in Model-Based Reasoning
Towards Integration of Proving and Solving Dipartimento di Informatica Università degli Studi di Verona Verona, Italy March, 2014 Automated reasoning Artificial Intelligence Automated Reasoning Computational
More informationMinimal logic for computable functionals
Minimal logic for computable functionals Helmut Schwichtenberg Mathematisches Institut der Universität München Contents 1. Partial continuous functionals 2. Total and structure-total functionals 3. Terms;
More informationDecidability in the Substructure Ordering of Finite Graphs
Decidability in the Substructure Ordering of Finite Graphs Ramanathan S. Thinniyam Institute of Mathematical Sciences, Chennai, India Logic Colloquium, July 23, 2018 joint work with Anantha Padmanabha,
More informationCS375 Midterm Exam Solution Set (Fall 2017)
CS375 Midterm Exam Solution Set (Fall 2017) Closed book & closed notes October 17, 2017 Name sample 1. (10 points) (a) Put in the following blank the number of strings of length 5 over A={a, b, c} that
More informationInverting Proof Systems for Secrecy under OWA
Inverting Proof Systems for Secrecy under OWA Giora Slutzki Department of Computer Science Iowa State University Ames, Iowa 50010 slutzki@cs.iastate.edu May 9th, 2010 Jointly with Jia Tao and Vasant Honavar
More informationEDA045F: Program Analysis LECTURE 10: TYPES 1. Christoph Reichenbach
EDA045F: Program Analysis LECTURE 10: TYPES 1 Christoph Reichenbach In the last lecture... Performance Counters Challenges in Dynamic Performance Analysis Taint Analysis Binary Instrumentation 2 / 44 Types
More informationDeductive Characterization of Logic
6 The Deductive Characterization of Logic 1. Derivations...2 2. Deductive Systems...3 3. Axioms in Deductive Systems...4 4. Axiomatic Systems...5 5. Validity and Entailment in the Deductive Context...6
More informationOn 3-valued paraconsistent Logic Programming
Marcelo E. Coniglio Kleidson E. Oliveira Institute of Philosophy and Human Sciences and Centre For Logic, Epistemology and the History of Science, UNICAMP, Brazil Support: FAPESP Syntax Meets Semantics
More informationAn Abstract Decision Procedure for a Theory of Inductive Data Types
An Abstract Decision Procedure for a Theory of Inductive Data Types lark Barrett Igor Shikanian Department of omputer Science ourant Institute of Mathematical Sciences New York University esare Tinelli
More information2.2 Lowenheim-Skolem-Tarski theorems
Logic SEP: Day 1 July 15, 2013 1 Some references Syllabus: http://www.math.wisc.edu/graduate/guide-qe Previous years qualifying exams: http://www.math.wisc.edu/ miller/old/qual/index.html Miller s Moore
More informationThe Bayesian Ontology Language BEL
Journal of Automated Reasoning manuscript No. (will be inserted by the editor) The Bayesian Ontology Language BEL İsmail İlkan Ceylan Rafael Peñaloza Received: date / Accepted: date Abstract We introduce
More informationModal Logics. Most applications of modal logic require a refined version of basic modal logic.
Modal Logics Most applications of modal logic require a refined version of basic modal logic. Definition. A set L of formulas of basic modal logic is called a (normal) modal logic if the following closure
More informationStructured Descriptions & Tradeoff Between Expressiveness and Tractability
5. Structured Descriptions & Tradeoff Between Expressiveness and Tractability Outline Review Expressiveness & Tractability Tradeoff Modern Description Logics Object Oriented Representations Key Representation
More informationCombining Decision Procedures
Combining Decision Procedures Ashish Tiwari tiwari@csl.sri.com http://www.csl.sri.com/. Computer Science Laboratory SRI International 333 Ravenswood Menlo Park, CA 94025 Combining Decision Procedures (p.1
More informationCombined Satisfiability Modulo Parametric Theories
Intel 07 p.1/39 Combined Satisfiability Modulo Parametric Theories Sava Krstić*, Amit Goel*, Jim Grundy*, and Cesare Tinelli** *Strategic CAD Labs, Intel **The University of Iowa Intel 07 p.2/39 This Talk
More informationGraph Theory and Modal Logic
Osaka University of Economics and Law (OUEL) Aug. 5, 2013 BLAST 2013 at Chapman University Contents of this Talk Contents of this Talk 1. Graphs = Kripke frames. Contents of this Talk 1. Graphs = Kripke
More informationA Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks Maxim A. Babenko Ignat I. Kolesnichenko Ilya P. Razenshteyn Moscow State University 36th International Conference on Current
More informationEnhancing the Updatability of Projective Views
Enhancing the Updatability of Projective Views (Extended Abstract) Paolo Guagliardo 1, Reinhard Pichler 2, and Emanuel Sallinger 2 1 KRDB Research Centre, Free University of Bozen-Bolzano 2 Vienna University
More informationDenoting computation
A jog from Scott Domains to Hypercoherence Spaces 13/12/2006 Outline Motivation 1 Motivation 2 What Does Denotational Semantic Mean? Trivial examples Basic things to know 3 Scott domains di-domains 4 Event
More informationOverview. CS389L: Automated Logical Reasoning. Lecture 7: Validity Proofs and Properties of FOL. Motivation for semantic argument method
Overview CS389L: Automated Logical Reasoning Lecture 7: Validity Proofs and Properties of FOL Agenda for today: Semantic argument method for proving FOL validity Işıl Dillig Important properties of FOL
More informationFirst-Order Theorem Proving and Vampire
First-Order Theorem Proving and Vampire Laura Kovács 1,2 and Martin Suda 2 1 TU Wien 2 Chalmers Outline Introduction First-Order Logic and TPTP Inference Systems Saturation Algorithms Redundancy Elimination
More informationProseminar on Semantic Theory Fall 2013 Ling 720 Proving the Soundness and Completeness of Propositional Logic: Some Highlights 1
Proving the Soundness and Completeness of Propositional Logic: Some Highlights 1 (1) A Summary of What We ve Done So Far for PL a. We ve given a purely syntactic characterization of valid inference in
More informationSPARQL Extensions and Outlook
SPARQL Extensions and Outlook Axel Polleres 1 1 DERI Galway, National University of Ireland, Galway axel.polleres@deri.org European Semantic Web Conference 2007 A. Polleres SPARQL Extensions and Outlook
More informationRelational Database Design
Relational Database Design Jan Chomicki University at Buffalo Jan Chomicki () Relational database design 1 / 16 Outline 1 Functional dependencies 2 Normal forms 3 Multivalued dependencies Jan Chomicki
More informationIsomorphism of Finitary Inductive Types
Isomorphism of Finitary Inductive Types Christian Sattler joint work (in progress) with Nicolai Kraus University of Nottingham May 2014 Motivating Example Generic data may be represented in a multitude
More informationA few bridges between operational and denotational semantics of programming languages
A few bridges between operational and denotational semantics of programming languages Soutenance d habilitation à diriger les recherches Tom Hirschowitz November 17, 2017 Hirschowitz Bridges between operational
More informationNP-Complete Reductions 2
x 1 x 1 x 2 x 2 x 3 x 3 x 4 x 4 12 22 32 CS 447 11 13 21 23 31 33 Algorithms NP-Complete Reductions 2 Prof. Gregory Provan Department of Computer Science University College Cork 1 Lecture Outline NP-Complete
More informationErrata and Remarks for The Semantics and Proof Theory of the Logic of Bunched Implications BI-monograph-errata.
Errata and Remarks for The Semantics and Proof Theory of the Logic of Bunched Implications http://www.cs.bath.ac.uk/~pym/ BI-monograph-errata.pdf David J. Pym University of Bath 30 March, 2008 Abstract
More informationClassical Propositional Logic
The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,
More informationFirst-order resolution for CTL
First-order resolution for Lan Zhang, Ullrich Hustadt and Clare Dixon Department of Computer Science, University of Liverpool Liverpool, L69 3BX, UK {Lan.Zhang, U.Hustadt, CLDixon}@liverpool.ac.uk Abstract
More informationWhere are we? Operations on fuzzy sets (cont.) Fuzzy Logic. Motivation. Crisp and fuzzy sets. Examples
Operations on fuzzy sets (cont.) G. J. Klir, B. Yuan, Fuzzy Sets and Fuzzy Logic: Theory and Applications, Prentice-Hall, chapters -5 Where are we? Motivation Crisp and fuzzy sets alpha-cuts, support,
More informationhal , version 1-21 Oct 2009
ON SKOLEMISING ZERMELO S SET THEORY ALEXANDRE MIQUEL Abstract. We give a Skolemised presentation of Zermelo s set theory (with notations for comprehension, powerset, etc.) and show that this presentation
More informationThe Flows of Concepts
Marcin Skulimowski Faculty of Physics and Applied Informatics, University of Lodz, Pomorska 149/153, 90-236 Lodz, Poland Keywords: Abstract: Citation Relation, Semantic Publishing, Digital Libraries. A
More informationDefining a water quality vocabulary using QUDT and ChEBI
Defining a water quality vocabulary using QUDT and ChEBI B.A. Simons a, J. Yu a, & S.J.D. Cox a a CSIRO Land and Water Email: bruce.simons@csiro.au Abstract: Vocabularies of observed properties and associated
More information3-Valued Abstraction-Refinement
3-Valued Abstraction-Refinement Sharon Shoham Academic College of Tel-Aviv Yaffo 1 Model Checking An efficient procedure that receives: A finite-state model describing a system A temporal logic formula
More information