Ontolearn-A Framework for Large-scale OWL Class Expression Learning in Python

• URL: http://arxiv.org/abs/2510.11561v1
• Date: Mon, 13 Oct 2025 16:04:06 GMT
• Title: Ontolearn-A Framework for Large-scale OWL Class Expression Learning in Python
• Authors: Caglar Demir, Alkid Baci, N'Dah Jean Kouagou, Leonie Nora Sieger, Stefan Heindorf, Simon Bin, Lukas Blübaum, Alexander Bigerl, Axel-Cyrille Ngonga Ngomo,
• Abstract summary: Ontolearn is a framework for learning OWL class expressions over large knowledge graphs.<n>A learned OWL class expression can be used to classify instances in the knowledge graph.<n>Ontolearn can be easily used to operate over a remote triplestore.
• Score: 39.28980157397703
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we present Ontolearn-a framework for learning OWL class expressions over large knowledge graphs. Ontolearn contains efficient implementations of recent stateof-the-art symbolic and neuro-symbolic class expression learners including EvoLearner and DRILL. A learned OWL class expression can be used to classify instances in the knowledge graph. Furthermore, Ontolearn integrates a verbalization module based on an LLM to translate complex OWL class expressions into natural language sentences. By mapping OWL class expressions into respective SPARQL queries, Ontolearn can be easily used to operate over a remote triplestore. The source code of Ontolearn is available at https://github.com/dice-group/Ontolearn.

Related papers

• OWLAPY: A Pythonic Framework for OWL Ontology Engineering [7.984370990908576]
  OWLAPY is a comprehensive Python framework for the creation, modification, and serialization of OWL 2.<n>It integrates native Python-based reasoners with support for external Java reasoners, offering flexibility for users.<n> OWLAPY serves as a well-tested software framework for users seeking a flexible Python library for advanced engineering.
  arXiv  Detail & Related papers  (2025-11-11T13:32:14Z)
• Revela: Dense Retriever Learning via Language Modeling [75.19266063851319]
  Revela is a unified training framework for self-supervised retriever learning via language modeling.<n>We evaluate Revela on domain-specific (CoIR), reasoning-intensive (BRIGHT), and general-domain (BEIR) benchmarks.<n>It achieves BEIR's unsupervised SoTA with 1000x less training data and 10x less compute.
  arXiv  Detail & Related papers  (2025-06-19T19:13:59Z)
• Mistral-SPLADE: LLMs for better Learned Sparse Retrieval [7.652738829153342]
  We propose to use decoder-only model for learning semantic keyword expansion. We use Mistral as the backbone to develop our Learned Sparse Retriever similar to SPLADE. Our experiments support the hypothesis that a sparse retrieval model based on decoder only large language model (LLM) surpasses the performance of existing LSR systems.
  arXiv  Detail & Related papers  (2024-08-20T18:21:54Z)
• LBC: Language-Based-Classifier for Out-Of-Variable Generalization [14.033963471962823]
  Large Language Models (LLMs) have great success in natural language processing tasks such as response generation. We find that the pre-trained knowledge of LLMs enables them to interpret new variables that appear in a test without additional training. We propose a Language-Based-Classifier (LBC) to maximize the benefits of LLMs to outperform TMLs on Out-of-Variable tasks.
  arXiv  Detail & Related papers  (2024-08-20T15:05:02Z)
• Automating Knowledge Acquisition for Content-Centric Cognitive Agents Using LLMs [0.0]
  The paper describes a system that uses large language model (LLM) technology to support the automatic learning of new entries in an intelligent agent's semantic lexicon. The process is bootstrapped by an existing non-toy lexicon and a natural language generator that converts formal, ontologically-grounded representations of meaning into natural language sentences.
  arXiv  Detail & Related papers  (2023-12-27T02:31:51Z)
• Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learning [51.90524745663737]
  A key innovation is our use of explanations as features, which can be used to boost GNN performance on downstream tasks. Our method achieves state-of-the-art results on well-established TAG datasets. Our method significantly speeds up training, achieving a 2.88 times improvement over the closest baseline on ogbn-arxiv.
  arXiv  Detail & Related papers  (2023-05-31T03:18:03Z)
• AttriCLIP: A Non-Incremental Learner for Incremental Knowledge Learning [53.32576252950481]
  Continual learning aims to enable a model to incrementally learn knowledge from sequentially arrived data. In this paper, we propose a non-incremental learner, named AttriCLIP, to incrementally extract knowledge of new classes or tasks.
  arXiv  Detail & Related papers  (2023-05-19T07:39:17Z)
• Small-Text: Active Learning for Text Classification in Python [23.87081733039124]
  small-text is an easy-to-use active learning library for Python. It offers pool-based active learning for single- and multi-label text classification.
  arXiv  Detail & Related papers  (2021-07-21T19:23:56Z)
• Mining Knowledge for Natural Language Inference from Wikipedia Categories [53.26072815839198]
  We introduce WikiNLI: a resource for improving model performance on NLI and LE tasks. It contains 428,899 pairs of phrases constructed from naturally annotated category hierarchies in Wikipedia. We show that we can improve strong baselines such as BERT and RoBERTa by pretraining them on WikiNLI and transferring the models on downstream tasks.
  arXiv  Detail & Related papers  (2020-10-03T00:45:01Z)
• Attribute Propagation Network for Graph Zero-shot Learning [57.68486382473194]
  We introduce the attribute propagation network (APNet), which is composed of 1) a graph propagation model generating attribute vector for each class and 2) a parameterized nearest neighbor (NN) classifier. APNet achieves either compelling performance or new state-of-the-art results in experiments with two zero-shot learning settings and five benchmark datasets.
  arXiv  Detail & Related papers  (2020-09-24T16:53:40Z)
• Fuzzy OWL-BOOST: Learning Fuzzy Concept Inclusions via Real-Valued Boosting [0.0]
  We address the problem of fuzzy learning concept axioms that describe sufficient conditions for being an individual instance of T. We present Fuzzy OWL-BOOST that relies on the RealBoost boosting algorithm adapted to the (fuzzy) case.
  arXiv  Detail & Related papers  (2020-08-03T15:19:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.