On the upcoming Monday (04.07.2016), AKSW group will discuss topics related to Semantic Web and Big Data as well as programming languages and code quality. In particular, the following papers will be presented by Tim Ermilov.

  • S2RDF: RDF Querying with SPARQL on Spark (Alexander Schätzle et al.)
  • A Large Scale Study of Programming Languages and Code Quality in Github (Baishakhi Ray et al.)

This year’s SEMANTiCS conference which is taking place between September 12 – 15, 2016 in Leipzig recently invited for the submission of research papers on semantic technologies. Several AKSW members seized the opportunity and got their submitted papers accepted for presentation at the conference.

These are listed below:

  • Executing SPARQL queries over Mapped Document Stores with SparqlMap-M (Jörg Unbehauen, Michael Martin )
  • Distributed Collaboration on RDF Datasets Using Git: Towards the Quit Store (Natanael Arndt, Norman Radtke and Michael Martin)
  • Towards Versioning of Arbitrary RDF Data (Marvin Frommhold, Ruben Navarro Piris, Natanael Arndt, Sebastian Tramp, Niklas Petersen and Michael Martin)
  • DBtrends: Exploring query logs for ranking RDF data (Edgard Marx, Amrapali Zaveri, Diego Moussallem and Sandro Rautenberg)
  • MEX Framework: Automating Machine Learning Metadata Generation (Diego Esteves, Pablo N. Mendes, Diego Moussallem, Julio Cesar Duarte, Maria Claudia Cavalcanti, Jens Lehmann, Ciro Baron Neto and Igor Costa)

In the next Colloquium, June the 27th at 3 PM, two papers will be presented:

When owl:sameAs isn’t the Same: An Analysis of Identity in Linked Data
André Valdestilhas will present the paper “When owl:sameAs isn’t the Same: An Analysis of Identity in Linked Data” by Halpin et al.

Towards Versioning for Arbitrary RDF Data
Afterwards, Marvin Frommhold will practice the presentation of his paper “Towards Versioning for Arbitrary RDF Data” (Marvin Frommhold, Rubén Navarro Piris, Natanael Arndt, Sebastian Tramp, Niklas Petersen, and Michael Martin) which is accepted at the main conference of the Semantics 2016 in Leipzig.


The 12th International Conference on Terminology and Knowledge Engineering (TKE 2016) has announced their invited speakers, including Dr. Sebastian Hellmann, Head of the AKSW/KILT research group at Leipzig University and Executive Director of the DBpedia Association at the Institut for Applied Informatics (InfAI) e.V.. Sebastian Hellman will give a talk on Challenges, Approaches and Future Work for Linguistic Linked Open Data (LLOD).

The theme of the 12th International Conference on Terminology and Knowledge Engineering will be ‘Term Bases and Linguistic Linked Open Data’. So the main aims of TKE 2016 will be to bring together researchers from these related fields, provide an overview of the state-of-the-art, discuss problems and opportunities, and exchange information. TKE 2016 will also cover applications, ongoing and planned activities, industrial uses and needs, as well as requirements coming from the new e-society.

The TKE 2016 conference will take place in Copenhagen, Denmark, between 22-24 June, 2016. Further information about the program and speakers confirmed so far can be found at the conference website.


We are very pleased to report that 4 of our papers were accepted for presentation as full papers at ESWC 2016. These are


Since the first edition held in Granada in 1998, LREC has become one of the the major events on Language Resources (LRs) and Language Technologies (LT). At the 10th edition of the Language Resources and Evaluation Conference (LREC 2016), held from 23-28 May 2016 in Portorož (Slovenia), the AKSW/KILT members Bettina Klimek, Milan Doichinovski and Sebastian Hellmann took active participation. At the conference they presented their most recent research results and project outcomes in the areas of Linked Data and Language Technologies. With over 1250 paper submissions and 744 accepted papers, we are pleased to have contributed to the research field with the following contributions:

  • DBpedia Abstracts: A Large-Scale, Open, Multilingual NLP Training Corpus, by Brümmer, Martin; Dojchinovski, Milan and Hellmann, Sebastian
  • FREME: Multilingual Semantic Enrichment with Linked Data and Language Technologies, by Dojchinovski, Milan; Sasaki, Felix; Gornostaja,Tatjana;  Hellmann, Sebastian; Mannens, Erik; Salliau, Frank; Osella, Michele; Ritchie, Phil; Stoitsis, Giannis; Koidl, Kevin; Ackermann, Markus and Chakraborty, Nilesh
  • Creating Linked Data Morphological Language Resources with MMoOn – The Hebrew Morpheme Inventory, by Klimek, Bettina and Arndt, Natanael and Krause, Sebastian and Arndt, Timotheus
  • The Open Linguistics Working Group: Developing the Linguistic Linked Open Data Cloud, by McCrae, John P.; Chiarcos, Christian; Bond, Francis; Cimiano, Philipp; Declerck, Thierry; de Melo, Gerard; Gracia, Jorge; Hellmann, Sebastian; Klimek, Bettina; Moran, Steven; Osenova, Petya; Pareja-Lora, Antonio and Pool, Jonathan

In the incoming colloquium, Mofeed Hassan will present the paper “Semi-supervised Instance Matching Using Boosted Classifiers” from Kejriwal et al., published in the proceedings of ESWC 2015.

After that, Michael Röder will present his paper “Detecting Similar Linked Datasets Using Topic Modelling” that has been accepted by the upcoming ESWC 2016.


In this week’s colloquium Bettina Klimek will give a practice talk of the paper ‘Creating Linked Data Morphological Language Resources with MMoOn – The Hebrew Morpheme Inventory‘, which she will present at the LREC conference 2016, 23-28 May 2016, Slovenia, Portorož.

As a second talk, Muhammad Saleem will present his thesis titled “Efficient Source Selection For SPARQL Endpoint Federation” . This thesis addresses two key areas of federated SPARQL query processing: (1) efficient source selection, and (2) comprehensive SPARQL benchmarks to test and ranked federated SPARQL engines as well as triple stores.


In this colloquium, Frank Nietzsche will present his master thesis titled “Game Theory- distributed solving”

Game theory analyzes the behavior of individuals in complex situations. One popular game in Europe and North America with such a complex situation is Skat. For the analysis of the game, the counterfactual regret minimization algorithm (CFR algorithm) was applied. Unfortunately, there is no guarantee that the algorithm works in three-person games. In general, it is difficult to solve three-person games. In addition, the algorithm calculates only a epsilon-Nash equilibrium. But for Skat, the Perfect Bayesian equilibrium would be a better solution. In fact, the Perfect Bayesian equilibrium is a subset of the Nash equilibrium. This raises the question of whether a Perfect Bayesian equilibrium can be calculated using the CFR algorithm. The analysis of this problem will be the last part of the presentation.