# Semantic Labelling in Practice

Source: [Semantic Labelling in Practice](<https://www.sota2.com/research/paper/6a45f089dc71372d7795a2bf>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-07-03T05:00:04.967Z

Authors: Dieter Hofbauer, Johannes Waldmann

Published: 2026-07-01T07:07:55.000Z

## Abstract

Automating semantic labelling for termination proofs is a combinatorially hard problem since the number of algebras grows prohibitively large even for small domains. We report on experiments with our tools Matchbox and MnM, comparing various model finding strategies: exhaustive enumeration for bounded domain sizes within restricted search spaces, and semantic context-closure for fixed algebras.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2607.00521>)

[PDF](<https://arxiv.org/pdf/2607.00521.pdf>)
