<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Towards a Uniform User Interface for Editing Data Shapes</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ben De Meester</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pieter Heyvaert</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anastasia Dimou</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ruben Verborgh</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>IDLab, Department of Electronics and Information Systems, Ghent University - imec</institution>
        </aff>
      </contrib-group>
      <fpage>13</fpage>
      <lpage>24</lpage>
      <abstract>
        <p>Data quality is an important factor for the success of the envisaged Semantic Web. As machines are inherently intolerant at the interpretation of unexpected input, low quality data produces low quality results. Recently, constraint languages such as SHACL were proposed to assess the quality of data graphs, decoupled from the use case and the implementation. However, these constraint languages were designed with machine-processability in mind. Defining data shapes requires knowledge of the language's syntax - usually RDF - and specification, which is not straightforward for domain experts, as they are not Semantic Web specialists. The notion of constraint languages is very recent: the W3C Recommendation for SHACL was finalized in 2017. Thus, user interfaces that enable domain experts to intuitively define such data shapes are not thoroughly investigated yet. In this paper, we present a non-exhaustive list of desired features to be supported by a user interface for editing data shapes. These features are applied to unSHACLed: a prototype interface with SHACL as its underlying constraint language. For specifying the features, we aligned existing work of ontology editing and linked data generation rule editing with data shape editing, and applied them using a drag-and-drop interface that combines data graph and data shape editing. This work can thus serve as a starting point for data shape editing interfaces.</p>
      </abstract>
      <kwd-group>
        <kwd>Data Graph Validation</kwd>
        <kwd>Data Shapes</kwd>
        <kwd>SHACL</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        High quality Linked Data is an important factor for the success of the envisaged
Semantic Web. As machines are inherently intolerant at the interpretation of
unexpected input, low quality data produces low quality results. In the context of
Linked Data, data quality can be measured by assessing the data graph – represented
using the Resource Description Framework (RDF) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] – against a set of
constraints [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. This set of constraints forms the data shape. When it is assessed that
the data graph does not adhere to the data shape, a set of constraint violations is
returned. These constraint violations in turn can guide a user how to refine the data
graph, and thus, improve its quality. For example, for a certain use case, an important
set of constraints of the data graph is that every person has a first name, last name,
and birth date specified. When a data graph describing people that contains a person
without first name is assessed, a constraint violation is returned pointing to that
person. By adding the first name, the data graph is of higher quality for that use case.
      </p>
      <p>
        Ease of editing of the data shape is important. As quality is commonly defined as
“fitness for use” [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], data shapes can be different for different use cases; thus, data
shapes need to be easily editable. Hard-coded validation approaches – as opposed to
declarative approaches – are not easily editable, as each change of the data shape
would require a new development cycle of the software tool [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Recently, constraint
languages were proposed as a declarative means to define data shapes: this eases
editing as it decouples the definition of the data shapes from the implementations that
validate data graphs. Of these constraint languages, the Shapes Constraints
Language (SHACL) became a W3C Recommendation in 2017 [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Constraint
languages allow domain experts – that are familiar with the use case at hand – to
define the data shapes, and modify these at any time, without making changes in the
implementation of the validation tool.
      </p>
      <p>
        However, constraint languages were designed with machine-processability in mind.
Similarly to manually editing other declarative, machine-processable rules –
e.g., rules for linked data generation using the RDB to RDF Mapping
Language (R2RML) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] –, manually editing data shapes using declarative constraint
languages requires a substantial amount of human effort [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. When data shapes cannot
be created and edited easily, uptake of using data shapes and thus improving the
quality of data graphs might be inhibited: intuitive user interfaces are needed. As
constraint languages for describing Linked Data quality are only recently being
standardized, features for user interfaces that enable domain experts to intuitively
define such data shapes, are not thoroughly investigated yet.
      </p>
      <p>In this paper, we introduce a non-exhaustive list of desired features for a user
interface for editing data shapes. They are addressed by a data shape editor, which
aims to support domain experts to improve Linked Data quality. After discussing the
related work at Section 2, we list our features at Section 3. We show how these
features were applied to the unSHACLed editor at Section 4. Finally, we conclude at
Section 5.</p>
    </sec>
    <sec id="sec-2">
      <title>2 Related Work</title>
      <p>After discussing how data shapes are commonly defined (Subsection 2.1), we discuss
Semantic Web editors and their interfaces (Subsection 2.2). We close at
Subsection 2.3.</p>
      <sec id="sec-2-1">
        <title>2.1 Defining Data Shapes</title>
        <p>
          Firstly, ontologies were interpreted as integrity constraints [8, 9]. However, as the
semantics of ontologies operate under the Open World Assumption, and the semantics
of data shapes under the Closed World Assumption, this requires an alternative
interpretation of the existing semantics of ontology languages [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ], e.g., the Web
Ontology Language (OWL) [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. Then, query-based approaches, such as
RDFUnit [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], emerged where data shapes are defined using SPARQL queries. Finally,
more generic constraint languages were defined, such as Shape
Expressions (ShEx) [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] and SHACL [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. These constraint languages provide a
declarative approach for defining data shapes without creating ambiguous semantics
for ontologies. There exist more than eighty different types of constraints [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], where
each constraint language supports a subset of these constraint types [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2 Editors</title>
        <p>
          No extensive research was conducted into features for editing data shapes so far,
given the very recent standardization of constraint languages for Linked Data.
However, we argue that existing work into visualizing other types of RDF structures
is also relevant, namely, (i) ontology editors, and (ii) editors for Linked Data
generation rules. On the one hand, we can take ontology editors into account, similar
as to related work where ontologies are interpreted as integrity constraints. On the
other hand, editors for Linked Data generation rules are also related to data shape
editors: both define the shape of the data graph; however, they have different
directions [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. For Linked Data generation rules, the data graph is the target: the
generation rules define the data graph. For constraint languages, the data graph is the
source: the constraints limit the data graph. Thus, besides only discussing the existing
work around constraint editors, we also discuss ontology editors and Linked Data
generation rules editors.
        </p>
        <p>
          Data Shape Editors Textual data shape editors such as SHACL4P [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] – a textual
editor as plug-in for Protégé – are not intuitive for editing data shapes [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. Defining
data shapes requires knowledge of the syntax – usually RDF – and the specification of
the constraint language. This is not straightforward for domain experts as they are not
necessarily Semantic Web specialists. Other data shape editors such as the work of
Şimşek et al. for validating Schema.org annotations [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], are typically form-based or
use-case specific. Form-based approaches enforce a linear workflow and thus hinder
the user to keep an overview of the relation between the data graph and data shapes
during editing. Use-case specific approaches are not reusable and depend on a specific
constraint language.
        </p>
        <p>
          Ontology Editors Visual ontology editors have largely been divided into three
groups: graph-based, indented-tree-based [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], and UML-based. Graph-based visual
notations and implementations for OWL include Graffoo [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] and AVOnEd [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ].
Indented tree-based editors include the Protégé OWL plugin [21], the editor of the
NeOn Toolkit [22], Eddy [23] with Graphol [
          <xref ref-type="bibr" rid="ref21">24</xref>
          ] as visual notation, and TopBraid
Enterprise Vocabulary Net. In general, the indented-tree-based visualization is
perceived more organized and familiar to novice users, whilst the graph-based
visualization is perceived to be more controllable and intuitive without visual
redundancy, particularly for ontologies with multiple inheritance [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. UML-based
editors include OWLGrEd [
          <xref ref-type="bibr" rid="ref22">25</xref>
          ], Menthor that uses OntoUML [
          <xref ref-type="bibr" rid="ref23">26</xref>
          ] as visual notation
that can be seen as an abstraction over, a.o., OWL, and the work by De Paepe et al. [
          <xref ref-type="bibr" rid="ref24">27</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>Linked Data Generation Rule Editors</title>
        <p>
          Editors for Linked Data generation rules can largely be divided into two groups:
formbased, and graph-based. An alternative graphical user interface using a block
metaphor to edit Linked Data generation rules is Juma [
          <xref ref-type="bibr" rid="ref25">28</xref>
          ]. Form-based
approaches [7, 29] – just as for data shape editors – enforce a linear workflow and
hinder keeping an overview during editing. Graph-based approaches includes
SQuaRE [
          <xref ref-type="bibr" rid="ref27">30</xref>
          ], Map-On [
          <xref ref-type="bibr" rid="ref28">31</xref>
          ], and the RMLEditor [
          <xref ref-type="bibr" rid="ref29">32</xref>
          ]. Heyvaert et al. proposed a set
of desired features for linked data generation rules editors [
          <xref ref-type="bibr" rid="ref30">33</xref>
          ], namely: (R1)
independent of the underlying linked data generation rules language, (R2) support
multiple data sources, (R3) support heterogeneous data formats, (R4) support
multiple ontologies, (R5) support multiple alternative modeling approaches, (R6)
support non-linear workflows, and (R7) independent of mapping execution. These
features helped guide the interface of the RMLEditor, which was evaluated to be
better than related editors during a user study [
          <xref ref-type="bibr" rid="ref29">32</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>2.3 Discussion</title>
        <p>An intuitive and use-case independent solution is lacking: current data shape editing
approaches either depend on the constraint language or enforce a linear workflow.
This leads to two features: Independence of constraint language and Non-linear
workflows. For applying these features to a visual editor, we can observe that on the
one hand, constraint languages have following overlapping semantic constructs: (i)
the data graph, (ii) the data shape, and (iii) the returning constraint violations (when
available). On the other hand, graph-based visualizations are the most widely used
across all editing approaches.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3 Desired Features for Data Shape Editing</title>
      <p>
        In this section, we list the desired features for data shape editors. We extend the
features extracted from the related work by adapting the features for linked data
generation rules editors as proposed by Heyvaert et al. [
        <xref ref-type="bibr" rid="ref30">33</xref>
        ]. We adapt these features
given previously researched parallels between ontologies and data shapes on the one
hand, and between ontologies and linked data generation rules on the other hand.
F1. Independence of constraint language Data shape editors should not confront
domain experts with writing the textual syntax of a specific constraint language:
domain experts are not necessarily Semantic Web experts, and constraint languages
are built with machine-processability in mind. For instance, writing Turtle files to
describe data shapes would be a laborious process for domain experts. Moreover, the
visualization of the constraints should be independent of the underlying constraint
language: generic (graphical) symbols can be used to (partially) hide
languagespecific textual syntax, as constraint languages have overlapping semantic constructs.
F2. Support multiple data sources Data shape editors should support domain
experts in defining data shapes referring to multiple data sources at the same time.
Since Linked Data is commonly used as an integration approach, the data that is
needed for a specific use case might originate from multiple data sources. For
instance, two data graphs contain information about employees and projects,
respectively. Defining the data shape of the connection between employees and their
corresponding projects is only possible when definitions can be specified across the
two data sources.
      </p>
      <p>F3. Support different serializations Data shape editors should not restrict domain
experts to specific serializations of the data source nor the constraint language. A data
graph can be serialized in different ways without changing the actual data or structure
(e.g., RDF/XML vs Turtle). Moreover, a data shape constraints the data model and not
the format. This is adapted from Heyvaert’s original definition, as the scope of our
work is Linked Data validation. As opposed to Linked Data generation, no different
data formats need to be supported.</p>
      <p>
        F4. Support multiple ontologies Data shape editors should support domain experts
in defining data shapes for data graphs annotated with multiple ontologies at the same
time. Complementary or overlapping ontologies are available, and different use cases
require different ontologies. For instance, a user’s friends are described with foaf, and
his interests with schema.org. Depending on the use case, data shapes are needed for
only the foaf-annotations, only the schema.org-annotations, or the combination of the two.
F5. Multiple alternative modeling approaches Data shape editors should enable
and support multiple alternative modeling approaches and allow domain experts to
choose the most adequate one for their needs. Two modeling approaches are put
forward, given that a validation assessment is related to both the data graph and the
data shape. Either (i) define a data shape based on a predetermined model of a use
case, and afterwards validate a data graph (model-driven, e.g., a description is given
that “every user needs a birthdate”), or (ii) define a data shape corresponding to a
given a data graph, (data-driven, e.g., an example is given of a valid data graph
describing a user). This requirement is adapted from Pinkel et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], given the
parallels between ontologies and linked data generation rules.
      </p>
      <p>F6. Non-linear workflows Data shape editors should allows domain experts to
keep an overview of the relationship between the data graph and data shapes, by
providing non-linear editing. Defining data shapes involves multiple factors – the use
case at hand, data graphs, and data shapes – that have an influence on each other. A
linear workflow separates these factors and obscures their relationships, by using
ordered steps that need to be followed by the domain experts. For instance, when
adding constraints to the data shape, domain experts might find that either the data
graph has violations, or the data shape is wrongly defined. The non-linear workflow
allows to integrate information about the data graph into the data shape without the
need to redo (parts of) the definition process.</p>
      <p>F7. Independence of execution Data shape editors should allow importing and
exporting the data shapes specified by the domain experts, as editing data shapes lies
beyond the scope of their execution. Further processing or execution – outside the
data shape editor – improves the data shapes’ interoperability and reusability. For
instance, when the data shapes are created locally using an editor, they can be
executed on a server without further need of the editor.
In this section, we show the feasibility of supporting all proposed features by applying
them to unSHACLed, which we introduce in Subsection 4.1. Then, we elaborate on
how each desired feature is supported by unSHACLed in Subsection 4.2. A screencast
demonstrating unSHACLed can be found at https://
w3id.org/imec/unshacled/screencast/voila2018, a working demo is available at https://
w3id.org/imec/unshacled/app, and the source code can be found on https://
github.com/dubious-developments/UnSHACLed.</p>
      <sec id="sec-3-1">
        <title>4.1 unSHACLed</title>
        <p>We present unSHACLED: a prototype interface for a visual data shape editor
configured to use SHACL as underlying constraint language. In unSHACLed, domain
experts are able to drag-and-drop loaded data graphs, loaded data shapes, and add data
shapes using templates. They can edit both the data graphs and data shapes based on
visual feedback on whether the loaded data graphs conform with the data shapes, and
export the resulting data shape. Its User Interface (UI) consists of three elements (see
Fig. 1): an Overview Sidebar (Fig. 1, a), an Action Toolbar (Fig. 1, b), and an Editing
Area (Fig. 1, c).
Overview Sidebar The Overview Sidebar shows a set of templates for data shapes.
Templates can be added: certain structures are more likely to occur, depending on the
context in which the editor is used. As unSHACLed is configured for editing data
shapes using SHACL, the default templates are currently Node shapes or Property
shapes (constraining resources or the relations(s) between resources, respectively).
Action Toolbar The Action Toolbar consists of two rows: general application
actions, and specific editing area actions. General application
actions include importing and exporting data graphs and data shapes (either from
local or remote files, or synced with your GitHub account) into the current workspace
– visible in the Editing Area –, and user management. Editing area actions include
zooming in and out, under/redo, removing definitions, taking a screenshot, and
executing the validation assessment.</p>
        <p>Editing Area The Editing Area provides a visual drag-and-drop interface for
managing, connecting, and editing data shapes (Fig. 1, d). We chose a graph-based
interface, due to its widespread usage across editing approaches. Each resource within
either a data graph or data shape is depicted using a diagrammatic symbol: a rectangle
with colored header. There is a visual distinction between the data graph and the data
shapes via different colors for the resource rectangle’s header. For editing the
individual constraint rules (Fig. 1, e), each rectangle contains an editable list of rules
in the form of text fields.</p>
        <p>
          Text fields are used, as there exist more than eighty different types of
constraints [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], where each constraint language supports a subset of these constraint
types. Of all visual expressiveness variables, only the shape variable would have a
large enough capacity to distinctively depict all different constraint types [
          <xref ref-type="bibr" rid="ref31">34</xref>
          ].
However, we argue that distinguishing between these shapes and remembering which
shape relates to which constraint type would put at least the same amount of cognitive
burden, as textually entering the constraint rule. Thus, the textual interface for editing
the constraint rules allows flexibility in terms of constraint languages, without
overburdening the user, similar to the interface of OWLGrEd [
          <xref ref-type="bibr" rid="ref22">25</xref>
          ]. Furthermore, the
actual RDF syntax is simplified: each text field represents a predicate-object pair,
stemmed on the Predicate Lists expressions of Turtle, the human-readable RDF
serialization format [
          <xref ref-type="bibr" rid="ref32">35</xref>
          ].
        </p>
        <p>unSHACLed allows domain experts to execute the validation assessment on the
loaded sample data graph. This is automatically performed during editing, or can be
triggered manually via the Action Toolbar. The results are visualized in the Editing
Area by differently coloring the resource rectangle’s header. This allows to easily
detect constraint violations during the editing process. Thus, immediate feedback is
available, visualized on the data graph in the Editing Area.</p>
      </sec>
      <sec id="sec-3-2">
        <title>4.2 Implementing the Desired Features</title>
        <p>
          We evaluated the application of our approach within unSHACLed by using the
objectives-based evaluation method [
          <xref ref-type="bibr" rid="ref33">36</xref>
          ], i.e., a questions-oriented evaluation
approach that can be performed internally by program developers. The UI of
unSHACLed implements the desired features for data shape editors which were
presented in Section 3. Below, we elaborate on how each feature is facilitated. A
summary of which features are supported by which UI element can be found in
Table 1.
        </p>
        <p>F1. Independence of constraint language</p>
        <p>F2. Support multiple data sources
F3. Support different serializations</p>
        <p>F4. Support multiple ontologies
F5. Multiple alternative modeling</p>
        <p>approaches
F6. Non-linear workflows</p>
        <p>✓
F7. Independence of execution</p>
        <p>Features</p>
        <p>Overview
Sidebar
✓</p>
        <p>UI Element
Action
Toolbar
✓
✓
✓
✓
✓</p>
        <p>Editing
Area
✓
✓
✓
✓</p>
        <p>F1. Independence of constraint language The Overview Sidebar can be filled with
constraint language specific templates, however, the interface of the Editing Area
remains independent of the constraint language. The overlapping semantic constructs
of the constraint languages are supported by the interface: the data graph and data
shape are similarly visualized via the connected rectangles, with either
predicateobject pairs or a set of constraint rules; the constraint violations are visualized on the
data graph; the constraint rules can be edited via the textual input fields. Moreover,
the actual validation engine is modularized, i.e., other validation systems can be
plugged in to support different constraint languages.</p>
        <p>F2. Support multiple data sources The Action Toolbar allows importing multiple
data graphs and data shapes: all are loaded and visualized in the Editing Area.
Validation is executed on the combination of all loaded data graphs, based on the
combination of all loaded data shapes.</p>
        <p>F3. Support different serializations The Action Toolbar allows importing data
graphs and shapes from Turtle and RDF/XML, and the import engine is extensible for
other serializations. In the future, alternative serializations, such as the JSON
serialization for ShEx, could thus be included.</p>
        <p>F4. Support multiple ontologies The textual input fields of the Editing Area are
not restricted to specific ontologies and/or vocabularies, and allow changes at any
time during the editing process.</p>
      </sec>
      <sec id="sec-3-3">
        <title>F5. Multiple alternative modeling approaches By combining the data graph and</title>
        <p>data shape in the Editing Area, domain experts can follow different approaches when
editing data shapes, i.e., either the model-driven or data-driven approach, or they can
employ a hybrid approach: given the immediate feedback of constraint violations in
the loaded data graph, constraint violations can be addressed immediately.</p>
      </sec>
      <sec id="sec-3-4">
        <title>F6. Non-linear workflows</title>
        <p>Domain experts keep the overview of the editing process by combining the data graph
and shape with the Editing Area, and showing all three UI elements simultaneously.
The different constraint aspects can be edited and reviewed without the need for
tracing back previously completed steps.</p>
        <p>F7. Independence of execution Domain experts export data shapes as RDF
statements at any point during the editing process, as facilitated by the Action
Toolbar. Subsequently, the definitions can be edited or executed without unSHACLed.
This paper presents a non-exhaustive list of features for a visual data shape editor, and
proves their feasibility by presenting how these features are applied to unSHACLed.
The proposed seven desired features can guide the design and implementation of a
uniform data shape editor. Ultimately, data shape editors that provide these features
help domain experts to create data shapes without manually editing them, and without
being restricted to the use case: unSHACLed does not require domain experts to
manually write syntactically correct RDF triples, and is not limited to specific use
cases.</p>
        <p>This work is an initial step towards the novel field of data shape editing. First of all,
an evaluation based on a user study is planned, to validate the suitability of the
graphical representation of unSHACLed. Open issues include scalability: how the
interface would handle large data shapes. We foresee the management of multiple data
shapes (and accompanying data graph samples) by the use of multiple contexts within
a workspace. Within a workspace, multiple data shapes can be loaded, without
needing to visualize them simultaneously, and the user is able to switch between
contexts to visualize different data shapes within one workspace. Moreover, we could
apply different detail levels to provide interactive filtering.</p>
      </sec>
      <sec id="sec-3-5">
        <title>Acknowledgements</title>
        <p>The described research activities were funded by Ghent University, imec, Flanders
Innovation &amp; Entrepreneurship (AIO), and the European Union. Ruben Verborgh is a
postdoctoral fellow of the Research Foundation – Flanders.
21. Knublauch, H., Fergerson, R.W., Noy, N.F., Musen, M.A.: The Protégé OWL
Plugin: An Open Development Environment for Semantic Web Applications. In:
Proceedings of the 3rd International Semantic Web Conference (ISWC). pp. 229–
243 (2004).
22. Erdmann, M., Waterfeld, W.: Overview of the NeOn Toolkit. In: Ontology
Engineering in a Networked World. pp. 281–301. Springer Berlin Heidelberg
(2011).
23. Lembo, D., Pantaleone, D., Santarelli, V., Savo, D.F.: Eddy: a graphical editor for</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Cyganiak</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wood</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lanthaler</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>RDF 1.1 Concepts and Abstract Syntax</article-title>
          .
          <source>World Wide Web Consortium (W3C)</source>
          , http://www.w3.org/TR/rdf11-concepts
          <string-name>
            <surname>/</surname>
          </string-name>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Kontokostas</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Westphal</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Auer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hellmann</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cornelissen</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zaveri</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Test-driven evaluation of linked data quality</article-title>
          .
          <source>In: Proceedings of the 23rd international conference on World Wide Web</source>
          . pp.
          <fpage>747</fpage>
          -
          <lpage>757</lpage>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Juran</surname>
            ,
            <given-names>J.M.:</given-names>
          </string-name>
          <article-title>Juran's Quality Control Handbook</article-title>
          .
          <string-name>
            <surname>Mcgraw-Hill</surname>
          </string-name>
          , Texas, USA (
          <year>1988</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Dimou</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vander</surname>
            <given-names>Sande</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Colpaert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Verborgh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Mannens</surname>
          </string-name>
          , E., Van de Walle, R.:
          <article-title>RML: A Generic Language for Integrated RDF Mappings of Heterogeneous Data</article-title>
          .
          <source>In: Proceedings of the 7th Workshop on Linked Data on the Web</source>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Knublauch</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kontokostas</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Shapes Constraint Language (SHACL)</article-title>
          .
          <source>W3C</source>
          , https://www.w3.org/TR/shacl/ (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Das</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sundara</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cyganiak</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>R2RML: RDB to RDF Mapping Language</article-title>
          .
          <source>World Wide Web Consortium (W3C)</source>
          , http://www.w3.org/TR/r2rml/ (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Pinkel</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Binnig</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haase</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Martin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sengupta</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trame</surname>
          </string-name>
          , J.:
          <article-title>How to Best Find a Partner? An Evaluation of Editing Approaches to Construct R2RML Mappings</article-title>
          .
          <source>In: The Semantic Web: Trends and Challenges</source>
          . pp.
          <fpage>675</fpage>
          -
          <lpage>690</lpage>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Motik</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sattler</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>Bridging the gap between OWL and relational databases</article-title>
          .
          <source>In: Proceedings of WWW 2007</source>
          . pp.
          <fpage>74</fpage>
          -
          <lpage>89</lpage>
          (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Tao</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sirin</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bao</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McGuinness</surname>
            ,
            <given-names>D.L.</given-names>
          </string-name>
          :
          <article-title>Integrity Constraints in OWL</article-title>
          .
          <source>In: Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI</source>
          <year>2010</year>
          ). ,
          <string-name>
            <surname>Atlanta</surname>
          </string-name>
          , Georgia, USA (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Arndt</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Meester</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dimou</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verborgh</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mannens</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Using Rule Based Reasoning for RDF Validation</article-title>
          . In: RuleML+RR (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Bock</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fokoue</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haase</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hoekstra</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ruttenberg</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sattler</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          : OWL 2
          <string-name>
            <given-names>Web</given-names>
            <surname>Ontology Language - Structural Specification</surname>
          </string-name>
          and
          <string-name>
            <surname>Functional-Style Syntax</surname>
          </string-name>
          (Second Edition).
          <source>World Wide Web Consortium (W3C)</source>
          , http://www.w3.org/TR/owl2-syntax/ (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Prud'hommeaux</surname>
          </string-name>
          , E.,
          <string-name>
            <surname>Labra</surname>
            <given-names>Gayo</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>J.E.</given-names>
            ,
            <surname>Solbrig</surname>
          </string-name>
          , H.:
          <article-title>Shape expressions: an RDF validation and transformation language</article-title>
          .
          <source>In: Proceedings of the 10th International Conference on Semantic Systems</source>
          . pp.
          <fpage>32</fpage>
          -
          <lpage>40</lpage>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Bosch</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nolle</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Acar</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eckert</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>RDF Validation Requirements - Evaluation and Logical Underpinning</article-title>
          .
          <source>arXiv preprint arXiv:1501</source>
          .
          <fpage>03933</fpage>
          . (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Dimou</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heyvaert</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Meester</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verborgh</surname>
          </string-name>
          , R.:
          <article-title>What Factors Influence the Design of a Linked Data Generation Algorithm?</article-title>
          <source>In: Proceedings of the Workshop on Linked Data on the Web (LDOW</source>
          <year>2018</year>
          )
          <article-title>(</article-title>
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Ekaputra</surname>
            ,
            <given-names>F.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>SHACL4P: SHACL constraints validation within Protégé ontology editor</article-title>
          .
          <source>In: 2016 International Conference on Data and Software Engineering (ICoDSE)</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Dadzie</surname>
            ,
            <given-names>A.-S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rowe</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Approaches to visualising linked data: A survey</article-title>
          .
          <source>Semantic Web</source>
          .
          <volume>2</volume>
          ,
          <fpage>89</fpage>
          -
          <lpage>124</lpage>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Şimşek</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kärle</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Holzknecht</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fensel</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Domain Specific Semantic Validation of Schema.org Annotations</article-title>
          .
          <source>In: Perspectives of System Informatics. PSI 2017</source>
          . pp.
          <fpage>417</fpage>
          -
          <lpage>429</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Fu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Noy</surname>
            ,
            <given-names>N.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Storey</surname>
          </string-name>
          , M.-A.:
          <article-title>Indented Tree or Graph? A Usability Study of Ontology Visualization Techniques in the Context of Class Mapping Evaluation</article-title>
          . In: The Semantic Web - ISWC
          <year>2013</year>
          . pp.
          <fpage>117</fpage>
          -
          <lpage>134</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Falco</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gangemi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peroni</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shotton</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vitali</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Modelling OWL Ontologies with Graffoo</article-title>
          .
          <source>In: The Semantic Web: ESWC 2014 Satellite Events</source>
          . pp.
          <fpage>320</fpage>
          -
          <lpage>325</lpage>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Hallay</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hartmann</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kewitz</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mertens</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>An Aspect-Oriented Visual Ontology Editor with Edit-Time Consistency Checking</article-title>
          .
          <source>In: 2017 IEEE 11th International Conference on Semantic Computing (ICSC)</source>
          (
          <year>2017</year>
          ).
          <article-title>OWL 2 ontologies</article-title>
          .
          <source>In: Proceedings of the 25th International Joint Conference on Artificial Intelligence</source>
          . pp.
          <fpage>4252</fpage>
          -
          <lpage>4253</lpage>
          . , New York, New York, USA (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          24.
          <string-name>
            <surname>Console</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lembo</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Santarelli</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Savo</surname>
            ,
            <given-names>D.F.</given-names>
          </string-name>
          :
          <article-title>Graphol: Ontology Representation Through Diagrams</article-title>
          .
          <source>In: Informal Proceedings of the 27th International Workshop on Description Logics</source>
          . pp.
          <fpage>483</fpage>
          -
          <lpage>495</lpage>
          . , Vienna, Austria (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          25.
          <string-name>
            <surname>Cerans</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ovcinnikova</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liepins</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sprogis</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <source>Advanced OWL 2</source>
          .
          <article-title>0 Ontology Visualization in OWLGrEd</article-title>
          . In: DB&amp;
          <string-name>
            <surname>IS</surname>
          </string-name>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          26.
          <string-name>
            <surname>Guerson</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sales</surname>
            ,
            <given-names>T.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guizzardi</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Almeida</surname>
            ,
            <given-names>J.P.A.</given-names>
          </string-name>
          : OntoUML Lightweight Editor:
          <article-title>A Model-Based Environment to Build, Evaluate and Implement Reference Ontologies</article-title>
          .
          <source>In: 2015 IEEE 19th International Enterprise Distributed Object Computing Workshop</source>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          27.
          <string-name>
            <surname>De Paepe</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thijs</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buyle</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verborgh</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mannens</surname>
          </string-name>
          , E.:
          <article-title>Automated UMLBased Ontology Generation in OSLO2</article-title>
          . In: The Semantic Web: ESWC 2017
          <string-name>
            <surname>Satellite</surname>
            <given-names>Events - ESWC</given-names>
          </string-name>
          <year>2017</year>
          . pp.
          <fpage>93</fpage>
          -
          <lpage>97</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          28.
          <string-name>
            <surname>Junior</surname>
            ,
            <given-names>C.A.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Debruyne</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>O'Sullivan</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Juma: An Editor that Uses a Block Metaphor to Facilitate the Creation and Editing of R2RML Mappings</article-title>
          . In: The Semantic Web:
          <article-title>ESWC 2017 Satellite Events</article-title>
          . pp.
          <fpage>87</fpage>
          -
          <lpage>92</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          29.
          <string-name>
            <surname>Sengupta</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haase</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidt</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hitzler</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Editing R2RML mappings made easy</article-title>
          .
          <source>In: Proceedings of the 12th International Semantic Web Conference (Posters &amp; Demonstrations Track)</source>
          . pp.
          <fpage>101</fpage>
          -
          <lpage>104</lpage>
          . , Sydney, Australia (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          30.
          <string-name>
            <surname>Blinkiewicz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bąk</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>SQuaRE: A Visual Support for OBDA Approach</article-title>
          . In: Semantic Technology - JIST
          <year>2016</year>
          . pp.
          <fpage>47</fpage>
          -
          <lpage>55</lpage>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          31.
          <string-name>
            <surname>Sicilia</surname>
          </string-name>
          , Á.,
          <string-name>
            <surname>Nemirovski</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nolle</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Map-On</surname>
          </string-name>
          :
          <article-title>A web-based editor for visual ontology mapping</article-title>
          .
          <source>Semantic Web Journal. 8</source>
          ,
          <fpage>969</fpage>
          -
          <lpage>980</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          32.
          <string-name>
            <surname>Heyvaert</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dimou</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Meester</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Seymoens</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Herregodts</surname>
            ,
            <given-names>A.-L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verborgh</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schuurman</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mannens</surname>
          </string-name>
          , E.:
          <article-title>Specification and implementation of mapping rule visualization and editing: MapVOWL and the RMLEditor</article-title>
          .
          <source>Web Semantics: Science, Services and Agents on the World Wide Web</source>
          .
          <volume>49</volume>
          ,
          <fpage>31</fpage>
          -
          <lpage>50</lpage>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          33.
          <string-name>
            <surname>Heyvaert</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dimou</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verborgh</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mannens</surname>
          </string-name>
          , E., Van de Walle, R.:
          <article-title>Towards a Uniform User Interface for Editing Mapping Definitions</article-title>
          .
          <source>In: Proceedings of the 4th Workshop on Intelligent Exploration of Semantic Data</source>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          34. Moody, D.: The “Physics” of Notations:
          <article-title>Toward a Scientific Basis for Constructing Visual Notations in Software Engineering</article-title>
          .
          <source>IEEE Transactions on Software Engineering</source>
          .
          <volume>35</volume>
          ,
          <fpage>756</fpage>
          -
          <lpage>779</lpage>
          (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          35.
          <string-name>
            <surname>Beckett</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berners-Lee</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Prud</surname>
          </string-name>
          'hommeaux, E.,
          <string-name>
            <surname>Carothers</surname>
          </string-name>
          , G.:
          <article-title>Turtle - Terse RDF Triple Language</article-title>
          .
          <source>World Wide Web Consortium (W3C)</source>
          , http:// www.w3.org/TR/turtle/ (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          36.
          <string-name>
            <surname>Stufflebeam</surname>
            ,
            <given-names>D.: Evaluation</given-names>
          </string-name>
          <string-name>
            <surname>Models</surname>
          </string-name>
          .
          <source>New Directions for Evaluation</source>
          .
          <year>2001</year>
          ,
          <fpage>7</fpage>
          -
          <lpage>98</lpage>
          (
          <year>2001</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>