martige-pubs.bib

@inproceedings{DBLP:conf/semweb/Jimenez-RuizKZH15a,
  author = {Ernesto Jim{\'{e}}nez{-}Ruiz and
               Evgeny Kharlamov and
               Dmitriy Zheleznyakov and
               Ian Horrocks and
               Christoph Pinkel and
               Martin G. Skj{\ae}veland and
               Evgenij Thorstensen and
               Jos{\'{e}} Mora},
  title = {BootOX: Bootstrapping {OWL} 2 Ontologies and {R2RML} Mappings from
               Relational Databases},
  booktitle = {Proceedings of the {ISWC} 2015 Posters {\&} Demonstrations Track
               co-located with the 14th International Semantic Web Conference (ISWC-2015),
               Bethlehem, PA, USA, October 11, 2015.},
  year = {2015},
  url = {http://ceur-ws.org/Vol-1486/paper_22.pdf},
  abstract = {In this demo paper we present BOOTOX, a system
                  facilitating ontology and mapping development by
                  their automatic extraction (i.e., bootstrapping)
                  from relational databases.  BOOTOX has a number of
                  advantages: it allows to control the OWL 2 profile
                  of the output ontologies, and to bootstrap complex
                  and provenance mappings, which are beyond the W3C
                  direct mapping specification.  Moreover, BOOTOX
                  allows to import pre-existing ontologies.}
}
@inproceedings{DBLP:conf/semweb/KharlamovJPRSSX15,
  author = {Evgeny Kharlamov and
               Ernesto Jim{\'{e}}nez{-}Ruiz and
               Christoph Pinkel and
               Martin Rezk and
               Martin G. Skj{\ae}veland and
               Ahmet Soylu and
               Guohui Xiao and
               Dmitriy Zheleznyakov and
               Martin Giese and
               Ian Horrocks and
               Arild Waaler},
  title = {Optique: Ontology-Based Data Access Platform},
  booktitle = {Proceedings of the {ISWC} 2015 Posters {\&} Demonstrations Track
               co-located with the 14th International Semantic Web Conference (ISWC-2015),
               Bethlehem, PA, USA, October 11, 2015.},
  year = {2015},
  url = {http://ceur-ws.org/Vol-1486/paper_24.pdf},
  abstract = {Ontology-Based Data Access (OBDA) is an approach to
                  query relational data via a unified semantic access
                  point powered by an ontology that is ‘connected’ to
                  the underlying databases via mappings.  OPTIQUE is
                  an end-to-end OBDA platform. It offers support for
                  semi-automatic bootstrapping of ontologies and
                  mappings from relational databases thus facilitating
                  system deployment, an intuitive interface to pose
                  queries over a deployed system, and a query
                  processing and optimisation module that allows to
                  efficiently answer user queries. In this
                  demonstration attendees will be able to experience
                  OPTIQUE with data from the oil and gas industry and
                  data from the music domain.}
}
@inproceedings{KhEtAl-ISWC2015a,
  author = {Evgeny Kharlamov and
               Dag Hovland and
               Ernesto Jim{\'{e}}nez{-}Ruiz and
               Davide Lanti and
               Hallstein Lie and
               Christoph Pinkel and
               Mart{\'{\i}}n Rezk and
               Martin G. Skj{\ae}veland and
               Evgenij Thorstensen and
               Guohui Xiao and
               Dmitriy Zheleznyakov and
               Ian Horrocks},
  title = {Ontology Based Access to Exploration Data at Statoil},
  booktitle = {The Semantic Web - {ISWC} 2015 - 14th International Semantic Web Conference,
               Bethlehem, PA, USA, October 11-15, 2015, Proceedings, Part {II}},
  pages = {93--112},
  year = {2015},
  url = {http://iswc2015.semanticweb.org/sites/iswc2015.semanticweb.org/files/93670079.pdf},
  doi = {10.1007/978-3-319-25010-6_6},
  abstract = {Ontology Based Data Access (OBDA) is a prominent
                  approach to query databases which uses an ontology
                  to expose data in a conceptually clear manner by
                  abstracting away from the technical schema-level
                  details of the underlying data.  The ontology is
                  ‘connected’ to the data via mappings that allow to
                  automatically translate queries posed over the
                  ontology into data-level queries that can be
                  executed by the underlying database management
                  system. Despite a lot of attention from the research
                  community, there are still few instances of real
                  world industrial use of OBDA systems. In this work
                  we present data access challenges in the
                  data-intensive petroleum company Statoil and our
                  experience in addressing these challenges with OBDA
                  technology. In particular, we have developed a
                  deployment module to create ontologies and mappings
                  from relational databases in a semi-automatic
                  fashion, and a query processing module to perform
                  and optimise the process of translating ontological
                  queries into data queries and their execution. Our
                  modules have been successfully deployed and
                  evaluated for an OBDA solution in Statoil.}
}
@inproceedings{KhEtAl-ISWC2015b,
  author = {Ernesto Jim{\'{e}}nez{-}Ruiz and
               Evgeny Kharlamov and
               Dmitriy Zheleznyakov and
               Ian Horrocks and
               Christoph Pinkel and
               Martin G. Skj{\ae}veland and
               Evgenij Thorstensen and
               Jos{\'{e}} Mora},
  title = {BootOX: Practical Mapping of RDBs to {OWL} 2},
  booktitle = {The Semantic Web - {ISWC} 2015 - 14th International Semantic Web Conference,
               Bethlehem, PA, USA, October 11-15, 2015, Proceedings, Part {II}},
  pages = {113--132},
  year = {2015},
  url = {http://iswc2015.semanticweb.org/sites/iswc2015.semanticweb.org/files/93670095.pdf},
  doi = {10.1007/978-3-319-25010-6_7},
  abstract = {Ontologies have recently became a popular mechanism to
                  expose relational database (RDBs) due to their
                  ability to describe the domain of data in terms of
                  classes and properties that are clear to domain
                  experts. Ontological terms are related to the schema
                  of the underlying databases with the help of
                  mappings, i.e., declarative specifications
                  associating SQL queries to ontological
                  terms. Developing appropriate ontologies and
                  mappings for given RDBs is a challenging and time
                  consuming task. In this work we present BOOTOX, a
                  system that aims at fa- cilitating ontology and
                  mapping development by their automatic extraction
                  (i.e., bootstrapping) from RDBs, and our experience
                  with the use of BOOTOX in industrial and research
                  contexts. BOOTOX has a number of advantages: it
                  allows to control the OWL 2 profile of the output
                  ontologies, bootstrap complex and provenance
                  mappings, which are beyond the W3C direct mapping
                  specification.  Moreover, BOOTOX allows to import
                  pre-existing ontologies via alignment}
}
@phdthesis{Sk-UiO2015,
  author = {Martin G. Skjæveland},
  title = {Engineering Semantic Data},
  school = {University of Oslo},
  year = 2015,
  url = {http://folk.uio.no/martige/phd/}
}
@incollection{PiBiJiEtAl-ESWC2015,
  year = 2015,
  isbn = {978-3-319-18817-1},
  booktitle = {The Semantic Web. Latest Advances and New Domains},
  volume = 9088,
  series = {LNCS},
  editor = {Gandon, Fabien and Sabou, Marta and Sack, Harald and
                  d’Amato, Claudia and Cudré-Mauroux, Philippe and
                  Zimmermann, Antoine},
  doi = {10.1007/978-3-319-18818-8_2},
  title = {RODI: A Benchmark for Automatic Mapping Generation
                  in Relational-to-Ontology Data Integration},
  url = {http://dx.doi.org/10.1007/978-3-319-18818-8_2},
  publisher = {Springer International Publishing},
  author = {Pinkel, Christoph and Binnig, Carsten and
                  Jiménez-Ruiz, Ernesto and May, Wolfgang and Ritze,
                  Dominique and Skjæveland, Martin G. and Solimando,
                  Alessandro and Kharlamov, Evgeny},
  pages = {21-37},
  abstract = {A major challenge in information management today is
                  the integration of huge amounts of data distributed
                  across multiple data sources. A suggested approach
                  to this problem is ontology-based data integration
                  where legacy data systems are integrated via a
                  common ontology that represents a unified global
                  view over all data sources. However, data is often
                  not natively born using these ontologies. Instead,
                  much data resides in legacy relational
                  databases. Therefore, mappings that relate the
                  legacy relational data sources to the ontology need
                  to be constructed. Recent techniques and systems
                  that automatically construct such mappings have been
                  developed. The quality metrics of these systems are,
                  however, often only based on self-designed
                  benchmarks. This paper introduces a new publicly
                  available benchmarking suite called RODI, which is
                  designed to cover a wide range of mapping challenges
                  in Relational-to-Ontology Data Integration
                  scenarios. RODI provides a set of different
                  relational data sources and ontologies (representing
                  a wide range of mapping challenges) as well as a
                  scoring function with which the performance of
                  relational-to-ontology mapping construction systems
                  may be evaluated.}
}
@article{SkGiHoEtAl-JWS2015,
  title = {Engineering ontology-based access to real-world data
                  sources},
  journal = {Web Semantics: Science, Services and Agents on the
                  World Wide Web},
  volume = 33,
  pages = {112--140},
  year = 2015,
  issn = {1570-8268},
  url = {http://dx.doi.org/10.1016/j.websem.2015.03.002},
  doi = {10.1016/j.websem.2015.03.002},
  author = {Martin G. Skjæveland and Martin Giese and Dag
                  Hovland and Espen H. Lian and Arild Waaler},
  abstract = {The preparation of existing real-world datasets for
                  publication as high-quality semantic web data is a
                  complex task that requires the concerted execution
                  of a variety of processing steps using a range of
                  different tools. Faced with both changing input data
                  and evolving requirements on the produced output, we
                  face a significant engineering task for schema and
                  data transformation. We argue that to achieve a
                  robust and flexible transformation process, a
                  high-level declarative description is needed, that
                  can be used to drive the entire tool chain. We have
                  implemented this idea for the deployment of
                  ontology-based data access (OBDA) solutions, where
                  semantically annotated views that integrate multiple
                  data sources on different formats are created, based
                  on an ontology and a collection of
                  mappings. Furthermore, we exemplify our approach and
                  show how a single declarative description helps to
                  orchestrate a complete tool chain, beginning with
                  the download of datasets, and through to the
                  installation of the datasets for a variety of tool
                  applications, including data and query
                  transformation processes and reasoning services. Our
                  case study is based on several publicly available
                  tabular and relational datasets concerning the
                  operations of the petroleum industry in Norway. We
                  include a discussion of the relative performance of
                  the used tools on our case study, and an overview of
                  lessons learnt for practical deployment of OBDA
                  on real-world datasets. }
}
@inproceedings{SkLi-NIK2013,
  author = {Martin G. Skj{\ae}veland and Espen H. Lian},
  title = {{Benefits of Publishing the Norwegian Petroleum
                  Directorate's FactPages as Linked Open Data}},
  booktitle = {Norsk informatikkonferanse (NIK 2013)},
  year = 2013,
  publisher = {Tapir},
  url = {SkLi-NIK2013.pdf},
  keywords = {optique-project},
  abstract = {This paper presents the benefits from publishing the
                  Norwegian Petroleum Directorate’s FactPages, a
                  public and popular, freely available dataset, into
                  semantically annotated and query enabled five star
                  linked open data. We discuss and illustrate the
                  added value of publishing open datasets on the Web
                  using web standards, semantic web technologies and
                  best practices---contrasted to the lesser suited,
                  but more traditional methods—and offer advice to
                  data providers on how to achieve these benefits.},
  presentation = {SkLi-NIK2013_presentation.pdf}
}
@inproceedings{KhGiJiEtAl-ISWC2013,
  author = {Evgeny Kharlamov and Martin Giese and Ernesto
                  Jim{\'e}nez-Ruiz and Martin G. Skj{\ae}veland and
                  Ahmet Soylu and Dmitriy Zheleznyakov and Timea
                  Bagosi and Marco Console and Peter Haase and Ian
                  Horrocks and Sarunas Marciuska and Christoph Pinkel
                  and Mariano Rodriguez-Muro and Marco Ruzzi and
                  Valerio Santarelli and Domenico Fabio Savo and Kunal
                  Sengupta and Michael Schmidt and Evgenij Thorstensen
                  and Johannes Trame and Arild Waaler},
  title = {{Optique 1.0: Semantic Access to Big Data: The Case
                  of Norwegian Petroleum Directorate's FactPages}},
  booktitle = {International Semantic Web Conference (Posters {\&}
                  Demos)},
  year = 2013,
  pages = {65-68},
  url = {http://ceur-ws.org/Vol-1035/iswc2013_demo_17.pdf},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  publisher = {CEUR-WS.org},
  series = {CEUR Workshop Proceedings},
  volume = 1035,
  poster = {http://www.iswc2013.semanticweb.org/sites/default/files/iswc_demo_17_poster.pdf},
  abstract = {The Optique project aims at developing an end-to-end
                  system for semantic data access to Big Data in
                  industries such as Statoil ASA and Siemens AG. In
                  our demonstration we present the first version of
                  the Optique system customised for the Norwegian
                  Petroleum Directorate's FactPages, a publicly
                  available dataset relevant for engineers at Statoil
                  ASA. The system provides different options,
                  including visual, to formulate queries over
                  ontologies and to display query answers. Optique 1.0
                  offers installation wizards that allow to extract
                  ontologies from relational schemata, extract and
                  define mappings connecting ontologies and schemata,
                  and align and approximate ontologies. Moreover, the
                  system offers highly optimised techniques for query
                  answering.}
}
@inproceedings{SoSkGiEtAl-MTSR2013,
  author = {Ahmet Soylu and Martin G. Skj{\ae}veland and Martin
                  Giese and Ian Horrocks and Ernesto Jim\'enez-Ruiz
                  and Evgeny Kharlamov and Dmitriy Zheleznyakov},
  title = {{A Preliminary Approach on Ontology-based Visual
                  Query Formulation for Big Data}},
  year = 2013,
  booktitle = {Metadata and Semantics Research---7th Research
                  Conference, MTSR 2013, Thessaloniki, Greece,
                  November 19-22, 2013. Proceedings},
  editor = {Garoufallou, Emmanouel and Greenberg, Jane},
  volume = 390,
  pages = {201-212},
  publisher = {Springer-Verlag},
  url = {http://www.ahmetsoylu.com/wp-content/uploads/2013/10/soylu_mtsr2013.pdf},
  abstract = {Data access in an enterprise setting is a
                  determining factor for the potential of value
                  creation processes such as sense-making, decision
                  making, and intelligence analysis. As such,
                  providing friendly data access tools that directly
                  engage domain experts (i.e., end-users) with data,
                  as opposed to the situations where database/IT
                  experts are required to extract data from databases,
                  could substantially increase competitiveness and
                  profitability.  However, the ever increasing volume,
                  complexity, velocity, and variety of data, known as
                  the Big Data phenomenon, renders the end-user data
                  access problem even more challenging. Optique, an
                  ongoing European project with a strong industrial
                  perspective, aims to countervail the Big Data
                  effect, and to enable scalable end-user data access
                  to traditional relational databases by using an
                  ontology-based approach. In this paper, we
                  specifically present the preliminary design and
                  development of our ontology-based visual query
                  system and discuss directions for addressing the Big
                  Data effect.}
}
@inproceedings{SkSt-COLD2013,
  author = {Martin G. Skj{\ae}veland and Audun Stolpe},
  title = {{Bounds: Expressing Reservations about Incoming
                  Data}},
  year = 2013,
  booktitle = {Proceedings of the Fourth International Workshop on
                  Consuming Linked Data, COLD 2013, Sydney, Australia,
                  October 22, 2013},
  editor = {Olaf Hartig and Juan Sequeda and Aidan Hogan and
                  Takahide Matsutsuka},
  volume = 1034,
  publisher = {CEUR-WS.org},
  series = {CEUR Workshop Proceedings},
  url = {http://ceur-ws.org/Vol-1034/SkjaevelandAndStolpe_COLD2013.pdf},
  abstract = {This paper introduces the Boundz vocabulary, an RDF
                  vocabulary for expressing reservations about
                  incoming data. We argue that the need for such a
                  vocabulary is real and pressing, and that it is a
                  useful validation tool for any recipient of RDF data
                  that wishes to formulate restrictions on amendments
                  in terms of the data it is already holding.  The
                  Boundz vocabulary has a simple mathematical theory
                  that can be expressed in terms of bounded
                  homomorphisms between RDF graphs. We present the
                  basics of this theory, and show that bounded
                  homomorphisms implement conservative extensions over
                  a restricted class of ontology languages, but can
                  also prevent cases of ontology hijacking. We
                  additionally present a prototype implementation with
                  promising evaluation results.},
  presentation = {SkSt-COLD2013_presentation.pdf}
}
@inproceedings{SkLiHo-ISWC2013,
  author = {Martin G. Skj{\ae}veland and Espen H. Lian and Ian
                  Horrocks},
  title = {{Publishing the Norwegian Petroleum Directorate's
                  FactPages as Semantic Web Data}},
  year = 2013,
  booktitle = {The Semantic Web -- ISWC 2013},
  editor = {Alani, Harith and Kagal, Lalana and Fokoue, Achille
                  and Groth, Paul and Biemann, Chris and Parreira,
                  JosianeXavier and Aroyo, Lora and Noy, Natasha and
                  Welty, Chris and Janowicz, Krzysztof},
  series = {LNCS},
  volume = 8219,
  pages = {162-177},
  publisher = {Springer Berlin Heidelberg},
  partneroptique = {UiO},
  abstract = {This paper motivates, documents and evaluates the
                  process and results of converting the Norwegian
                  Petroleum Directorate's FactPages, a well-known and
                  diverse set of tabular data, but with little and
                  incomplete schema information, stepwise into other
                  representations where in each step more semantics is
                  added to the dataset. The different representations
                  we consider are a regular relational database, a
                  linked open data dataset, and an ontology. For each
                  conversion step we explain and discuss necessary
                  design choices which are due to the specific shape
                  of the dataset, but also those due to the
                  characteristics and idiosyncrasies of the
                  representation formats. We additionally evaluate the
                  output, performance and cost of querying the
                  different formats using questions provided by users
                  of the FactPages.},
  url = {SkLiHo-ISWC2013.pdf},
  presentation = {SkLiHo-ISWC2013_presentation.pdf}
}
@misc{SkSt-W3C2013,
  author = {Martin G. Skj{\ae}veland and Audun Stolpe},
  title = {{Bounds: Expressing Reservations about Incoming
                  Data}},
  year = 2013,
  note = {Position paper for W3C's RDF Validation
                  Workshop---Practical Assurances for Quality RDF
                  Data, 10--11 September 2013, Cambridge, MA, USA},
  url = {https://www.w3.org/2001/sw/wiki/images/5/55/RDFVal_Skj%C3%A6veland_Stolpe.pdf},
  presentation = {http://www.w3.org/2001/sw/wiki/images/e/e5/MSkjaeveland_w3c-rdfval2013.pdf},
  abstract = {This position paper presents generic constraints
                  useful for expressing dependencies between source
                  and target datasets in situations where the source
                  is to be merged into the target and the target is
                  particular with what data it is willing to
                  accept. These constraints, which we call bounds, are
                  based only on the graph-like triple structure of RDF
                  graphs and draws ideas from of bisimulation from
                  modal logic, conservative extensions of ontologies,
                  and relational peer database exchange. Although
                  simple and generic, bounds still have powerful and
                  practical natural interpretations, and favorable
                  computational properties. An RDF vocabulary for
                  expressing, publishing, and re-using bounds is
                  available, together with an evaluated prototype
                  implementation for checking such constraints.}
}
@techreport{SkSt-UIO2012,
  author = {Martin G. Skj{\ae}veland and Audun Stolpe},
  title = {{Bounded RDF Data Transformations}},
  institution = {University of Oslo},
  year = 2012,
  url = {http://urn.nb.no/URN:NBN:no-32194},
  abstract = {RDF data transformations are transformations of RDF
                  graphs to RDF graphs which preserve in different
                  degree the data content in the source to the
                  target. These transformation therefore give special
                  attention to the data elements in such
                  graphs---under the assumption that data elements
                  reside in the subjects and objects of RDF triples,
                  and the peculiar fact that the set of vertices and
                  set of edges in an RDF graph are not necessarily
                  disjoint. Bounded homomorphisms are used to define
                  these transformations, which not only ensure that
                  data from the source is structurally preserved in
                  the target, but also require, in various ways, the
                  target data to be related back to the source. The
                  result of this paper is a theoretical toolkit of
                  transformation characteristics with which detailed
                  control over the transformation target may be
                  exercised. We explore these characteristics in two
                  different RDF graph representations, and give an
                  algorithm for checking existence of
                  transformations.}
}
@inproceedings{StSk-ESWC2012,
  author = {Audun Stolpe and Martin G. Skj{\ae}veland},
  title = {{Preserving Information Content in RDF Using Bounded
                  Homomorphisms}},
  editor = {Elena Simperl and Philipp Cimiano and Axel Polleres
                  and {\'O}scar Corcho and Valentina Presutti},
  booktitle = {ESWC},
  publisher = {Springer},
  series = {LNCS},
  volume = 7295,
  year = 2012,
  pages = {72-86},
  presentation = {StSk-ESWC2012presentation.pdf},
  abstract = {The topic of study in the present paper is the class
                  of RDF homomorphisms that substitute one predicate
                  for another throughout a set of RDF triples, on the
                  condition that the predicate in question is not also
                  a subject or object. These maps turn out to be
                  suitable for reasoning about similarities in
                  information content between two or more RDF
                  graphs. As such they are very useful e.g. for
                  migrating data from one RDF vocabulary to
                  another. In this paper we address a particular
                  instance of this problem and try to provide an
                  answer to the question of when we are licensed to
                  say that data is being transformed, reused or merged
                  in a non-distortive manner. We place this problem in
                  the context of RDF and Linked Data, and study the
                  problem in relation to SPARQL construct queries.}
}
@misc{StSk-exESWC2012,
  author = {Audun Stolpe and Martin G. Skj{\ae}veland},
  title = {{Preserving Information Content in RDF using Bounded
                  Homomorphisms (Extended Version)}},
  year = 2012,
  url = {StSk-exESWC2012.pdf},
  note = {Extended version of paper published in proceedings
                  of ESWC 2012}
}
@incollection{Sk-ESWC2015,
  author = {Martin G. Skj{\ae}veland},
  title = {{Sgvizler: A JavaScript Wrapper for Easy
                  Visualization of SPARQL Result Sets}},
  year = 2015,
  volume = 7540,
  series = {LNCS},
  isbn = {978-3-662-46640-7},
  booktitle = {The Semantic Web: ESWC 2012 Satellite Events},
  editor = {Simperl, Elena and Norton, Barry and Mladenic, Dunja
                  and Della Valle, Emanuele and Fundulaki, Irini and
                  Passant, Alexandre and Troncy, Raphaël},
  publisher = {Springer Berlin Heidelberg},
  pages = {361-365},
  url = {http://2012.eswc-conferences.org/sites/default/files/eswc2012_submission_303.pdf},
  poster = {http://sgvizler.googlecode.com/svn/www/eswc2012poster.pdf},
  abstract = {Sgvizler is a small JavaScript wrapper for
                  visualization of SPARQL results sets. It integrates
                  well with HTML web pages by letting the user specify
                  SPARQL SELECT queries directly into designated HTML
                  elements, which are rendered to contain the specifed
                  visualization type on page load or on function
                  call. Sgvizler supports a vast number of
                  visualization types, most notably all of the major
                  charts available in the Google Chart Tools, but also
                  by allowing users to easily modify and extend the
                  set of rendering functions, e.g., specifed using
                  direct DOM manipulation or external JavaScript
                  visualization tool-kits. Sgvizler is compatible with
                  all modern web browsers.}
}
@inproceedings{StSk-NIK2011,
  author = {Audun Stolpe and Martin G. Skj{\ae}veland},
  title = {{From Spreadsheets to 5-star Linked Data in the
                  Cultural Heritage Domain: A Case Study of the Yellow
                  List}},
  booktitle = {Norsk informatikkonferanse (NIK 2011)},
  pages = {13--24},
  year = 2011,
  publisher = {Tapir},
  url = {http://www.nik.no/2011/1-2-stolpe11FromSpreadSheetsTo5-star.pdf},
  abstract = {This paper presents the results and lessons learnt
                  from converting the Cultural Heritage Management
                  Office in Oslo's Yellow List of architecturally and
                  culturally valuable buildings into a Linked Data
                  server. The study was performed in the context of
                  the Semicolon II project, as a foray into the more
                  general problem of lifting public sector
                  information. The paper argues, that whilst the
                  benefits of adopting the Linked Data distribution
                  model are many and important, the required
                  transformation to RDF is not
                  unproblematic. Specifically, one needs to ensure
                  that the information content of a dataset is
                  preserved undistorted despite the change of
                  representation. This can not be assumed to be the
                  case by default, since a transformation will often
                  alter the very structure of the dataset. The paper
                  draws attention to the concept of a bounded RDF
                  homomorphism as a means to address this problem.}
}
@misc{StSk-ISWC2011,
  author = {Audun Stolpe and Martin G. Skj{\ae}veland},
  title = {{Conservative Repurposing of RDF Data}},
  year = 2011,
  note = {Poster paper},
  howpublished = {10th Int. Semantic Web Conference, published on
                  conference website},
  url = {http://iswc2011.semanticweb.org/fileadmin/iswc/Papers/PostersDemos/iswc11pd_submission_45.pdf},
  poster = {StSk-ISWC2011poster.pdf},
  presentation = {StSk-ISWC2011posterpresentation.pdf},
  abstract = {The dawning of the age of the data oriented Web
                  presents us with the challenge of assessing and
                  ensuring the integrity of data across repeated
                  cycles of reuse. Public sector information is a case
                  in point: Whilst the political pressure for reusable
                  public sector information is building momentum,
                  governments as authoritative sources of information
                  on the Web need to take steps to ensure that the
                  primary nature of its information is maintained by
                  consumers. The present paper is concerned with one
                  aspect of this problem, namely the question of when
                  we are licensed to say that data is being
                  transformed, reused or merged in a non-distortive
                  manner. Although inherently more general, we shall
                  place this problem in the context of RDF and Linked
                  Data, and study the problem in relation to the
                  principal means of data repurposing that this stack
                  of technologies offers, i.e. SPARQL construct
                  queries.}
}
@misc{KlSkVa-W3C2008,
  author = {Johan W. Kl{\"u}wer and Martin G. Skj{\ae}veland and
                  Magne Valen-Sendstad},
  title = {{ISO 15926 templates and the Semantic Web}},
  note = {Position paper for W3C Workshop on Semantic Web in
                  Energy Industries; Part I: Oil and Gas},
  year = 2008,
  url = {http://www.w3.org/2008/11/ogws-papers/kluwer.pdf}
}
@mastersthesis{Sk-UIO2006,
  author = {Martin G. Skj{\ae}veland},
  title = {{Free-Variable Calculi for the Modal Logics K45 and
                  S5 --- Extended to the Logic of Only Knowing}},
  school = {University of Oslo},
  year = 2006,
  url = {http://hdl.handle.net/10852/9526},
  abstract = {This thesis presents a free-variable sequent calculi
                  for the modal logics K45, S5 and the logic of Only
                  Knowing. Labels act as placeholders for points in
                  models, using label variables to postpone the choice
                  of point until more knowledge of a putative
                  satisfying model is gathered, allowing a least
                  commitment search. The relation of contextually
                  equivalents is used to obtain variable-sharing
                  derivations baring tight connections to matrix
                  systems and the goal directed Connection calculus. A
                  system of indexed formulae is employed to enforce
                  reuse of label parameters, establishing an upper
                  bound for the search space. The calculus of the
                  logic of Only Knowing is defined by combining the
                  calculi established for K45 and S5, and utilizing an
                  auxiliary derivation to test models for maximality.}
}

This file was generated by bibtex2html 1.97.