anchor.diff:  which showed that Seed helped end-users easily create and interact with
   semantic content with nearly no prerequisite knowledge."
   research_gadelrab_29,29,"Mohamed H. Gad-Elrab, Daria Stepanova, Jacopo Urbani and Gerhard Weikum",gadelrab,Exception-enriched Rule Learning from Knowledge Graphs,research,Data Mining,4,Mohamed H. Gad-Elrab,paper_M139_.pdf,502,2016-10-21T10:30:00,2016-10-21T11:50:00,"Finding relevant concepts from a corpus of ontologies is useful in many scenarios, including document classification, web page annotation, and automatic ontology population. Millions of concepts are contained in a large number of ontologies across diverse domains. SPARQL-based query demands knowledge of the structure of ontologies and the query language, whereas more user-friendly, simple keyword-based approaches suffer from false positives as concept descriptions in ontologies may be ambiguous and overlapping. In this paper, we propose a keyword-based concept search framework that (1) exploits the structure and semantics in ontologies, by constructing contexts for each concept; (2) generates the interpretations of a query; and (3) balances relevance and diversity of search results. A comprehensive evaluation against both the domain-specific BioPortal and the general-purpose Falcons on widely-used performance metrics demonstrates that our system outperforms both."
  -research_gao_35,35,"Shen Gao, Daniele Dell'Aglio, Soheila Dehghanzadeh, Abraham Bernstein, Emanuele Della Valle and Alessandra Mileo",gao,Planning Ahead: Stream-Driven Linked-Data Access under Update-Budget Constraints,research,Streams,1,Shen Gao,paper_M119_.pdf,501,2016-10-20T13:30:00,2016-10-20T14:50:00,"Data stream applications are becoming increasingly popular on the web. In these applications, one query pattern is especially prominent: a join between a continuous data stream and some background data (BGD). Oftentimes, the target BGD is large, maintained externally, changing slowly, and costly to query (both in terms of time and money). Hence, practical applications usually maintain a local (cached) view of the relevant BGD. Given that these caches are not updated as part of the transaction modifying the original BGD, they should be maintained under realistic budget constraints (in terms of latency, computation time, and possibly financial cost) to avoid stale data leading to wrong answers. 
  +research_gao_35,35,"Shen Gao, Daniele Dell'Aglio, Soheila Dehghanzadeh, Abraham Bernstein, Emanuele Della Valle and Alessandra Mileo",gao,Planning Ahead: Stream-Driven Linked-Data Access under Update-Budget Constraints,research,Streams,1,Shen Gao,paper_M119_.pdf,501,2016-10-20T13:30:00,2016-10-20T14:50:00,"Data stream applications are becoming increasingly popular on the web. In these applications, one query pattern is especially prominent: a join between a continuous data stream and some background data (BGD). Oftentimes, the target BGD is large, maintained externally, changing slowly, and costly to query (both in terms of time and money). Hence, practical applications usually maintain a local (cached) view of the relevant BGD. Given that these caches are not updated as part of the transaction modifying the original BGD, they should be maintained under realistic budget constraints (in terms of latency, computation time, and possibly financial cost) to avoid stale data leading to wrong answers.
   
   This paper proposes to model the join between streams and the BGD as a bipartite graph. By exploiting the graph structure, we keep the quality of results good enough without refreshing the entire cache for each evaluation. We also introduce two extensions to this method: first, we consider both the sliding window (specifying the currently relevant section of the data stream) and the change rate of the BGD to focus on updates that have the longest effect. Second, by considering the future impact of a query to the BGD we propose to sometimes delay updates to provide more fresher answers in future.
   
  
positive.code: Preliminary results indicate a broad spectrum of yet to be explored options.
  As the PhD is still in an early phase, we hope to narrow the scope in the next months,
  based on feedback of the doctoral consortium."
  journal_saleem_6,6,"Muhammad Saleem,  Yasar Khan,  Ali Hasnain,  Ivan Ermilov and Axel-Cyrille Ngonga Ngomo",saleem,A Fine-Grained Evaluation of SPARQL Endpoint Federation Systems,journal,Querying/SPARQL (I),4,Muhammad Saleem,journal_saleem_6.pdf,501,2016-10-20T10:30:00,2016-10-20T11:50:00,"The Web of Data has grown enormously over the last years. Currently, it comprises a large compendium of interlinked and distributed datasets from multiple domains. Running complex queries on this compendium often requires accessing data from different endpoints within one query. The abundance of datasets and the need for running complex query has thus motivated a considerable body of work on SPARQL query federation systems, the dedicated means to access data distributed over the Web of Data. However, the granularity of previous evaluations of such systems has not allowed deriving of insights concerning their behavior in different steps involved during federated query processing. In this work, we perform extensive experiments to compare state-of-the-art SPARQL endpoint federation systems using the comprehensive performance evaluation framework FedBench. In addition to considering the tradition query runtime as an evaluation criterion, we extend the scope of our performance evaluation by considering criteria, which have not been paid much attention to in previous studies. In particular, we consider the number of sources selected, the total number of SPARQL ASK requests used, the completeness of answers as well as the source selection time. Yet, we show that they have a significant impact on the overall query runtime of existing systems. Moreover, we extend FedBench to mirror a highly distributed data environment and assess the behavior of existing systems by using the same performance criteria. As the result we provide a detailed analysis of the experimental outcomes that reveal novel insights for improving current and future SPARQL federation systems."
  journal_nuzzolese_1,1,"Andrea Giovanni Nuzzolese, Valentina Presutti, Aldo Gangemi, Silvio Peroni and Paolo Ciancarini",nuzzolese,Aemoo: Linked Data exploration based on Knowledge Patterns,journal,Search (II),3,Andrea Giovanni Nuzzolese,journal_nuzzolese_1.pdf,503,2016-10-20T15:30:00,2016-10-20T16:50:00,"This paper presents a novel approach to Linked Data exploration that uses Encyclopedic Knowledge Patterns (EKPs) as relevance criteria for selecting, organising, and visualising knowledge. EKP are discovered by mining the linking structure of Wikipedia and evaluated by means of a user-based study, which shows that they are cognitively sound as models for building entity summarisations. We implemented a tool named Aemoo that supports EKP-driven knowledge exploration and integrates data coming from heterogeneous resources, namely static and dynamic knowledge as well as text and Linked Data. Aemoo is evaluated by means of controlled, task-driven user experiments in order to assess its usability, and ability to provide relevant and serendipitous information as compared to two existing tools: Google and RelFinder."
  journal_mazumdar_2,2,"Suvodeep Mazumdar, Daniela Petrelli,  Khadija Elbedweihy,  Vitaveska Lanfranchi and Fabio Ciravegna",mazumdar,Affective Graphs: The Visual Appeal of Linked Data,journal,Interaction,4,Suvodeep Mazumdar,journal_mazumdar_2.pdf,503,2016-10-19T11:00:00,2016-10-19T12:20:00,"The essence and value of Linked Data lies in the ability of humans and machines to query, access and reason upon highly structured and formalised data. Ontology structures provide an unambiguous description of the structure and content of data. While a multitude of software applications and visualization systems have been developed over the past years for Linked Data, there is still a significant gap that exists between applications that consume Linked Data and interfaces that have been designed with significant focus on aesthetics. Though the importance of aesthetics in affecting the usability, effectiveness and acceptability of user interfaces have long been recognised, little or no explicit attention has been paid to the aesthetics of Linked Data applications. In this paper, we introduce a formalised approach to developing aesthetically pleasing semantic web interfaces by following aesthetic principles and guidelines identified from literature. We apply such principles to design and develop a generic approach of using visualizations to support exploration of Linked Data, in an interface that is pleasing to users. This provides users with means to browse ontology structures, enriched with statistics of the underlying data, facilitating exploratory activities and enabling visual query for highly precise information needs. We evaluated our approach in three ways: an initial objective evaluation comparing our approach with other well-known interfaces for the semantic web and two user evaluations with semantic web researchers."
  journal_rospocher_8,8,"Marco Rospocher, Marieke van Erp, Piek Vossen, Antske Fokkens, Itziar Aldabe, German Rigau, Aitor Soroa, Thomas Ploeger and Tessel Bogaard",rospocher,Building event-centric knowledge graphs from news,journal,Natural Language Processing,4,Marco Rospocher,journal_rospocher_8.pdf,503,2016-10-21T10:30:00,2016-10-21T11:50:00,"Knowledge graphs have gained increasing popularity in the past couple of years, thanks to their adoption in everyday search engines. Typically, they consist of fairly static and encyclopedic facts about persons and organizations–e.g. a celebrity’s birth date, occupation and family members–obtained from large repositories such as Freebase or Wikipedia. In this paper, we present a method and tools to automatically build knowledge graphs from news articles. As news articles describe changes in the world through the events they report, we present an approach to create Event-Centric Knowledge Graphs (ECKGs) using state-of-the-art natural language processing and semantic web techniques. Such ECKGs capture long-term developments and histories on hundreds of thousands of entities and are complementary to the static encyclopedic information in traditional knowledge graphs. We describe our event-centric representation schema, the challenges in extracting event information from news, our open source pipeline, and the knowledge graphs we have extracted from four different news corpora: general news (Wikinews), the FIFA world cup, the Global Automotive Industry, and Airbus A380 airplanes. Furthermore, we present an assessment on the accuracy of the pipeline in extracting the triples of the knowledge graphs. Moreover, through an event-centered browser and visualization tool we show how approaching information from news in an event-centric manner can increase the user’s understanding of the domain, facilitates the reconstruction of news story lines, and enable to perform exploratory investigation of news hidden facts."""
  journal_gerber_11,11,"Daniel Gerber, Diego Esteves, Jens Lehmann, Lorenz Bühmann, Ricardo Usbeck, Axel-Cyrille Ngonga Ngomo and René Speck",gerber,DeFacto - Temporal and multilingual Deep Fact Validation,journal,Knowledge Graphs,3,Daniel Gerber,journal_gerber_11.pdf,501,2016-10-19T11:00:00,2016-10-19T12:20:00,"One of the main tasks when creating and maintaining knowledge bases is to validate facts and provide sources for them in order to ensure correctness and traceability of the provided knowledge. So far, this task is often addressed by human curators in a three-step process: issuing appropriate keyword queries for the statement to check using standard search engines, retrieving potentially relevant documents and screening those documents for relevant content. The drawbacks of this process are manifold. Most importantly, it is very time-consuming as the experts have to carry out several search processes and must often read several documents. In this article, we present DeFacto (Deep Fact Validation)—an algorithm able to validate facts by finding trustworthy sources for them on the Web. DeFacto aims to provide an effective way of validating facts by supplying the user with relevant excerpts of web pages as well as useful additional information including a score for the confidence DeFacto has in the correctness of the input fact. To achieve this goal, DeFacto collects and combines evidence from web pages written in several languages. In addition, DeFacto provides support for facts with a temporal scope, i.e., it can estimate in which time frame a fact was valid. Given that the automatic evaluation of facts has not been paid much attention to so far, generic benchmarks for evaluating these frameworks were not previously available. We thus also present a generic evaluation framework for fact checking and make it publicly available."
  journal_mccrae_7,7,"John P. McCrae, Mihael Arcan, Kartik Asooja, Jorge Gracia, Paul Buitelaar and Philipp Cimiano",mccrae,Domain Adaptation for Ontology Localization,journal,Multilinguality,4,John P. McCrae,journal_mccrae_7.pdf,501,2016-10-19T14:00:00,2016-10-19T15:20:00,"Ontology localization is the task of adapting an ontology to a different cultural context, and has been identified as an important task in the context of the Multilingual Semantic Web vision. The key task in ontology localization is translating the lexical layer of an ontology, i.e., its labels, into some foreign language. For this task, we hypothesize that the translation quality can be improved by adapting a machine translation system to the domain of the ontology. To this end, we build on the success of existing statistical machine translation (SMT) approaches, and investigate the impact of different domain adaptation techniques on the task. In particular, we investigate three techniques: (i) enriching a phrase table by domain-specific translation candidates acquired from existing Web resources, (ii) relying on Explicit Semantic Analysis as an additional technique for scoring a certain translation of a given source phrase, as well as (iii) adaptation of the language model by means of weighting n-grams with scores obtained from topic modelling. We present in detail the impact of each of these three techniques on the task of translating ontology labels. We show that these techniques have a generally positive effect on the quality of translation of the ontology and that, in combination, they provide a significant improvement in quality. "
  journal_arenas_12,12,"Marcelo Arenas, Bernardo Cuenca Grau, Evgeny Kharlamov, Šarūnas Marciuška and Dmitriy Zheleznyakov",arenas,Faceted search over RDF-based knowledge graphs,journal,Search (II),2,Marcelo Arenas,journal_arenas_12.pdf,503,2016-10-20T15:30:00,2016-10-20T16:50:00,"Knowledge graphs such as Yago and Freebase have become a powerful asset for enhancing search, and are being intensively used in both academia and industry. Many existing knowledge graphs are either available as Linked Open Data, or they can be exported as RDF datasets enhanced with background knowledge in the form of an OWL 2 ontology. Faceted search is the de facto approach for exploratory search in many online applications, and has been recently proposed as a suitable paradigm for querying RDF repositories. In this paper, we provide rigorous theoretical underpinnings for faceted search in the context of RDF-based knowledge graphs enhanced with OWL 2 ontologies. We identify well-defined fragments of SPARQL that can be naturally captured using faceted search as a query paradigm, and establish the computational complexity of answering such queries. We also study the problem of updating faceted interfaces, which is critical for guiding users in the formulation of meaningful queries during exploratory search. We have implemented our approach in a fully-fledged faceted search system, SemFacet, which we have evaluated over the Yago knowledge graph."
  journal_vandenbussche_3,3,"Pierre-Yves Vandenbussche, Ghislain A. Atemezing, Maria Poveda and Bernard Vatant",vandenbussche,Linked Open Vocabularies (LOV): a gateway to reusable semantic vocabularies on the Web,journal,Ontologies (I),1,Pierre-Yves Vandenbussche,journal_vandenbussche_3.pdf,501,2016-10-20T15:30:00,2016-10-20T16:50:00,"One of the major barriers to the deployment of Linked Data is the difficulty that data publishers have in determining which vocabularies to use to describe the semantics of data. This system report describes Linked Open Vocabularies (LOV), a high quality catalogue of reusable vocabularies for the description of data on the Web. The LOV initiative gathers and makes visible indicators that have not been previously harvested such as the interconnections between vocabularies, version history along with past and current referent (individual or organization). The report details the various components of the system along with some innovations such as the introduction of a property-level boost in the vocabulary search scoring which takes into account the property's type (e.g rdfs:label, dc:comment) associated with a matching literal value. By providing an extensive range of data access methods (full-text search, SPARQL endpoint, API, data dump or UI), the project aims at facilitating the reuse of well-documented vocabularies in the Linked Data ecosystem. The adoption of LOV by many applications and methods shows the importance of such a set of vocabularies and related features for the ontology design activity and the publication of data on the Web."
  journal_calvanese_4,4,"Diego Calvanese, Benjamin Cogrel, Sarah Komla-Ebri, Roman Kontchakov, Davide Lanti, Martin Rezk, Mariano Rodriguez-Muro and Guohui Xiao",calvanese,Ontop: Answering SPARQL queries over relational databases,journal,Querying/SPARQL (II),3,Diego Calvanese,journal_calvanese_4.pdf,502,2016-10-21T13:30:00,2016-10-21T14:50:00,"We present Ontop, an open-source Ontology-Based Data Access (OBDA) system that allows for querying relational data sources through a conceptual representation of the domain of interest, provided in terms of an ontology, to which the data sources are mapped. Key features of Ontop are its solid theoretical foundations, a virtual approach to OBDA, which avoids materializing triples and is implemented through the query rewriting technique, extensive optimizations exploiting all elements of the OBDA architecture, its compliance to all relevant W3C recommendations (including SPARQL queries, R2RML mappings, and OWL 2 QL and RDFS ontologies), and its support for all major relational databases."
  journal_lephuoc_9,9,Danh Le-Phuoc,lephuoc,Operator-aware approach for boosting performance in RDF stream processing,journal,Streams,3,Danh Le-Phuoc,journal_lephuoc_9.pdf,501,2016-10-20T13:30:00,2016-10-20T14:50:00,"To enable efficiency in stream processing, the evaluation of a query is usually performed over bounded parts of (potentially) unbounded streams, i.e., processing windows “slide” over the streams. To avoid inefficient re-evaluations of already evaluated parts of a stream in respect to a query, incremental evaluation strategies are applied, i.e., the query results are obtained incrementally from the result set of the preceding processing state without having to re-evaluate all input buffers. This method is highly efficient but it comes at the cost of having to maintain processing state, which is not trivial, and may defeat performance advantages of the incremental evaluation strategy. In the context of RDF streams the problem is further aggravated by the hard-to-predict evolution of the structure of RDF graphs over time and the application of sub-optimal implementation approaches, e.g., using relational technologies for storing data and processing states which incur significant performance drawbacks for graph-based query patterns. To address these performance problems, this paper proposes a set of novel operator-aware data structures coupled with incremental evaluation algorithms which outperform the counterparts of relational stream processing systems. This claim is demonstrated through extensive experimental results on both simulated and real datasets."
  journal_zaveri_5,5,"Amrapali Zaveri, Anisa Rula, Andrea Maurino, Ricardo Pietrobon, Jens Lehmann and Sören Auer",zaveri,Quality Assessment for Linked Data: A Survey,journal,Linked Data Measurement,4,Amrapali Zaveri,journal_zaveri_5.pdf,503,2016-10-20T13:30:00,2016-10-20T14:50:00,"The development and standardization of semantic web technologies has resulted in an unprecedented volume of data being published on the Web as Linked Data (LD). However, we observe widely varying data quality ranging from extensively curated datasets to crowdsourced and extracted data of relatively low quality. In this article, we present the results of a systematic review of approaches for assessing the quality of LD. We gather existing approaches and analyze them qualitatively. In particular, we unify and formalize commonly used terminologies across papers related to data quality and provide a comprehensive list of 18 quality dimensions and 69 metrics. Additionally, we qualitatively analyze the 30 core approaches and 12 tools using a set of attributes. The aim of this article is to provide researchers and data curators a comprehensive understanding of existing work, thereby encouraging further experimentation and development of new approaches focused towards data quality, specifically for LD."
  journal_vegagorgojo_10,10,"Guillermo Vega-Gorgojo, Laura Slaughter, Martin Giese, Simen Heggestøyl, Ahmet Soylu and Arild Waaler",vegagorgojo,Visual query interfaces for semantic datasets: an evaluation study,journal,Interaction,3,Guillermo Vega-Gorgojo,journal_vegagorgojo_10.pdf,503,2016-10-19T11:00:00,2016-10-19T12:20:00,"The rapid growth of the Linked Open Data cloud, as well as the increasing ability to lift relational enterprise datasets to a semantic, ontology-based level means that vast amounts of information are now available in a representation that closely matches the conceptualizations of the potential users of this information. This makes it interesting to create ontology based, user-oriented tools for searching and exploring this data. Although initial efforts were intended for tech users with knowledge of SPARQL/RDF, there are ongoing proposals designed for lay users. One of the most promising approaches is to use visual query interfaces, but more user studies are needed to assess their effectiveness. In this paper, we compare the effect on usability of two important paradigms for ontology-based query interfaces: form-based and graph-based interfaces. In order to reduce the number of variables affecting the comparison, we performed a user study with two state-of-the-art query tools developed by ourselves, sharing a large part of the code base: the graph-based tool OptiqueVQS*, and the form-based tool PepeSearch. We evaluated these tools in a formal comparison study with 15 participants searching a Linked Open Data version of the Norwegian Company Registry. Participants had to respond to 6 non-trivial search tasks using alternately OptiqueVQS* and PepeSearch. Even without previous training, retrieval performance and user confidence were very high, thus suggesting that both interface designs are effective for searching RDF datasets. Expert searchers had a clear preference for the graph-based interface, and mainstream searchers obtained better performance and confidence with the form-based interface. While a number of participants spontaneously praised the capability of the graph interface for composing complex queries, our results evidence that graph interfaces are difficult to grasp. In contrast, form interfaces are more learnable and relieve problems with disorientation for mainstream users. We have also observed positive results introducing faceted search and dynamic term suggestion in semantic search interfaces."
  poster_takatsuki_10,10,"Terue Takatsuki, Mikako Saito, Sadahiro Kumagai, Eiki Takayama, Kazuya Ohshima, Nozomu Ohshiro, Kai Lenz, Nobuhiko Tanaka, Norio Kobayashi and Hiroshi Masuya",takatsuki,A RDF based Portal of Biological Phenotype Data produced in Japan,poster,Poster,,Terue Takatsuki,paper10.pdf,3rd Floor,2016-10-19T18:00:00,2016-10-19T21:00:00,
  poster_yu_70,70,"Ran Yu, Besnik Fetahu, Ujwal Gadiraju and Stefan Dietze",yu,A Survey on Challenges in Web Markup Data for Entity Retrieval,poster,Poster,,Ran Yu,paper70.pdf,3rd Floor,2016-10-19T18:00:00,2016-10-19T21:00:00,
  poster_yoon_85,85,"Seungjun Yoon, Sejin Chun, Xiongnan Jin and Kyong-Ho Lee",yoon,A Unified Interface for Optimizing Continuous Query in Heterogeneous RDF Stream Processing Systems,poster,Poster,,Seungjun Yoon,paper85.pdf,3rd Floor,2016-10-19T18:00:00,2016-10-19T21:00:00,
  
negative.code: is the first RDCQA system and achieves a global F 1 score of 0.43 on the QALD6T3-test dataset, showing that RDCQA is feasible."
  research_ibragimov_7,7,"Dilshod Ibragimov, Katja Hose, Torben Bach Pedersen and Esteban Zimanyi",ibragimov,Optimizing Aggregate SPARQL Queries using Materialized RDF Views,research,Querying,3,Dilshod Ibragimov,paper_M127_.pdf,502,2016-10-19T14:00:00,2016-10-19T15:20:00,"During the past couple of years, more and more data has been published as native RDF datasets. In this setup, both the size of the datasets and the need to process aggregate queries represent challenges for standard SPARQL query processing techniques. To overcome these limitations, materialized views can be created and used as a source of precomputed partial results during query processing. However, materialized view techniques, as proposed in relational databases, do not support RDF specifics, such as incompleteness and the need to support implicit (derived) information. Therefore, to overcome these challenges, this paper proposes MARVEL – the approach consisting of a view selection algorithm based on an RDF-specific cost model, a view definition syntax. and an algorithm for rewriting SPARQL queries using materialized RDF views. The experimental evaluation shows that the approach can improve query response time by more than an order of magnitude and is able to efficiently handle RDF specifics."
  research_inants_3,3,"Armen Inants, Manuel Atencia and Jérôme Euzenat",inants,Algebraic calculi for weighted ontology alignments,research,Ontology Matching,1,Armen Inants,paper_M149_.pdf,503,2016-10-20T10:30:00,2016-10-20T11:50:00,"Alignments between ontologies usually come with numerical attributes expressing the confidence of each correspondence. Semantics supporting such confidences must generalise the semantics of alignments without confidence. There exists a semantics which satisfies this but introduces a discontinuity between weighted and non-weighted interpretations. Moreover, it does not provide a calculus for reasoning with weighted ontology alignments. This paper introduces a calculus for such alignments. It is given by an infinite relation-type algebra, the elements of which are weighted taxonomic relations. In addition, it approximates the non-weighted case in a continuous manner."
  research_krotzsch_24,24,Markus Krötzsch and Veronika Thost,krotzsch,Ontologies for Knowledge Graphs: Breaking the Rules,research,Knowledge Representation,2,Markus Krötzsch ,paper_M303_.pdf,502,2016-10-19T11:00:00,2016-10-19T12:20:00,"Large-scale knowledge graphs (KGs) abound in industry and academia.
  They provide a unified format for integrating information sources,
  aided by standards such as, e.g., the W3C RDB to RDF Mapping Language.
  Meaningful semantic integration, however, is much harder than
  syntactic alignment. Ontologies could be an interoperable and
  declarative solution to this task. At a closer look, however, we find
  that popular ontology languages, such as OWL and Datalog, cannot
  express even the most basic relationships on the normalised data
  format of KGs. Existential rules are more powerful, but may make
  reasoning undecidable, and normalising them to suit KGs can destroy
  syntactic restrictions that ensure decidability and low complexity. We
  study this issue for several classes of existential rules and derive more
  general syntactic criteria to recognise well-behaved rule-based ontologies
  over knowledge graphs."
  research_megdiche_15,15,"Imen Megdiche, Olivier Teste and Cassia Trojahn",megdiche,An Extensible Linear Approach For Holistic Ontology Matching,research,Ontology Matching,2,Imen Megdiche,paper_M78_.pdf,503,2016-10-20T10:30:00,2016-10-20T11:50:00,"Resolving the semantic heterogeneity in the semantic web requires finding correspondences between ontologies describing resources. In particular, with the explosive growth of data sets in the Linked Open Data, linking multiple vocabularies and ontologies simultaneously, known as holistic matching problem, become necessary. Currently, most state-of-the-art matching approaches are limited to pairwise matching. In this paper, we propose an approach for holistic ontology matching that is modeled through a linear program extending the maximum-weighted graph matching problem with linear constraints (cardinality, structural, and coherence constraints). Our approach guarantees the optimal solution with mostly coherent alignments. To evaluate our proposal, we discuss the results of experiments performed on the Conference track of the OAEI 2015, under both holistic and pairwise matching settings."
  