VeriLinks: verifying links in an arbitrary linkset

VeriLinks is a light-weight platform for creating games to verify links in an arbitrary linkset. Agreement among players on the validity of a link is rewarded by coins or points. Depending on the specific game, those are then used to fight against enemy invadors in a tower defense style game or to battle using space ships. VeriLinks automatically balances the game such that the questions match the user's strength and the rewards match the difficulty of questions. VeriLinks features an admin console, which allows to create new games from a linkset by specifying the respective SPARQL endpoints, a template (for visual presentation) and the linkset itself.

Homepage Source Code

Experiment 2012: Can we create better links by playing games?

In 2012, we officially released Veri Links and started a survey, which we distributed on Linked Data and Semantic Web mailing lists. We recorded in-game statistics and survey answers to obtain a clearer picture on the usefulness of games, in particular VeriLinks, for interlinking. The results and accompanying material for the experiments are available here:

Remark: Since people participated in the survey and played the game outside of the 3-day experiment phase, the raw data above are updated versions of those in the report.

Survey Winners (those who agreed that we can publish their names): Gianluca Demartini, Kingsley Idehen, Joe Montibello, Michael Röder, Jakub Kotowski, Thomas Efer, Virginia Knight, Ruby, Florent Jochaud

Project Team

Former Members


SML-Bench 0.2 Released ( 2017-05-11T13:01:45+02:00 by Patrick Westphal)

2017-05-11T13:01:45+02:00 by Patrick Westphal

Dear all, we are happy to announce the 0.2 release of SML-Bench, our Structured Machine Learning benchmark framework. SML-Bench provides full benchmarking scenarios for inductive supervised machine learning covering different knowledge representation languages like OWL and Prolog. Read more about "SML-Bench 0.2 Released"

AKSW Colloquium, 08.05.2017, Scalable RDF Graph Pattern Matching ( 2017-05-08T09:42:49+02:00 by Lorenz Bühmann)

2017-05-08T09:42:49+02:00 by Lorenz Bühmann

At the AKSW Colloquium, on Monday 8th of May 2017, 3 PM, Lorenz Bühmann will discuss a paper titled “Type-based Semantic Optimization for Scalable RDF Graph Pattern Matching” of Kim et al. Read more about "AKSW Colloquium, 08.05.2017, Scalable RDF Graph Pattern Matching"

ESWC 2017 accepted two Demo Papers by AKSW members ( 2017-04-19T10:19:43+02:00 Christopher Schulz)

2017-04-19T10:19:43+02:00 Christopher Schulz

Hello Community! The 14th ESWC, which takes place from May 28th to June 1st 2017 in Portoroz, Slovenia, accepted two demos to be presented at the conference. Read more about them in the following:                                                                         1. Read more about "ESWC 2017 accepted two Demo Papers by AKSW members"

AKSW Colloquium, 10.04.2017, GeoSPARQL on geospatial databases ( 2017-04-07T10:43:55+02:00 by Dr. Matthias Wauer)

2017-04-07T10:43:55+02:00 by Dr. Matthias Wauer

At the AKSW Colloquium, on Monday 10th of April 2017, 3 PM, Matthias Wauer will discuss a paper titled “Ontop of Geospatial Databases“. Read more about "AKSW Colloquium, 10.04.2017, GeoSPARQL on geospatial databases"

AKSW Colloquium, 03.04.2017, RDF Rule Mining ( 2017-03-31T13:39:28+02:00 TommasoSoru)

2017-03-31T13:39:28+02:00 TommasoSoru

At the AKSW Colloquium, on Monday 3rd of April 2017, 3 PM, Tommaso Soru will present the state of his ongoing research titled “Efficient Rule Mining on RDF Data”, where he will introduce Horn Concerto, a novel scalable SPARQL-based approach … Continue reading → Read more about "AKSW Colloquium, 03.04.2017, RDF Rule Mining"