Knowledge Reconciliation of n-ary RelationsSupported by the PractiKPharma project, founded by the French National Research Agency (ANR) under Grant ANR15-CE23-0028, by the IDEX “Lorraine Université d’Excellence” (15-IDEX-0004), and by the Snowball Inria Associate Team.

Knowledge Reconciliation of -ary Relations1


In the expanding Semantic Web, an increasing number of sources of data and knowledge are accessible by human and software agents. Sources may differ in granularity or completeness, and thus be complementary. Consequently, unlocking the full potential of the available knowledge requires combining them. To this aim, we define the task of knowledge reconciliation, which consists in identifying, within and across sources, equivalent, more specific, or similar units. This task can be challenging since knowledge units are heterogeneously represented in sources (e.g., in terms of vocabularies). In this paper, we propose a rule-based methodology for the reconciliation of -ary relations. To alleviate the heterogeneity in representation, we rely on domain knowledge expressed by ontologies. We tested our method on the biomedical domain of pharmacogenomics by reconciling 50,435 -ary relations from four different real-world sources, which highlighted noteworthy agreements and discrepancies within and across sources.

Reconciliation Multidimensional Relation Order Ontology

1 Introduction

The Semantic Web [5] offers numerous actors the ability to publish, edit, access, and interpret data and knowledge. Actors are inherently working concurrently, which may lead to different data or knowledge sources describing similar units. These sources may differ in quality, completeness, granularity, and vocabularies. Unlocking the full potential of the knowledge they conjointly express requires identifying, within and across sources, equivalent, more specific or similar knowledge units. This task that we call knowledge reconciliation may highlight agreements, differences, and deficiencies within and across sources, providing a consolidated view of a domain, potentially useful in many applications, such as knowledge fusion and fact-checking.

Here, we focus on the reconciliation of units in knowledge bases expressed using Semantic Web standards. In this case, Uniform Resource Identifiers (URIs) represent entities of a world, e.g., places, drugs, etc. Statements, expressed with the Resource Description Format (RDF) language, link URIs together or to literals (e.g., string, integers) using predicates. These latter (e.g., has-side-effect, has-name) give access to the link semantics. The use of ontologies, i.e., formal representations of a domain [10], enables the association of domain knowledge with entities. Ontologies consist of definitions of classes and predicates, partially ordered by the subsumption relation, denoted by . This relation states that a class (respectively a predicate) is more specific than another.

We illustrate the task of knowledge reconciliation in the biomedical domain of pharmacogenomics (PGx), which studies the influence of genetic factors on drug response phenotypes. PGx knowledge originate from distinct sources: reference databases such as PharmGKB, biomedical literature, or the mining of Electronic Health Records of hospitals. Knowledge represented in these sources may differ in levels of validation, completeness, and granularity. Consequently, reconciling PGx relations from these sources would provide a consolidated view on the knowledge of this domain, certainly beneficial in precision medicine, which aims at tailoring drug treatments to patients to reduce adverse effects and maximize drug efficacy [6, 7]. PGx knowledge consists of -ary relations relating sets of drugs, sets of genomic variations, and sets of phenotypes. Such an -ary relation states that a patient being treated with the specified sets of drugs, while having the specified genomic variations will be more likely to experience the given phenotypes, e.g., adverse effects. For example, Figure 1 depicts the relation stating that patients treated with warfarin may experience cardiovascular diseases because of variations in the CYP2C9 gene.








Figure 1: Representation of a PGx relation between gene CYP2C9, drug warfarin and phenotype cardiovascular_diseases. The relation is reified through the individual pgr_1, connecting its components through the causes predicate.

Motivated by this real-world application, we propose a general and mathematically well-founded methodology for reconciling -ary relation instantiations, for an arbitrary . For simplicity, relation instantiations will be called relations throughout the paper. Given two relations and , we aim at deciding on their relatedness degree among the five degrees we propose (e.g., equivalent, more specific). In the Semantic Web standards, only binary predicates exist, requiring to reify -ary relations to represent them properly: relations are individualized and linked to their components by predicates (see Figure 1[14]. We consider here that an -ary relation is fully defined by its components that consist of sets of individuals. In this context, reconciling two relations comes down to comparing each of their components, which we achieve by defining five general rules. To tackle the potential heterogeneity in the representation of relations (e.g., granularity, vocabularies), we propose to enrich this structure-based comparison by considering domain knowledge (e.g., classes of ontologies and links between individuals). Finally, some of our rules are designed to ensure some desired properties such as transitivity and symmetry.

Knowledge reconciliation is close to several other research works. Indeed, it is tightly related to database reconciliation, i.e., managing co-existing and independently modified replicas of the same database [1]. It is also associated with ontology matching [8], which aims at finding alignments between units of two ontologies (e.g., equivalences, or subsumptions between classes, predicates, or instances). In this field, existing works use different features to suggest alignments. For example, some methods rely on the syntax of units label (e.g., string matching). However, labels may not always be available. Structure-based techniques can alleviate such limitations. They rely either on the internal structure of a unit (i.e., predicates used to link a unit to literals) or the relational structure of a unit (i.e., its links with other units). Two examples of frequently considered relational structures are the hierarchy of classes and partOf links in an ontology. For example, Atencia et al. [3] define linkkeys, a structure-based method to align individuals. A linkkey consists of a pair of classes and a set of pairs of properties from two ontologies. Instances of these classes that share common values for all properties in the linkkey are regarded as identical. Alternatively, Suchanek et al. [16] propose a holistic method called PARIS to align individuals, classes, and predicates. In this framework, alignments for each type of unit fertilize the others. Particularly, they define rules that rely on the internal and relational structures of units and the functionality of predicates. Similarly, Galarraga et al. [9] mine specific rules to align ontologies under the Partial Completeness Assumption, which also relies on the functionality of predicates. Other works explore knowledge reconciliation in the domain of Natural Language Processing, to extract knowledge from multiple natural language sources and merge them into a unique representation [11]. Such a reconciliation can be performed by machine learning techniques that learn vector representations of units respecting their similarities [2].

The rest of this paper is organized as follows. In Section 2, we formalize the problem of knowledge reconciliation for -ary relations. In Section 3, we propose two preorders to compare sets of individuals by considering domain knowledge: links between individuals and classes instantiated. These preorders are used in Section 4 to define reconciliation rules deciding on the relatedness between two -ary relations. Rules are experimented on PGx knowledge in Section 5. Finally, we discuss our method and conclude in Sections 6 and 7.

Main contributions of this paper:

  • We propose a general framework for the reconciliation of -ary relations whose components are sets of individuals.

  • We propose five reconciliation rules, each ensuring some desired properties, e.g., transitivity and symmetry. These rules use preorders arising from domain knowledge (classes instantiated and links between individuals).

2 Problem Setting

We aim at reconciling -ary relations within a knowledge base , i.e., given two relations and , we determine their relatedness degree (e.g., equivalent, more specific or similar). is represented in the formalism of Description Logics (DL) [4] and thus consists of a TBox and an ABox. Accordingly, our knowledge reconciliation methodology uses the DL reasoning mechanisms of satisfiability, instance retrieval, and classification.

More precisely, we consider a set of -ary relations ( fixed) whose components are sets of individuals in . As DL only accounts for binary relations, we assume each relation is reified as an individual within . Such a relation can be formally represented as . associates a relation with its component denoted by , which is a set of individuals included in the domain of interpretation . Relations in come from potentially noisy sources and some components may be missing. As verifies the Open World Assumption, we can only consider such components to be unknown since they are not explicitly specified as empty. In this case, such unspecified components are set to to denote that all individuals may apply. For example, we could use a ternary relation to model pgr_1 from Figure 1, giving . In this modeling, components respectively represent the sets of drugs, genomic factors, and phenotypes involved in the relation. In Section 5, we propose a finer definition of components by considering predicates (such as causes or influences) in addition to the class of associated individuals (drugs, genetic factors, etc.).

In view of our formalism, reconciling two -ary relations and comes down to deciding on their relatedness degree by comparing their components and for each . To illustrate, if for all , then and are representing the same knowledge unit. Such a result highlights an agreement between the sources of and . In the next section, we consider other tests between components.

3 Ontology-Based Preorders

As illustrated in Section 2, the reconciliation of two -ary relations and relies on the comparison of each of their components and . Comparing such sets of individuals can be achieved by testing their inclusion or equality. Thus, if , then can be considered as more specific than . It is noteworthy that testing inclusion or equality implicitly considers owl:sameAs links that indicate identical individuals. For example, the comparison of with while knowing that results in an equality. However, additional domain knowledge can be considered. For instance, some individuals can be part of others. Individuals may also instantiate different ontological classes, which are themselves comparable through subsumption. Such domain knowledge help tackle the heterogeneous representation of relations. To consider this domain knowledge in the process of reconciliation, we propose two preorders, i.e., reflexive and transitive binary orderings.

3.1 Preorder Based on Links Between Individuals

Individuals in may be involved in in several links with other individuals. Some predicates p used in such links are transitive and reflexive. Thus, for each of these predicates p, we define a preorder6 parameterized by p as follows:


Note that, from the reflexivity of p, implies . The equivalence relation associated with is defined as usual by:

Example 1

By its transitivity and reflexivity, partOf is a suitable candidate for such a preorder. Consider three individuals , such that . Then it follows that:

Furthermore, we also have that , since is a part of . Thus, adding in a set that already contains is redundant. Such a case may arise due to noise in induced by source heterogeneity.

3.2 Preorder Based on Instantiation and Subsumption

The second preorder we propose takes into account classes of an ontology instantiated by individuals in and ordered by subsumption. We denote the set of all classes of by . As it is standard in DL, denotes the top level class in . Given an individual , we denote the set of classes of , except , instantiated by with:

Note that may be empty. We explicitly exclude from since may be noisy: individuals may lack instantiations of specific classes but instantiate by default. This motivation to exclude is illustrated by Example 2.

Example 2

Consider two PGx relations involving the same drug and genetic factor. Regarding the phenotype, one is linked with an individual representing headache that does not instantiate the class Headache in (e.g., MeSH) but instantiates by default. The other relation is linked with an individual pain that instantiates , with . Intuitively, the first relation is more specific than the second. However, by considering instantiated classes and knowing that , we would conclude that the first relation is more general than the second. We avoid this unwanted behavior by excluding from , leading to the relations being incomparable.

Given , we denote by the set of the most specific classes of , i.e., Similarly, we denote by the set of the most specific classes of , except , instantiated by an individual , i.e., .

Given an ontology , we can now define the preorder7 based on set inclusion and subsumption as follows:


Clearly, if is more specific than and , then (3a) , or (3b) all the most specific classes instantiated by are subsumed by at least one of the most specific classes instantiated by individuals in . Thus individuals in can be seen as “more general” than those in . As before, induces the equivalence relation defined by:


The preorder can be seen as parameterized by the ontology , allowing to consider different parts of the TBox of for each component , if needed.

Example 3

Figure 8 depicts six examples for the application of :


is more specific than even if instantiates a more specific class than , because of the more general individual .


is more specific than since classes in are either the same than those in or more specific than those in .


is more specific than since the class in is more specific than the one in . There is no need to compare it with the class in .


This example, similar to (c), illustrates the occurrence of the same behavior regardless of classes being instantiated by a single or by several individuals.


and cannot be compared. Unlike the two latter examples, here, instantiates a class that is more specific than the class instantiated by , but also a class that is not comparable.


and are equivalent by instantiating the same most specific class.






Figure 8: Examples of use cases of the preorder . Circles represent ontology classes. Solid arrows depict class subsumptions and dashed arrows depict class instantiations by individuals , , and . The light gray color identifies classes in . The dark gray color identifies classes in and .

4 Using Preorders to Define Reconciliation Rules

Let be two -ary relations to be reconciled. Assuming each component is endowed with a preorder enabling the comparison of and , we can define rules for aggregating such comparisons for all and compare and globally. Thus, such rules conclude on the relatedness degree of and , performing their reconciliation.

Here, we propose the following five relatedness degrees: , , , , and (from the strongest to the weakest). Accordingly, we propose five reconciliation rules of the form , where expresses the conditions of the rule, testing equalities, equivalences, or inequalities between components of and . Classically, these conditions can be combined using conjunctions or disjunctions, respectively denoted by and . If holds, expresses the relatedness between and to add to . Rules are applied from Rule 1 to Rule 5. Once conditions in hold for a rule, is added to and the following rules are discarded, meaning that at most one relatedness degree is added to for each pair of relations. When no rule can be applied, and are considered as incomparable and nothing is added to . The first four rules are the following:

Rule 1

Rule 2

Rule 3

Rule 4

The relatedness degrees resulting of these rules are respectively encoded in by owl:sameAs, skos:closeMatch, skos:broadMatch, and skos:relatedMatch links. Rule 1 states that and are identical () whenever and coincide on each component. Rule 2 states that and are equivalent () whenever each component of is equivalent to the same component of . Rule 3 states that is more specific than  () whenever each component of is more specific than the same component of w.r.t. . Rule 4 states that and have comparable components () whenever they have the same specified components (i.e., different from ), and these components are comparable w.r.t. . Rules 1 to 3 ensure the transitivity property. Additionally, Rules 1, 2, and 4 ensure the symmetry property.

In Rules 1 to 4, comparison is made component-wise. However, other relatedness cases may require aggregating over components. For example, we may want to compare all individuals involved in two relations, regardless of the components they are involved in. Additionally, we may want to state that two relations are weakly related if each of their components have a specified proportion of comparable individuals. To this aim, we propose Rule 5. Let be a partition of , defined by the user at the beginning of the reconciliation process. Let , i.e., the aggregated component of is the union of all specified (i.e., different from ) for . We assume each aggregated component is endowed with a preorder . We denote by the semantic set difference between and , i.e., . is the set of elements in preventing it from being more specific than w.r.t. . We define the operator as follows:

This operator returns a number measuring the similarity between and . This number is equal to 1 if the two aggregated components are comparable. Otherwise, it is equal to 1 minus the proportion of incomparable elements. We denote by the set of aggregated components that are specified for both and (i.e., different from ). Then, Rule 5 is defined as follows:

Rule 5

Let be a partition of , and let , , and be three parameters, all fixed at the beginning of the reconciliation process.

Rule 5 is applicable if at least aggregated components are specified for both and . Then, and are weakly related () whenever all these specified components have a similarity of at least or when at least of them are comparable. Rule 5 ensures the symmetry property. The relatedness degree is encoded by skos:related links.

In the end, reconciling -ary relations from comes down to applying these five reconciliation rules on every ordered pair of -ary relations from .

5 Application to Pharmacogenomic Knowledge

Our methodology was motivated by the real-world problem of reconciling pharmacogenomic (PGx) knowledge. Consequently, we experimented this methodology with PGxLOD8 [12], a PGx knowledge base represented in the Description Logic [4]. In PGxLOD, 50,435 PGx relations are available, coming from four different sources: (i) structured data of PharmGKB, (ii) textual portions of PharmGKB called clinical annotations, (iii) biomedical literature, and (iv) results found in EHR studies. PGx relations are represented using classes and predicates of the PGxO ontology9. As PGx relations are -ary, they are reified as instances of the PharmacogenomicRelationship class. All the individuals involved in PGx relations instantiate the Drug, GeneticFactor, or Phenotype classes. They are linked with reified PGx relations by predicates qualifying their association to relations. Predicates are organized in a hierarchy defined by subsumption relations, such as . It is noteworthy that, in PGxLOD, partOf links indicate that instances of GeneticFactor compose others such instances. For example, a genomic variation may be part of a gene. Similarly, instances of Phenotype may have dependencies, expressed with dependsOn links. These dependencies enable representing complex phenotypes that refer to other phenotypes or drugs. For example warfarin-caused hemorrhage is a phenotype linked with dependsOn to hemorrhage and warfarin. The TBox of PGxLOD contains, alongside PGxO, three other ontologies: individuals representing drugs may instantiate classes from ATC or ChEBI, and individuals representing phenotypes may instantiate classes from MeSH. Table 1 provides global statistics about PGxLOD.

Class # instances Predicate # links
Drug 47,584 partOf 16,697
GeneticFactor 464,302 dependsOn 23,976
Phenotype 61,330
PharmacogenomicRelationship 50,435

From PharmGKB (structured data)

From PharmGKB (clinical annotations)

From biomedical literature

From EHRs
Table 1: Statistics about PGxLOD. # denotes “number of”. Instances linked by owl:sameAs are counted separately. partOf links are counted without transitivity inference. All PGx relations were programmatically extracted from their sources, except the ten relations from EHRs that were manually added as a proof of concept.

To apply the reconciliation rules on PGx relations, we specified their components. Each component of a relation is the set of individuals with a specific type (Drug, GeneticFactor, or Phenotype) that are linked with a specific predicate to the relation. For example, given a PGx relation, contains all the phenotypes caused by . Hence, as there are 3 types of individuals and 38 predicates, PGx relations have components. Once components of relations are specified, their associated preorders can be defined. Based on the available data and knowledge in PGxLOD, it makes sense to use the preorder for components involving instances of GeneticFactor. Similarly, we use and as preorders for components respectively involving instances of Drug and Phenotype, where is the concatenation of ATC and ChEBI, and is the MeSH ontology.

Finally, to apply Rule 5, a natural three-way partition of components appears based on the three types of involved individuals. Therefore, discarding predicates, we gather all drugs, genetic factors, and phenotypes involved in a relation in three aggregated components. To benefit from dependencies of complex phenotypes, we choose to add them to the correct aggregated components based on their type. For example, in warfarin-caused hemorrhage, hemorrhage is added to the aggregated component representing phenotypes and warfarin is added to the one representing drugs. We arbitrarily set , , and . These values mean that two PGx relations and will be reconciled by Rule 5 if their three aggregated components are specified (i.e., different from ). Additionally, each of the three aggregated components of must have 80% of comparable individuals with the same aggregated component of , or at least two aggregated components of must be comparable with the same aggregated components of .

To illustrate the interest of this formalization as well as reasoning mechanisms from DL, let and be two PGx relations. causes a phenotype and is associated with a phenotype , and is associated with both phenotypes. Thus, by applying reasoning mechanisms along the hierarchy of predicates, it follows that:

By definition of , as well as . Therefore, by applying Rule 3, is more specific than . This makes sense as the predicate connecting with is more specific with than the one used with .

We implemented our knowledge reconciliation methodology in C++ with multithreading. Our code is available on GitHub10. Our program interacts with the knowledge base thanks to SPARQL queries. Previously, we indicated that an unspecified component of an -ary relation is set to . Accordingly, when a SPARQL query returns for a component of a relation, it is interpreted as if it is returning . On PGxLOD, the reconciliation rules led to perform comparisons in approximately 54 hours using 4 cores and 15 GB of RAM. Results are provided in Table 2 and discussed in Section 6.

PGKB (sd) PGKB (ca) Literature EHRs
Rule 1
PGKB (sd) 166 0 0 0
PGKB (ca) 0 10,134 0 0
Literature 0 0 122,646 0
EHRs 0 0 0 0
Rule 2
PGKB (sd) 0 5 0 0
PGKB (ca) 5 1,366 0 0
Literature 0 0 16,692 0
EHRs 0 0 0 0
Rule 3
PGKB (sd) 87 3 15 0
PGKB (ca) 9,325 605 42 0
Literature 0 0 75,138 0
EHRs 0 0 0 0
Rule 4
PGKB (sd) 20 0 0 0
PGKB (ca) 0 110 0 0
Literature 0 0 18,050 0
EHRs 0 0 0 0
Rule 5
PGKB (sd) 100,596 287,670 414 2
PGKB (ca) 287,670 706,270 1,103 19
Literature 414 1,103 1,082,074 15
EHRs 2 19 15 0
Table 2: Number of links resulting from each rule. Links are generated between relations of distinct sources or within the same source. PGKB stands for “PharmGKB”, sd for “structured data”, and ca for “clinical annotations”. As Rules 1, 2, 4, and 5 ensure symmetry, links from to as well as from to are counted. Similarly, as Rules 1 to 3 ensure transitivity, transitivity-induced links are counted. Regarding skos:broadMatch links, rows represent origins and columns represent destinations.

6 Discussion

In Table 2, we observe that most links are intra-source as only Rules 2, 3, and 5 generated links across sources. This predominance of intra-source links may come from the use of different vocabularies to represent individuals in sources. In such a case, our reconciliation process requires mappings between such vocabularies to compare individuals. Thus, missing mappings prevent reconciliation rules to be applied. This result underlines the importance of enriching the knowledge base with ontology-to-ontology mappings, for example, those defined in the NCBO BioPortal. We also notice that Rule 5 generates more links than the other rules. These numbers emphasize the importance of considering weaker relatedness degrees to establish connections between sources and overcome their heterogeneity. Here, by only considering a specified proportion of comparable individuals, this rule allows alleviating missing class instantiations or mappings.

By looking more closely at the results, we notice that all owl:sameAs links are intra-source and thus indicate duplicates. This is expected in the case of the literature since several articles could mention the same relation. The 5 skos:closeMatch links between relations from structured data and clinical annotations of PharmGKB highlight expected agreements between these two related sources. However, linked relations are expressed with different individuals instantiating the same ontology classes, preventing their reconciliation with owl:sameAs.

Some relations from the literature appear more general than PharmGKB structured data and clinical annotations (respectively 15 and 42 skos:broadMatch links). These links are a foreseen consequence of the completion process of PharmGKB. Indeed, curators achieve this completion after a literature review, inevitably leading to relations more specific or equivalent to the ones in reviewed articles. Interestingly, our methodology could ease such a review by pointing at articles describing similar relations. Clinical annotations of PharmGKB are in several cases more specific than structured data, as 9,325 skos:broadMatch links were produced between these two sources. This is also expected as structured data are a broad-level summary of more complex phenotypes detailed in clinical annotations.

The results of Rule 4 underline that sources may contain relations with comparable components. These results may benefit source owners by encouraging them to add a relation formed by the most specific components of reconciled relations. Finally, we notice that only Rule 5 generates links between the relations from EHRs and other sources. As relations from EHRs are manually represented, there are only a few of them, minimizing the chance of overlap with other sources. Additionally, phenotypes involved in relations from EHRs are very specific, making their comparison with phenotypes from biomedical literature or PharmGKB difficult.

Regarding our method, using rules is somehow off the trends that invest machine learning approaches for reconciliation [13, 15]. However, writing simple and well-founded rules constitutes a valid first step before applying machine learning approaches. Indeed, rules are readable and may be analyzed and confirmed by domain experts. This eases the explanation of reconciliation results. Our rules are simple enough to be generally true, and thus, to be useful in other domains. By relying on instantiated classes and partOf links, we illustrate how domain knowledge and reasoning mechanisms can serve a structure-based reconciliation. In future works, conditions under which preorders and could be merged into one unique preorder deserve to be studied.

Other reconciliation rules may appear, either given by experts or automatically learned by machine learning approaches. In this context, such well-founded and explicit rules enable generating a “silver” standard for reconciliation, which may be useful to either train or evaluate supervised approaches. Then, in this view, results obtained from rules constitute a baseline to generalize from or compare to when experimenting with alternative reconciliation methods.

7 Conclusion

In this paper, we considered the reconciliation of -ary relations fully defined by their components. For each pair of relations, we aimed at deciding on their relatedness degree among the five degrees we proposed. We defined a general and mathematically well-founded methodology that relies on reconciliation rules and preorders leveraging domain knowledge and associated reasoning capabilities. We applied our methodology to the real-world use case of reconciling pharmacogenomic relations, i.e., relations that represent the impact of genomic factors on drug response phenotypes, and obtained insightful results. In the future, our results could be compared with reconciliation results obtained from machine learning approaches. Additionally, the integration of this purely symbolic approach with machine learning approaches deserves to be studied.

Appendix A Proof that is a preorder


From the fact that p is reflexive, it immediately follows that is reflexive. Indeed, for every , since for every , .

To prove that is a preorder, it remains to show that is transitive. Consider such that:

In other words, and By the transitivity of p, we then have that

i.e., . This shows that is transitive, and the proof is complete. ∎

Appendix B Proof that is a preorder

Recall that, for every ,


The reflexivity of follows immediately from (5a). To see that it is also transitive, consider distinct such that . We need to prove that , that is,

So let . If , then it follows from that


and we are done. Otherwise,

As , we have two possible cases for each :

  • and for each we also have:

  • . Since the subsumption relation is transitive, , and

From these two cases, it follows that for each such that

we have that


From Equations (6) and (7), it then follows that:

thus showing that . As the latter holds for every , is transitive. ∎


  1. thanks: Supported by the PractiKPharma project, founded by the French National Research Agency (ANR) under Grant ANR15-CE23-0028, by the IDEX “Lorraine Université d’Excellence” (15-IDEX-0004), and by the Snowball Inria Associate Team.
  2. email: {pierre.monnin, miguel.couceiro, amedeo.napoli, adrien.coulet}
  3. email: {pierre.monnin, miguel.couceiro, amedeo.napoli, adrien.coulet}
  4. email: {pierre.monnin, miguel.couceiro, amedeo.napoli, adrien.coulet}
  5. email: {pierre.monnin, miguel.couceiro, amedeo.napoli, adrien.coulet}
  6. The proof that is a preorder is available in Appendix A.
  7. The proof that is a preorder is available in Appendix B.


  1. S. Abiteboul, I. Manolescu, P. Rigaux, M. Rousset and P. Senellart (2011) Web data management. Cambridge University Press. External Links: ISBN 978-1-10-701243-1 Cited by: §1.
  2. M. Alam, D. R. Recupero, M. Mongiovì, A. Gangemi and P. Ristoski (2017) Reconciling event-based knowledge through RDF2VEC. In Proceedings of HybridSemStats@ISWC 2017, Vienna, Austria October 22nd, 2017, CEUR Workshop Proceedings. Cited by: §1.
  3. M. Atencia, J. David and J. Euzenat (2014) Data interlinking through robust linkkey extraction. In Proceedings of ECAI 2014 18-22 August 2014, Prague, Czech Republic, Frontiers in Artificial Intelligence and Applications, Vol. 263, pp. 15–20. Cited by: §1.
  4. F. Baader, D. Calvanese, D. L. McGuinness, D. Nardi and P. F. Patel-Schneider (Eds.) (2003) The description logic handbook: theory, implementation, and applications. Cambridge University Press. External Links: ISBN 0-521-78176-0 Cited by: §2, §5.
  5. T. Berners-Lee, J. Hendler and O. Lassila (2001) The Semantic Web. Scientific american 284 (5), pp. 28–37. Cited by: §1.
  6. K. E. Caudle, T. E. Klein and J. M. Hoffman (2014) Incorporation of pharmacogenomics into routine clinical practice: the clinical pharmacogenetics implementation consortium (cpic) guideline development process. Current Drug Metabolism 15 (2), pp. 209–217. Cited by: §1.
  7. A. Coulet and M. Smaïl-Tabbone (2016) Mining electronic health records to validate knowledge in pharmacogenomics. ERCIM News 2016 (104). Cited by: §1.
  8. J. Euzenat and P. Shvaiko (2013) Ontology matching, second edition. Springer. External Links: ISBN 978-3-642-38720-3 Cited by: §1.
  9. L. A. Galárraga, N. Preda and F. M. Suchanek (2013) Mining rules to align knowledge bases. In Proceedings of AKBC@CIKM 13, San Francisco, California, USA, October 27-28, 2013, pp. 43–48. Cited by: §1.
  10. T. R. Gruber (1993) A translation approach to portable ontology specifications. Knowledge acquisition 5 (2), pp. 199–220. Cited by: §1.
  11. M. Mongiovì, D. R. Recupero, A. Gangemi, V. Presutti and S. Consoli (2016) Merging open knowledge extracted from text with MERGILO. Knowl.-Based Syst. 108, pp. 155–167. Cited by: §1.
  12. P. Monnin, J. Legrand, G. Husson, P. Ringot, A. Tchechmedjiev, C. Jonquet, A. Napoli and A. Coulet (2019-04-18) PGxO and PGxLOD: a reconciliation of pharmacogenomic knowledge of various provenances, enabling further comparison. BMC Bioinformatics 20-S (4), pp. 139. Cited by: §5.
  13. M. Nickel, K. Murphy, V. Tresp and E. Gabrilovich (2016) A review of relational machine learning for knowledge graphs: from multi-relational link prediction to automated knowledge graph construction. Proceedings of the IEEE 104 (1), pp. 11–33. Cited by: §6.
  14. N. Noy, A. Rector, P. Hayes and C. Welty (2006) Defining N-ary Relations on the Semantic Web. W3C working group note 12 (4). Cited by: §1.
  15. P. Ristoski and H. Paulheim (2016) RDF2Vec: RDF graph embeddings for data mining. In The Semantic Web - ISWC 2016 - 15th International Semantic Web Conference, Kobe, Japan, October 17-21, 2016, Proceedings, Part I, pp. 498–514. Cited by: §6.
  16. F. M. Suchanek, S. Abiteboul and P. Senellart (2011) PARIS: probabilistic alignment of relations, instances, and schema. PVLDB 5 (3), pp. 157–168. Cited by: §1.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
Add comment
Loading ...
This is a comment super asjknd jkasnjk adsnkj
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test description