scispace - formally typeset
Open AccessJournal Article

DL-Learner: Learning Concepts in Description Logics

Jens Lehmann
- 01 Dec 2009 - 
- Vol. 10, Iss: 91, pp 2639-2642
Reads0
Chats0
TLDR
DL-Learner is a framework for learning in description logics and OWL, a cross-platform framework implemented in Java that allows easy programmatic access and provides a command line interface, a graphical interface as well as a WSDL-based web service.
Abstract
In this paper, we introduce DL-Learner, a framework for learning in description logics and OWL. OWL is the official W3C standard ontology language for the Semantic Web. Concepts in this language can be learned for constructing and maintaining OWL ontologies or for solving problems similar to those in Inductive Logic Programming. DL-Learner includes several learning algorithms, support for different OWL formats, reasoner interfaces, and learning problems. It is a cross-platform framework implemented in Java. The framework allows easy programmatic access and provides a command line interface, a graphical interface as well as a WSDL-based web service.

read more

Citations
More filters
Journal ArticleDOI

A Review of Relational Machine Learning for Knowledge Graphs

TL;DR: This paper provides a review of how statistical models can be “trained” on large knowledge graphs, and then used to predict new facts about the world (which is equivalent to predicting new edges in the graph) and how such statistical models of graphs can be combined with text-based information extraction methods for automatically constructing knowledge graphs from the Web.
Proceedings ArticleDOI

AMIE: association rule mining under incomplete evidence in ontological knowledge bases

TL;DR: This paper develops a rule mining model that is explicitly tailored to support the open world assumption (OWA), and is inspired by association rule mining and introduces a novel measure for confidence.
Journal ArticleDOI

Fast rule mining in ontological knowledge bases with AMIE

TL;DR: This paper shows how the approach AMIE (Galárraga et al. in WWW, 2013) can be optimized to mine even larger KBs with more than 12M statements, and extends to areas of mining that were previously beyond reach.
Book ChapterDOI

LinkedGeoData: Adding a Spatial Dimension to the Web of Data

TL;DR: This paper elaborates on how the collaboratively collected OpenStreetMap data can be transformed and represented adhering to the RDF data model and describes how it can be made accessible for machines according to the linked data paradigm and for humans by means of a faceted geo-data browser.
Book ChapterDOI

Statistical schema induction

TL;DR: This paper presents a statistical approach to the induction of expressive schemas from large RDF repositories and describes in detail the implementation and report on an evaluation that was conducted using several data sets including DBpedia.
References
More filters
BookDOI

The Description Logic Handbook: Theory, Implementation and Applications

TL;DR: The Description Logic Handbook as mentioned in this paper provides a thorough account of the subject, covering all aspects of research in this field, namely: theory, implementation, and applications, and can also be used for self-study or as a reference for knowledge representation and artificial intelligence courses.
Book

The Description Logic Handbook

TL;DR: This introduction presents the main motivations for the development of Description Logics as a formalism for representing knowledge, as well as some important basic notions underlying all systems that have been created in the DL tradition.
Book

Ontology Learning from Text: Methods, Evaluation and Applications

TL;DR: This volume presents current research in ontology learning, addressing three perspectives, including methodologies that have been proposed to automatically extract information from texts and to give a structured organization to such knowledge, including approaches based on machine learning techniques.
Book ChapterDOI

A Refinement Operator for Description Logics

TL;DR: In this article, a complete and proper refinement operator for the ALER description logic has been constructed, and it has been shown that all refinement steps for ALER cannot be locally finite, except the ones that introduce the ⊥ concept.
Book ChapterDOI

A refinement operator based learning algorithm for the ALC description logic

TL;DR: This paper provides the first learning algorithm based on refinement operators for the most fundamental description logic ALC, and develops the algorithm from thorough theoretical foundations and reports on a prototype implementation.
Related Papers (5)