Modelling and Implementation Methodology in the IoT/LD Approach to the Semantic Web
|
|
- Alisha French
- 5 years ago
- Views:
Transcription
1 Modelling and Implementation Methodology in the IoT/LD Approach to the Semantic Web Terje Aaberge Western Norway Research Institute, P. O Box 169, 6851 Sogndal, Norway Abstract. The paper presents a modelling and implementation methodology compatible with the Internet of Things and Linked Data paradigm. Linked data are naturally depicted by a directed graph whose nodes represent Things and edges or arrows relations. The conceptual models of intensional interpretations of first order formal languages are directed graphs. It is therefore natural to base the description language of the domain represented by a linked data structure on an intensional interpretation. In this paper I outline how to define an intentional interpretation of an object language and how to construct an object metalanguage. The construction is canonical; moreover, the metalanguage has the characteristics of an ontology language. I use this to show how to represent linked data on a machine readable format such that they more easily and effectively can be exploited by smart human oriented apps. Keywords: semantic web, internet of things, linked data, iot, ld, lod, semantic, modelling 1. Introduction The Internet of Things (IoT), in the context of the Semantic Web, is the idea of referring to things of the world on the Web by Universal Resource Identifiers (URI). A URI comes as dereferenceable URI or URN. Technically they both function as IDs, though one denote the Web-location (URL) or Webidentifier of a resource and the other serves as its name. There are two kinds of resources; those that have a digital representation located on the Web and things of the world that can only be referred to. For example, a digital representation of a book may be stored on the Web and located by a URL and it may have a unique name (URN), its isbn-number. On the other hand, things of the world, i.e. physical objects, persons, towns, services etc. can only be referred to by URIs. Linked Data (LD) is a method of publishing loosely connected data. It builds upon standard Web technologies, such as HTTP and URIs, but rather than using them to serve web pages for human readers, allow data from different sources to be connected and queried, thus enabling automated access to information [1,]. A set of URIs 1 representing objects, relations between them and information resources about them is an example of a set of linked data. It is a concrete realisation of a conceptual model of the corresponding domain of objects and information resources pictured by a directed graph (Figure 1): 1 To simplify the presentation throughout I will not insist on the difference between the dereferenceable URI identifying an individual and the URL locating an index card describing the individual, though this difference is important both conceptually and technically.
2 where the relations between documents and individuals are of one kind, About. The other relations are internal to the object sub domain. The standard methodology of LD does however, not exploit the graph as the conceptual model on which to base the semantics of a formal description language of the domain. This is what will be done in the following. I will outline a modelling methodology by applying intensional formal semantic for which the conceptual models are precisely directed graphs []. The result will then be a modelling methodology taking into account the specificities of the IoT/LD and which moreover, distinguishes modelling from the encoding [3]. An intensional interpretation is represented by maps from the domain to the vocabulary of the language: an isomorphism that maps the individuals (or relations) to names and observables that maps individuals (or relations) to predicates. The observables are identified by mutual exclusion of properties. Two properties that cannot simultaneously be possessed by an individual are represented by predicates belonging to the range of the same observable; an individual cannot at the same time be red and green, colour is therefore an observable. Other observables are weight, position in space, temperature etc. The interpretations of physical theories are intensional and the notion of observable is taken from physics. A philosophical justification of intensional semantic is moreover, found in Wittgenstein s Tractatus [4] where the picture theory points to an intensional interpretation of logic. Intensional interpretations conceive the structure of language as being imposed by the structure of the domain, contrary to extensional (model theoretic) interpretations for which the structure of language imposes the structure of the domain. In fact, the conceptual model of the domain in the latter case is a set consisting of the individuals, sets of individuals, sets of pairs of individuals and the interpretation is represented by a map (isomorphism) that to a name associates an individual and to a predicate its extension, i.e. to a one-place predicate a set of individuals and to a two-place predicate a set of ordered pairs of individuals etc. The extensional interpretation can be derived from an intensional interpretation. By taking the inverse images of the predicates with respect to the observables we get the extensions of the predicates. The opposite construction is however, not possible. We cannot reconstruct an intensional interpretation from an extensional one. The reason is that intensional definitions contain more information than extensional enumerations. This is an important bonus when applying intensional interpretations. The semantic structure of an intensionally interpreted object language is expressed by a set of commutative diagrams. Their instances provide a conceptual (directed graph) model for the domain of the object metalanguage which thus has a canonical construction. The truth conditions, being related to the commutativity of the diagrams, can be formulated in this metalanguage without the generation of a hierarchy of languages. The metalanguage is by construction an ontology language. The linguistic representation of all the instances of the diagrams gives a complete description of the individuals of the object domain and the semantic relations of the intensional representation. It can be implemented as four separate components, ontology index knowledge base domain model The index is constituted by a set of index cards, one for each individual and located by a URL redirected to from the URI of the individual. The index card lists all atomic sentences attaching properties and attributes to the individual. The ontology is a set of implicit definitions (axioms) and terminological (intensional and extensional) definitions that picture structural properties of the domain and put restrictions on the possible interpretation of the vocabulary. The knowledgebase is constituted by the collection of information resources properly described and the domain model is a linguistic representation of the conceptual model. In the following I will give an outline of the intensional interpretation of an object language, present a construction of the canonical metalanguage, describe the above four components and explain their role in information retrieval.. Object language Let L ( N N V,P P ) D 1 1 stand for the object language for a domain D modelled as a directed graph (Figure 1). N 1 denotes the set of names of individuals, N the set of names of relations, V the set of variables, P 1 the set of unary predicates, and P the set of binary predicates. The language is endowed with an ontology.
3 The names of the individuals are given by a map ν : ν:d N1 N ;d ν( d) (1) drd s t ν ( drd s t) that to an individual d or relation drd s t in the domain d n n,n by D associates the name n by ν ( ) = or ( s t) ( drd) ( n,n) ν =, where n s and n t are the names s t s t of the individuals that constitutes source d s and target dt of the relation. I will assume, for simplicity, that ν is an isomorphism; then, there is a unique name for every individual (or relation) and there is exactly the same number of names as of relations and individuals. If there is more than one relation between two individuals one will have to index relation names with respect to the kind of relation. Each observable δ relates an individual d D or relation drd s t Dto a predicate δ δ 1:D P;d 1 1( d) :D P ;d s rd t ( d s rd t) δ δ () Moreover, for each δ there exists a unique map π defined by the condition of commutativity [5] of the diagram: πi Ni Pi ν δi D ( ) () s t i.e. π ν (). = δ., d, d rd D (3) where i=1 for properties and i= for relations. The diagram simulates measurements determining atomic facts and thereby assigns a property to an individual or relation to a pair of individuals. They are formulated as atomic sentences by the juxtaposition of names and predicates, e.g. the sentence pn where n is the name of the individual d and p the predicate referring to a property of d expresses a fact about d d d d n π n = p. The ( ) ( ) ( ) ( ) iff πν ( ) =δ, for ν ( ) = and ( ) instances ( d) d πν =δ of the commutativity condi- tions are therefore truth condition for the atomic object language sentences. An instance equates a proposition about the system d with a statement of the result of a measurement on d with respect to the observable δ. The instances of the diagrams thus express the content of object language sentences and of the semantic relations determining the interpretation of the object language. 3. Ontology An ontology for an object language is a set of axioms intensional definitions extensional definitions An axiom is an implicit definition that relates the primary terms of the vocabulary of the object language. The axioms picture structural properties of the domain and express restrictions on the possible meaning of predicates. The intensional and extensional definitions are terminological. They define secondary predicates, from the primary terms 3, that serve to facilitate the discourse, e.g. instead of having to repeat the properties that an individual must possess to be of a certain kind an intensional definition will introduce a predicate to denote the kind. An intensional definition of a predicate (definiendum) is thus the conjunction of atomic sentences (definientia) stating which properties that an individual must possess for the predicate to apply. When the meaning of the definientia is given the definition explains the meaning of definiendum. An extensional definition of a predicate on the other hand, is simply the list of the names of the individuals that constitute its extension. When the individuals referred to are known, the extension of the predicate representing its meaning is given. From an intensional definition of a predicate an extensional one can be derived; the extension of the predicate is the class of individuals that satisfies definientia in the intensional definition. It follows that the interpretation of the vocabulary is determined by the interpretation of the primary vocabulary. Though an ontology does not concern the semantics per se, the construction of an ontology has to be made in an interpreted language and evaluated accor- I use standard mathematical notation. denotes a map and points to the value of the map for a given argument. 3 Or rather, all terminological definitions can be expressed by means of the primary terms.
4 dingly. Its construction should therefore be justified by (formal) semantic considerations. 4. Object metalanguage/ontology language The relation between the object metalanguage and its domain is pictured by Figure : Figure where the direction of the arrows indicates intensional semantic [5]. The metalanguage for the object language is denoted L ( M M,Q) G 1 where the domain G consists of the set of instances of the diagrams (3) and of variables, sentences and formulae as isolated nodes; M=L 1 D, the names 4 of the nodes; M, the names of the relations (arrows d n etc. in (3)); and Q, the predicates of the metalanguage. The names of the individuals, relations between individuals, terms, sentences, and relations between these objects in the metalanguage, are given by the naming map (4), η:g M1 M ; d η ( d) = d n η ( n) = n i i (4) 4 I apply the convention that the string of symbols representing a name, a predicate, a sentence, a formula, a node or a relation serves as its name. This is justified by the fact that a sentence as symbolic entity embodies a syntactic form and expresses a proposition. The proposition belongs to the language and the syntactic form to the metalanguage. Since the sentences of the language are only mentioned and not used in the metalanguage the convention does not lead to problems. ( ( ) ) ( ) 1( ) ( ) = (( n,n s t),p) ( ) ( ) ν d = n η( ν d = n) = ( d,n) ( π n = p) η( π ( n) = p) = ( n,p) ( π n,n s t = p) η( π ( n,n s t) = p) ( δ d = p) η( δ ( d) = p) = ( d,p) ( δ drd s t = p) η( δ ( drd s t) = p) = ( drd,p s t ) where ( d) ν = ndenotes relations (arrows: d n ) etc. Predicates of the metalanguage are Individual, Property, Type, Class, Name, Relation and Sent (for sentence) that express properties of the elements of its domain and NameOf, π i Of and δ i Of that express (semantic) relations. One should notice that since an individual is identified by a URI and a URN one needs two predicates in the metalanguage to distinguish between them, Individual to denote URIs of individuals and Name to denote the URNs. Similarly, Relation and Property has been introduced in order be able to distinguish between URLs denoting kinds of relations and their linguistic representatives. Notice also that with respect to concrete applications δ i Of will be expressed in terms of the name of the observable, for example ColourOf. I have used Property and Class as a reminder of the OWL vocabulary. Other words might be more natural in the present intensional setting. In first order logic notation a complete representation of the object language atomic sentence pn in the metalanguage, including statements about syntactic values and semantic relations, is ( ) ( ) ( ) ( ) ( ) ( ) Individual d Name n NameOf n,d Class p δ1of p,d π 1Of p,n (5) Thus, the truth conditions for atomic object language sentences are of the form ( ) ( ) ( ) ( ) δ1of ( p,d) ( ) Individual d Name n Class p NameOf n,d π1of p,n Tpn (6) for T being the truth predicate; similarly for the object language sentences expressing relations. The left hand side of this implication is the linguistic representations of an instance of the commutativity conditions (3). This shows that the translation of the con-
5 ceptual content of the object language sentence pn to the metalanguage is π 1Of ( p,n), e.g. the sentence n is red to red is the colour of n. For a fixed d the sentences of the form (7) whose atomic components satisfy (8) are the descriptive sentences of the individual represented by the URI d. Reasoning takes place in the metalanguage, on the basis of the ontology formulated in the object language, by means of deduction rules like modus ponens, ( ) ( ) ( ) ( ) Sent h1 Sent h Th1 T h1 h Th (7) It depends solely on the syntactic structure of the object language sentences, not on their meaning. Deductions will not be discussed in this paper. 5. Index The sentences of L G are uniquely expressible in a N3 representation by blocks of RDF triples 5. Thus, (5) translates to ml:d owl:type owl :Individual ol:n owl:type ml :Name ol:p owl:type owl:class ol:n ml:nameof ml:d ol:p ml: δ 1 Of ml:d ol:p ml: π 1 Of ol:n and ml:r owl:type ml:relation ol: ( n,n s t) owl:type ml:name ol: p owl:type owl:property ol: ( n,n s t) ml:nameof ml: nrn s t ol: p ml: δ Of ml: drd s t ol: p ml: π Of ol: ( n,n s t ) ml: d s ml: r ml: d t (8) (9) is a translation of a corresponding sentence involving a relation. The prefixes ol, ml, and owl refer to the object language, metalanguage and OWL namespaces respectively. The triples of the kind 5 I will refer to the corresponding representation language as the ontology language. ml:d owl:type owl :Individual ol:n owl:type ml :Name ol:p owl:type owl:class ol:n ml:nameof ml:d are sentences in the ontology language that express the syntactic role of the terms of the vocabulary. The triples ol:p ml: π 1 Of ol: n ol: p ml: π ol: ( n,n ) Of s t are sentences in the ontology language that describe properties and relations of the individual referred to by the URI d s, and the triples ol:n ml:nameof ml:d ol:p ml: δ 1 Of ml:d ol: ( n,n s t) ml:nameof ml: nrn s t ol: p ml: δ Of ml: drd s t are sentences in the ontology language that describe semantic relations. And finally, triples of the kind ml: d s ml: r ml: d t are sentences in the metalanguage that express relations between individuals, i.e. they link the descriptions of the individuals of the domain. The index card for an individual d is constituted by the set of blocks like (8) which satisfies (6). The individuals of the object domain are thus represented as bundles of properties 6. The index is the set of index cards. 6. Knowledge base Web documents generated from a content management system (CMS) are located by a URL and named by a unique name (identifier). Though this might seem unnatural, the way they are represented shows that they should be considered to be a bundle of properties. A document in a CMS is named by an ID and described the by the values of the field names, e.g. Title, Abstract, Author, and Text. The values are the titles, author names, abstracts, and texts. If the title, author, abstract and text of a document named 6 In many practical cases the objects are quite complex and it will not be possible to pursue this ideal, i.e. describe the objects as a bundle of properties, but make more indirect descriptions.
6 n is, respectively, x, y, z and u, then the object language description of the document is xn yn zn un (10) The semantic structure of the object language is defined by the commutative diagrams (3) where D is the domain of documents, N the identifiers, P the predicates (i.e. in my example, the sets of titles, author names, abstracts, and texts): π N P ν δ D i.e. ( ) It follows that a N3 description of a document is 7 ml: d owl:type owl :Individual dl: n owl:type ml:name dl: x owl:type owl:class dl: n ml:nameof ml: d dl: x ml:titleof ml: d dl: x ml:titleof dl: n dl:y owl:type owl:class dl:y ml:authorof ml: d (1) dl:y ml:authorof dl: n dl:z owl:type owl:class dl:z ml:abstractof ml: d dl:z ml:abstractof dl: n dl:u owl:type owl:class dl:u ml:textof ml: d dl:u ml:textof dl: n that also describe the formal meaning of its elements. The set of such descriptions of the documents is an N3 representation of the knowledge base, i.e. a description (and representation) in an ontology language. 7. Domain model ( ) ( ) πν d =δd, d D The domain model is the linguistic representative of the conceptual graph model (Figure 1). It consists of a set of N3 triples ml: d s ml: r ml: d t that represent the relations between individuals, and the set of triples 7 dl stands for the document language name space. (11) ml: d ml:about ml: d that represent the relations between documents and individuals. In addition we have to declare the syntactic role of the terms, ml: d owl:type owl:individual ml: d owl:type owl:individual ml: r owl:type ml:relation ml:about owl:type ml:relation The domain model contains the structural information about the domain. For reasons that will become clear it is most appropriate for the construction of apps to keep this information separated from the information in the index cards. 8. Methodology The modelling and implementation methodology to establish the description language of a domain is the canonically given stepwise procedure: 1. delimit precisely the object domain. make a conceptual model of the object domain 3. identify a vocabulary for the description of the elements of the object domain 4. establish an ontology for the object language 5. describe the individuals of the domain in the object language 6. construct the object metalanguage 7. express the linguistic representatives of the instances of the diagrams (3) in the metalanguage 8. constitute the knowledge base 9. establish a document description language and document metalanguage for the knowledge base 10. encode a. ontology b. index cards c. knowledge base d. model of the hole domain (Figure 1) The steps 1-3 are preliminary but important and practically inseparable. The choice of conceptual model of the domain determines a unique interpretation. Step 4 must take into account what an ontology is, i.e. the difference between axioms and terminological definitions. To describe the individuals (step 5) is an empirical task. The metalanguage is canonically constructed (step 6). Step 7 results in descriptions of the individuals and an account of the conceptual model of the object domain. 8 and 9 are in prac-
7 tice inseparable. The last step consists in formulating a machine readable representation of the ontology, index, knowledge base and model of the total domain. The methodology strictly distinguishes between modelling and coding of the knowledge base from an abstract point of view. 9. Retrieval mechanism The retrieval mechanism is search through the ontology. This means that the search term is compared with the ontology. If it is a name or a primary term it will pass through and is then compared with the content of the index cards. This determines a set of URIs representing individuals that satisfy the search criteria. The domain model then pick the documents (or sub parts of documents) that are about these individuals, i.e. have the relation About to the individuals. If it is a secondary predicate defined by an intensional definition then the search engine is comparing the definition of the predicate with the descriptions of the individuals on the index cards. It then picks the individuals that satisfy the definitions. The next operation is identical to the former case. The retrieval mechanism may include deductions. The problem that has triggered the research is how to publish on the Web in such a way that the information is easily exploitable by third party applications combining information from different sources. Clearly, such applications involve many issues, from translations between vocabularies and ontology alignment to privacy and copyrights. Modulo these issues, the paradigm of IoT/LD opens up for many possible applications, technically quite feasible at present. In fact to build such an application one may follow the methodology in 8. This means to constitute a domain by choosing URIs representing individuals and documents from several published repositories. One then establishes a domain model and constructs an ontology adapted to the tasks to be performed by the application. If indexes do not exist, an index must be established from scratch. The ontology, domain model and the index are implemented in the application which will retrieve information from the published knowledge bases by means of the mechanisms already described. The smartness of the applications depends on the semantic information available in the index cards and on the structure of the ontology. How it can present the information will depend on the way documents are described. 11. Concluding Remarks In this paper I have presented a modelling and implementation methodology for IoT/LD based on intensional semantic. Given the structure of the Web and the specificities of the IoT/LD this seems to me to be a more appropriate choice of semantic theory on which to base the modelling than extensional (model theoretic) semantic. Coherently pursued it leads to a canonical construction of a metalanguage and associated ontology language in which one may formulate all the true sentences of the individuals, assess the syntactic role of the terms of the vocabulary and express the semantic relations. The methodology uses extensively diagrams that are easy to read and interpret such that the structure of the framework is clearly exposed; and they are easy to apply, thus facilitating modelling and encoding. 10. Applications References [1] Bizer, Ch., Heath, T. and Berners-Lee T.: Linked Data - The Story So Far, lee-ijswis-linked-data.pdf [] Bizer,., Cyganiak, R. and Heath, T.:How to Publish Linked Data on the Web, [3] Aaberge, T., 009. On Intensional Interpretations of Scientific Theories, In: Münz, V., Puhl, K. and Wang, J. (eds.): The 3nd International Wittgenstein Symposium, LWS, Kirchberg [4] Kuhn, W., 010. Modeling vs encoding for the Semantic Web, Journal of Web Semantics 1 (11 15) [5] Wittgenstein, L., Tractatus logico-philosophicus, Routledge and Kegan Paul, London [6] Aaberge, T., 010. Picturing Semantic Relations, In: Heinrich, R., Nemeth, E. and Pichler, W. (eds.): The 33d International Wittgenstein Symposium, LWS, Kirchberg [7] Lawvere, F. W. And Schanuel, S. H., Conceptual Mathematics, Cambridge University Press, Cambridge
Knowledge Representation
Knowledge Representation References Rich and Knight, Artificial Intelligence, 2nd ed. McGraw-Hill, 1991 Russell and Norvig, Artificial Intelligence: A modern approach, 2nd ed. Prentice Hall, 2003 Outline
More informationOntological Modeling: Part 2
Ontological Modeling: Part 2 Terry Halpin LogicBlox This is the second in a series of articles on ontology-based approaches to modeling. The main focus is on popular ontology languages proposed for the
More informationThe Formal Syntax and Semantics of Web-PDDL
The Formal Syntax and Semantics of Web-PDDL Dejing Dou Computer and Information Science University of Oregon Eugene, OR 97403, USA dou@cs.uoregon.edu Abstract. This white paper formally define the syntax
More informationSemantic Web Fundamentals
Semantic Web Fundamentals Web Technologies (706.704) 3SSt VU WS 2017/18 Vedran Sabol with acknowledgements to P. Höfler, V. Pammer, W. Kienreich ISDS, TU Graz December 11 th 2017 Overview What is Semantic
More informationLinked Open Data: a short introduction
International Workshop Linked Open Data & the Jewish Cultural Heritage Rome, 20 th January 2015 Linked Open Data: a short introduction Oreste Signore (W3C Italy) Slides at: http://www.w3c.it/talks/2015/lodjch/
More informationH1 Spring C. A service-oriented architecture is frequently deployed in practice without a service registry
1. (12 points) Identify all of the following statements that are true about the basics of services. A. Screen scraping may not be effective for large desktops but works perfectly on mobile phones, because
More informationNew Approach to Graph Databases
Paper PP05 New Approach to Graph Databases Anna Berg, Capish, Malmö, Sweden Henrik Drews, Capish, Malmö, Sweden Catharina Dahlbo, Capish, Malmö, Sweden ABSTRACT Graph databases have, during the past few
More informationOptiqueVQS: Ontology-based Visual Querying
Ahmet Soylu 1,2, Evgeny Kharlamov 3, Dmitriy Zheleznyakov 3, Ernesto Jimenez-Ruiz 3, Martin Giese 1, and Ian Horrocks 3 1 Department of Informatics, University of Oslo, Norway {ahmets, martingi}@ifi.uio.no
More informationH1 Spring B. Programmers need to learn the SOAP schema so as to offer and use Web services.
1. (24 points) Identify all of the following statements that are true about the basics of services. A. If you know that two parties implement SOAP, then you can safely conclude they will interoperate at
More informationIntroduction to Homotopy Type Theory
Introduction to Homotopy Type Theory Lecture notes for a course at EWSCS 2017 Thorsten Altenkirch March 5, 2017 1 What is this course about? To explain what Homotopy Type Theory is, I will first talk about
More informationPart I Logic programming paradigm
Part I Logic programming paradigm 1 Logic programming and pure Prolog 1.1 Introduction 3 1.2 Syntax 4 1.3 The meaning of a program 7 1.4 Computing with equations 9 1.5 Prolog: the first steps 15 1.6 Two
More informationCEN MetaLex. Facilitating Interchange in E- Government. Alexander Boer
CEN MetaLex Facilitating Interchange in E- Government Alexander Boer aboer@uva.nl MetaLex Initiative taken by us in 2002 Workshop on an open XML interchange format for legal and legislative resources www.metalex.eu
More informationPropositional Logic. Part I
Part I Propositional Logic 1 Classical Logic and the Material Conditional 1.1 Introduction 1.1.1 The first purpose of this chapter is to review classical propositional logic, including semantic tableaux.
More informationKnowledge Sharing Among Heterogeneous Agents
Knowledge Sharing Among Heterogeneous Agents John F. Sowa VivoMind Research, LLC 29 July 2013 Facts of Life: Diversity and Heterogeneity Open-ended variety of systems connected to the Internet: The great
More informationLogical 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
More informationCOMP718: Ontologies and Knowledge Bases
1/35 COMP718: Ontologies and Knowledge Bases Lecture 9: Ontology/Conceptual Model based Data Access Maria Keet email: keet@ukzn.ac.za home: http://www.meteck.org School of Mathematics, Statistics, and
More informationSemantic Web Fundamentals
Semantic Web Fundamentals Web Technologies (706.704) 3SSt VU WS 2018/19 with acknowledgements to P. Höfler, V. Pammer, W. Kienreich ISDS, TU Graz January 7 th 2019 Overview What is Semantic Web? Technology
More informationSemantic Web Test
Semantic Web Test 24.01.2017 Group 1 No. A B C D 1 X X X 2 X X 3 X X 4 X X 5 X X 6 X X X X 7 X X 8 X X 9 X X X 10 X X X 11 X 12 X X X 13 X X 14 X X 15 X X 16 X X 17 X 18 X X 19 X 20 X X 1. Which statements
More informationProseminar on Semantic Theory Fall 2013 Ling 720 An Algebraic Perspective on the Syntax of First Order Logic (Without Quantification) 1
An Algebraic Perspective on the Syntax of First Order Logic (Without Quantification) 1 1. Statement of the Problem, Outline of the Solution to Come (1) The Key Problem There is much to recommend an algebraic
More informationSemantics and Ontologies for Geospatial Information. Dr Kristin Stock
Semantics and Ontologies for Geospatial Information Dr Kristin Stock Introduction The study of semantics addresses the issue of what data means, including: 1. The meaning and nature of basic geospatial
More informationLinked Data and RDF. COMP60421 Sean Bechhofer
Linked Data and RDF COMP60421 Sean Bechhofer sean.bechhofer@manchester.ac.uk Building a Semantic Web Annotation Associating metadata with resources Integration Integrating information sources Inference
More informationTowards a Semantic Web Modeling Language
Towards a Semantic Web Modeling Language Draft Christoph Wernhard Persist AG Rheinstr. 7c 14513 Teltow Tel: 03328/3477-0 wernhard@persistag.com May 25, 2000 1 Introduction The Semantic Web [2] requires
More informationOperational Semantics
15-819K: Logic Programming Lecture 4 Operational Semantics Frank Pfenning September 7, 2006 In this lecture we begin in the quest to formally capture the operational semantics in order to prove properties
More informationSemantics. Matthew J. Graham CACR. Methods of Computational Science Caltech, 2011 May 10. matthew graham
Semantics Matthew J. Graham CACR Methods of Computational Science Caltech, 2011 May 10 semantic web The future of the Internet (Web 3.0) Decentralized platform for distributed knowledge A web of databases
More informationTyped Lambda Calculus
Department of Linguistics Ohio State University Sept. 8, 2016 The Two Sides of A typed lambda calculus (TLC) can be viewed in two complementary ways: model-theoretically, as a system of notation for functions
More informationA computer implemented philosophy of mathematics
A computer implemented philosophy of mathematics M. Randall Holmes May 14, 2018 This paper presents a philosophical view of the basic foundations of mathematics, which is implemented in actual computer
More informationX-KIF New Knowledge Modeling Language
Proceedings of I-MEDIA 07 and I-SEMANTICS 07 Graz, Austria, September 5-7, 2007 X-KIF New Knowledge Modeling Language Michal Ševčenko (Czech Technical University in Prague sevcenko@vc.cvut.cz) Abstract:
More informationDHTK: The Digital Humanities ToolKit
DHTK: The Digital Humanities ToolKit Davide Picca, Mattia Egloff University of Lausanne Abstract. Digital Humanities have the merit of connecting two very different disciplines such as humanities and computer
More informationClassical logic, truth tables. Types, Propositions and Problems. Heyting. Brouwer. Conjunction A B A & B T T T T F F F T F F F F.
lassical logic, truth tables Types, Propositions and Problems an introduction to type theoretical ideas engt Nordström omputing Science, halmers and University of Göteborg Types Summer School, Hisingen,
More informationThe Inverse of a Schema Mapping
The Inverse of a Schema Mapping Jorge Pérez Department of Computer Science, Universidad de Chile Blanco Encalada 2120, Santiago, Chile jperez@dcc.uchile.cl Abstract The inversion of schema mappings has
More informationFausto Giunchiglia and Mattia Fumagalli
DISI - Via Sommarive 5-38123 Povo - Trento (Italy) http://disi.unitn.it FROM ER MODELS TO THE ENTITY MODEL Fausto Giunchiglia and Mattia Fumagalli Date (2014-October) Technical Report # DISI-14-014 From
More informationa paradigm for the Introduction to Semantic Web Semantic Web Angelica Lo Duca IIT-CNR Linked Open Data:
Introduction to Semantic Web Angelica Lo Duca IIT-CNR angelica.loduca@iit.cnr.it Linked Open Data: a paradigm for the Semantic Web Course Outline Introduction to SW Give a structure to data (RDF Data Model)
More informationLecture 5. Logic I. Statement Logic
Ling 726: Mathematical Linguistics, Logic. Statement Logic V. Borschev and B. Partee, September 27, 2 p. Lecture 5. Logic I. Statement Logic. Statement Logic...... Goals..... Syntax of Statement Logic....2.
More informationDescription Logics as Ontology Languages for Semantic Webs
Description Logics as Ontology Languages for Semantic Webs Franz Baader, Ian Horrocks, and Ulrike Sattler Presented by:- Somya Gupta(10305011) Akshat Malu (10305012) Swapnil Ghuge (10305907) Presentation
More informationHelmi Ben Hmida Hannover University, Germany
Helmi Ben Hmida Hannover University, Germany 1 Summarizing the Problem: Computers don t understand Meaning My mouse is broken. I need a new one 2 The Semantic Web Vision the idea of having data on the
More informationSOFTWARE ENGINEERING DESIGN I
2 SOFTWARE ENGINEERING DESIGN I 3. Schemas and Theories The aim of this course is to learn how to write formal specifications of computer systems, using classical logic. The key descriptional technique
More informationRepresenting Product Designs Using a Description Graph Extension to OWL 2
Representing Product Designs Using a Description Graph Extension to OWL 2 Henson Graves Lockheed Martin Aeronautics Company Fort Worth Texas, USA henson.graves@lmco.com Abstract. Product development requires
More information1. true / false By a compiler we mean a program that translates to code that will run natively on some machine.
1. true / false By a compiler we mean a program that translates to code that will run natively on some machine. 2. true / false ML can be compiled. 3. true / false FORTRAN can reasonably be considered
More informationTowards a Logical Reconstruction of Relational Database Theory
Towards a Logical Reconstruction of Relational Database Theory On Conceptual Modelling, Lecture Notes in Computer Science. 1984 Raymond Reiter Summary by C. Rey November 27, 2008-1 / 63 Foreword DB: 2
More informationContents. G52IWS: The Semantic Web. The Semantic Web. Semantic web elements. Semantic Web technologies. Semantic Web Services
Contents G52IWS: The Semantic Web Chris Greenhalgh 2007-11-10 Introduction to the Semantic Web Semantic Web technologies Overview RDF OWL Semantic Web Services Concluding comments 1 See Developing Semantic
More informationCategory Theory in Ontology Research: Concrete Gain from an Abstract Approach
Category Theory in Ontology Research: Concrete Gain from an Abstract Approach Markus Krötzsch Pascal Hitzler Marc Ehrig York Sure Institute AIFB, University of Karlsruhe, Germany; {mak,hitzler,ehrig,sure}@aifb.uni-karlsruhe.de
More informationGraph Representation of Declarative Languages as a Variant of Future Formal Specification Language
Economy Informatics, vol. 9, no. 1/2009 13 Graph Representation of Declarative Languages as a Variant of Future Formal Specification Language Ian ORLOVSKI Technical University of Moldova, Chisinau, Moldova
More information15-819M: Data, Code, Decisions
15-819M: Data, Code, Decisions 08: First-Order Logic André Platzer aplatzer@cs.cmu.edu Carnegie Mellon University, Pittsburgh, PA André Platzer (CMU) 15-819M/08: Data, Code, Decisions 1 / 40 Outline 1
More informationUnderstandability and Semantic Interoperability of Diverse Rules Systems. Adrian Walker, Reengineering [1]
Understandability and Semantic Interoperability of Diverse Rules Systems Adrian Walker, Reengineering [1] Position Paper for the W3C Workshop on Rule Languages for Interoperability 27-28 April 2005, Washington,
More informationTyped Lambda Calculus for Syntacticians
Department of Linguistics Ohio State University January 12, 2012 The Two Sides of Typed Lambda Calculus A typed lambda calculus (TLC) can be viewed in two complementary ways: model-theoretically, as a
More informationSemantic Web Knowledge Representation in the Web Context. CS 431 March 24, 2008 Carl Lagoze Cornell University
Semantic Web Knowledge Representation in the Web Context CS 431 March 24, 2008 Carl Lagoze Cornell University Acknowledgements for various slides and ideas Ian Horrocks (Manchester U.K.) Eric Miller (W3C)
More informationDBpedia-An Advancement Towards Content Extraction From Wikipedia
DBpedia-An Advancement Towards Content Extraction From Wikipedia Neha Jain Government Degree College R.S Pura, Jammu, J&K Abstract: DBpedia is the research product of the efforts made towards extracting
More informationChapter 3: Propositional Languages
Chapter 3: Propositional Languages We define here a general notion of a propositional language. We show how to obtain, as specific cases, various languages for propositional classical logic and some non-classical
More informationFUZZY SPECIFICATION IN SOFTWARE ENGINEERING
1 FUZZY SPECIFICATION IN SOFTWARE ENGINEERING V. LOPEZ Faculty of Informatics, Complutense University Madrid, Spain E-mail: ab vlopez@fdi.ucm.es www.fdi.ucm.es J. MONTERO Faculty of Mathematics, Complutense
More informationOWL DL / Full Compatability
Peter F. Patel-Schneider, Bell Labs Research Copyright 2007 Bell Labs Model-Theoretic Semantics OWL DL and OWL Full Model Theories Differences Betwen the Two Semantics Forward to OWL 1.1 Model-Theoretic
More informationIntegrating SysML and OWL
Integrating SysML and OWL Henson Graves Lockheed Martin Aeronautics Company Fort Worth Texas, USA henson.graves@lmco.com Abstract. To use OWL2 for modeling a system design one must be able to construct
More information3 Classifications of ontology matching techniques
3 Classifications of ontology matching techniques Having defined what the matching problem is, we attempt at classifying the techniques that can be used for solving this problem. The major contributions
More informationThe OWL API: An Introduction
The OWL API: An Introduction Sean Bechhofer and Nicolas Matentzoglu University of Manchester sean.bechhofer@manchester.ac.uk OWL OWL allows us to describe a domain in terms of: Individuals Particular objects
More informationTHE FOUNDATIONS OF MATHEMATICS
THE FOUNDATIONS OF MATHEMATICS By: Sterling McKay APRIL 21, 2014 LONE STAR - MONTGOMERY Mentor: William R. Brown, MBA Mckay 1 In mathematics, truth is arguably the most essential of its components. Suppose
More informationFalcon-AO: Aligning Ontologies with Falcon
Falcon-AO: Aligning Ontologies with Falcon Ningsheng Jian, Wei Hu, Gong Cheng, Yuzhong Qu Department of Computer Science and Engineering Southeast University Nanjing 210096, P. R. China {nsjian, whu, gcheng,
More informationEvaluation of Predicate Calculus By Arve Meisingset, retired research scientist from Telenor Research Oslo Norway
Evaluation of Predicate Calculus By Arve Meisingset, retired research scientist from Telenor Research 31.05.2017 Oslo Norway Predicate Calculus is a calculus on the truth-values of predicates. This usage
More informationTowards a Logic of the Ontological Dodecagon
Towards a Logic of the Ontological Dodecagon Giancarlo Guizzardi 1 and Gerd Wagner 2 1 Computer Science Department Federal University of Esprito Santo, Brazil gguizzardi@inf.ufes.br 2 Chair of Internet
More informationOWL 2 Profiles. An Introduction to Lightweight Ontology Languages. Markus Krötzsch University of Oxford. Reasoning Web 2012
University of Oxford Department of Computer Science OWL 2 Profiles An Introduction to Lightweight Ontology Languages Markus Krötzsch University of Oxford Reasoning Web 2012 Remark for the Online Version
More informationLecture 6,
Lecture 6, 4.16.2009 Today: Review: Basic Set Operation: Recall the basic set operator,!. From this operator come other set quantifiers and operations:!,!,!,! \ Set difference (sometimes denoted, a minus
More information8. Relational Calculus (Part II)
8. Relational Calculus (Part II) Relational Calculus, as defined in the previous chapter, provides the theoretical foundations for the design of practical data sub-languages (DSL). In this chapter, we
More informationBasic Elements of Computer Algebra in MIZAR
Basic Elements of Computer Algebra in MIZAR Adam Naumowicz Czeslaw Bylinski Institute of Computer Science University of Bialystok, Poland adamn@math.uwb.edu.pl Section of Computer Networks University of
More informationConsider a description of arithmetic. It includes two equations that define the structural types of digit and operator:
Syntax A programming language consists of syntax, semantics, and pragmatics. We formalize syntax first, because only syntactically correct programs have semantics. A syntax definition of a language lists
More informationToday: RDF syntax. + conjunctive queries for OWL. KR4SW Winter 2010 Pascal Hitzler 3
Today: RDF syntax + conjunctive queries for OWL KR4SW Winter 2010 Pascal Hitzler 3 Today s Session: RDF Schema 1. Motivation 2. Classes and Class Hierarchies 3. Properties and Property Hierarchies 4. Property
More informationLOGIC AND DISCRETE MATHEMATICS
LOGIC AND DISCRETE MATHEMATICS A Computer Science Perspective WINFRIED KARL GRASSMANN Department of Computer Science University of Saskatchewan JEAN-PAUL TREMBLAY Department of Computer Science University
More informationLinked Open Data Cloud. John P. McCrae, Thierry Declerck
Linked Open Data Cloud John P. McCrae, Thierry Declerck Hitchhiker s guide to the Linked Open Data Cloud DBpedia Largest node in the linked open data cloud Nucleus for a web of open data Most data is
More informationUniversity of Huddersfield Repository
University of Huddersfield Repository Olszewska, Joanna Isabelle, Simpson, Ron and McCluskey, T.L. Appendix A: epronto: OWL Based Ontology for Research Information Management Original Citation Olszewska,
More informationSemantic Web Technologies
1/57 Introduction and RDF Jos de Bruijn debruijn@inf.unibz.it KRDB Research Group Free University of Bolzano, Italy 3 October 2007 2/57 Outline Organization Semantic Web Limitations of the Web Machine-processable
More informationmodel (ontology) and every DRS and CMS server has a well-known address (IP and port).
7 Implementation In this chapter we describe the Decentralized Reasoning Service (DRS), a prototype service implementation that performs the cooperative reasoning process presented before. We present also
More informationModeling vs Encoding for the Semantic Web
Modeling vs Encoding for the Semantic Web Werner Kuhn University of Münster Institute for Geoinformatics Münster Semantic Interoperability Lab (MUSIL) Kuhn, W. (2010). Modeling vs encoding for the Semantic
More informationAn Introduction to the Semantic Web. Jeff Heflin Lehigh University
An Introduction to the Semantic Web Jeff Heflin Lehigh University The Semantic Web Definition The Semantic Web is not a separate Web but an extension of the current one, in which information is given well-defined
More informationEnhanced Entity-Relationship (EER) Modeling
CHAPTER 4 Enhanced Entity-Relationship (EER) Modeling Copyright 2017 Ramez Elmasri and Shamkant B. Navathe Slide 1-2 Chapter Outline EER stands for Enhanced ER or Extended ER EER Model Concepts Includes
More informationComputational problems. Lecture 2: Combinatorial search and optimisation problems. Computational problems. Examples. Example
Lecture 2: Combinatorial search and optimisation problems Different types of computational problems Examples of computational problems Relationships between problems Computational properties of different
More informationRESULTS ON TRANSLATING DEFAULTS TO CIRCUMSCRIPTION. Tomasz Imielinski. Computer Science Department Rutgers University New Brunswick, N.
RESULTS ON TRANSLATING DEFAULTS TO CIRCUMSCRIPTION Tomasz Imielinski Computer Science Department Rutgers University New Brunswick, N.J 08905 ABSTRACT In this paper we define different concepts, of translating
More informationSoftware Configuration Management Using Ontologies
Software Configuration Management Using Ontologies Hamid Haidarian Shahri *, James A. Hendler^, Adam A. Porter + * MINDSWAP Research Group + Department of Computer Science University of Maryland {hamid,
More information3.4 Deduction and Evaluation: Tools Conditional-Equational Logic
3.4 Deduction and Evaluation: Tools 3.4.1 Conditional-Equational Logic The general definition of a formal specification from above was based on the existence of a precisely defined semantics for the syntax
More informationOWL a glimpse. OWL a glimpse (2) requirements for ontology languages. requirements for ontology languages
OWL a glimpse OWL Web Ontology Language describes classes, properties and relations among conceptual objects lecture 7: owl - introduction of#27# ece#720,#winter# 12# 2# of#27# OWL a glimpse (2) requirements
More informationCSC 501 Semantics of Programming Languages
CSC 501 Semantics of Programming Languages Subtitle: An Introduction to Formal Methods. Instructor: Dr. Lutz Hamel Email: hamel@cs.uri.edu Office: Tyler, Rm 251 Books There are no required books in this
More informationSemantic Document Architecture for Desktop Data Integration and Management
Semantic Document Architecture for Desktop Data Integration and Management Saša Nešić 1, Dragan Gašević 2, Mehdi Jazayeri 1 1 Faculty of Informatics, University of Lugano, Lugano, Switzerland 2 School
More informationSemantic Web. Semantic Web Services. Morteza Amini. Sharif University of Technology Fall 94-95
ه عا ی Semantic Web Semantic Web Services Morteza Amini Sharif University of Technology Fall 94-95 Outline Semantic Web Services Basics Challenges in Web Services Semantics in Web Services Web Service
More informationSemantics and Generative Grammar. Expanding Our Formalism, Part 2 1. These more complex functions are very awkward to write in our current notation
Expanding Our Formalism, Part 2 1 1. Lambda Notation for Defining Functions A Practical Concern: Most expressions of natural language will have some kind of function as their extension... These more complex
More informationJENA: A Java API for Ontology Management
JENA: A Java API for Ontology Management Hari Rajagopal IBM Corporation Page Agenda Background Intro to JENA Case study Tools and methods Questions Page The State of the Web Today The web is more Syntactic
More informationWeb Ontology for Software Package Management
Proceedings of the 8 th International Conference on Applied Informatics Eger, Hungary, January 27 30, 2010. Vol. 2. pp. 331 338. Web Ontology for Software Package Management Péter Jeszenszky Debreceni
More informationAccessing information about Linked Data vocabularies with vocab.cc
Accessing information about Linked Data vocabularies with vocab.cc Steffen Stadtmüller 1, Andreas Harth 1, and Marko Grobelnik 2 1 Institute AIFB, Karlsruhe Institute of Technology (KIT), Germany {steffen.stadtmueller,andreas.harth}@kit.edu
More informationSemantic Web. Ontology Pattern. Gerd Gröner, Matthias Thimm. Institute for Web Science and Technologies (WeST) University of Koblenz-Landau
Semantic Web Ontology Pattern Gerd Gröner, Matthias Thimm {groener,thimm}@uni-koblenz.de Institute for Web Science and Technologies (WeST) University of Koblenz-Landau July 18, 2013 Gerd Gröner, Matthias
More informationAn Annotated Language
Hoare Logic An Annotated Language State and Semantics Expressions are interpreted as functions from states to the corresponding domain of interpretation Operators have the obvious interpretation Free of
More information4 The StdTrip Process
4 The StdTrip Process 4.1 The a priori Approach As discussed in section 2.8 the a priori approach emphasizes the reuse of widely adopted standards for database design as a means to secure future interoperability.
More information2.1 Sets 2.2 Set Operations
CSC2510 Theoretical Foundations of Computer Science 2.1 Sets 2.2 Set Operations Introduction to Set Theory A set is a structure, representing an unordered collection (group, plurality) of zero or more
More informationMaking Ontology Documentation with LODE
Proceedings of the I-SEMANTICS 2012 Posters & Demonstrations Track, pp. 63-67, 2012. Copyright 2012 for the individual papers by the papers' authors. Copying permitted only for private and academic purposes.
More informationReview Material: First Order Logic (FOL)
Information Integration on the WEB with RDF, OWL and SPARQL Review Material: First Order Logic (FOL) Grant Weddell October 7, 2013 Syntax of FOL Signatures Vocabularies are called signatures in FOL. The
More informationTHE GETTY VOCABULARIES TECHNICAL UPDATE
AAT TGN ULAN CONA THE GETTY VOCABULARIES TECHNICAL UPDATE International Working Group Meetings January 7-10, 2013 Joan Cobb Gregg Garcia Information Technology Services J. Paul Getty Trust International
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
CHAPTER 4 Enhanced Entity-Relationship (EER) Modeling Slide 1-2 Chapter Outline EER stands for Enhanced ER or Extended ER EER Model Concepts Includes all modeling concepts of basic ER Additional concepts:
More informationAppendix 1. Description Logic Terminology
Appendix 1 Description Logic Terminology Franz Baader Abstract The purpose of this appendix is to introduce (in a compact manner) the syntax and semantics of the most prominent DLs occurring in this handbook.
More informationNonstandard Models of True Arithmetic. other models of true arithmetic (the set of sentences true in the standard model) that aren t
Nonstandard Models of True Arithmetic We have talked a lot about the standard model of the language of arithmetic, but there are other models of true arithmetic (the set of sentences true in the standard
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationISO Original purpose and possible future
ISO 15926 Original purpose and possible future Matthew West http://www.matthew-west.org.uk Original Purpose Integration and exchange of plant data throughout the life of the plant Initial focus on the
More informationAppendix 1. Description Logic Terminology
Appendix 1 Description Logic Terminology Franz Baader Abstract The purpose of this appendix is to introduce (in a compact manner) the syntax and semantics of the most prominent DLs occurring in this handbook.
More informationCalculation of extended gcd by normalization
SCIREA Journal of Mathematics http://www.scirea.org/journal/mathematics August 2, 2018 Volume 3, Issue 3, June 2018 Calculation of extended gcd by normalization WOLF Marc, WOLF François, LE COZ Corentin
More informationSemantics via Syntax. f (4) = if define f (x) =2 x + 55.
1 Semantics via Syntax The specification of a programming language starts with its syntax. As every programmer knows, the syntax of a language comes in the shape of a variant of a BNF (Backus-Naur Form)
More informationLinked Data and RDF. COMP60421 Sean Bechhofer
Linked Data and RDF COMP60421 Sean Bechhofer sean.bechhofer@manchester.ac.uk Building a Semantic Web Annotation Associating metadata with resources Integration Integrating information sources Inference
More informationMastro 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
More information