Graph-based data models allow for flexible data representation. In particular, semantic data based on RDF and OWL fuels use cases ranging from general knowledge graphs to domain specific knowledge in various technological or scientific domains. The flexibility of such approaches, however, makes programming with semantic data tedious and error-prone. In particular the logics-based data descriptions employed by OWL are problematic for existing error-detecting techniques, such as type systems. In this paper, we present DOTSpa, an advanced integration of semantic data into programming. We embed description logics, the logical foundations of OWL, into the type checking process of a statically typed programming language and provide typed data access through an embedding of the query language SPARQL. In addition, we demonstrate a concrete implementation of the approach, by extending the Scala programming language. We qualitatively compare programs using our approach to equivalent programs using a state-of-the-art library, in terms of how both frameworks aid users in the handling of typical failure scenarios.
Thu 4 AprDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
11:00 - 12:30 | Language Design, Types, and MonadsResearch Papers at Paganini Chair(s): Philipp Haller KTH Royal Institute of Technology, Sweden | ||
11:00 30mTalk | Comprehensive Multiparty Session Types Research Papers Andi Bejleri IBM GBS, Frankfurt, Germany, Elton Domnori Canadian Institute of Technology, Tirana, Albania, Malte Viering TU Darmstadt, Germany, Patrick Eugster Universita della Svizzera Italiana, Switzerland, Mira Mezini TU Darmstadt, Germany Link to publication DOI Pre-print | ||
11:30 30mTalk | Semantic Query Integration With Reason Research Papers Philipp Seifer University of Koblenz-Landau, Germany, Martin Leinberger University of Koblenz-Landau, Germany, Ralf Laemmel University of Koblenz-Landau, Germany, Steffen Staab University of Koblenz-Landau and University of Southampton, Germany Link to publication DOI Pre-print | ||
12:00 30mTalk | One Monad to Prove Them All Research Papers Sandra Dylus University of Kiel, Germany, Jan Christiansen Flensburg University of Applied Sciences, Germany, Finn Teegen University of Kiel, Germany Link to publication DOI Pre-print |