Minimal Macro-Based Rewritings of Formal Languages: Theory and Applications in Ontology Engineering (and Beyond)
Abstract
In this paper, we introduce the problem of rewriting finite formal languages using syntactic macros such that the rewriting is minimal in size. We present polynomial-time algorithms to solve variants of this problem and show their correctness. To demonstrate the practical relevance of the proposed problems and the feasibility and effectiveness of our algorithms in practice, we apply these to biomedical ontologies authored in OWL. We find that such rewritings can significantly reduce the size of ontologies by capturing repeated expressions with macros. This approach not only offers valuable assistance in enhancing ontology quality and comprehension but can also be seen as a general methodology for evaluating features of rewriting systems (including syntactic macros, templates, or other forms of rewriting rules), which can be analyzed in terms of their influence on computational problems.
Cite
Text
Kindermann et al. "Minimal Macro-Based Rewritings of Formal Languages: Theory and Applications in Ontology Engineering (and Beyond)." AAAI Conference on Artificial Intelligence, 2024. doi:10.1609/AAAI.V38I9.28928Markdown
[Kindermann et al. "Minimal Macro-Based Rewritings of Formal Languages: Theory and Applications in Ontology Engineering (and Beyond)." AAAI Conference on Artificial Intelligence, 2024.](https://mlanthology.org/aaai/2024/kindermann2024aaai-minimal/) doi:10.1609/AAAI.V38I9.28928BibTeX
@inproceedings{kindermann2024aaai-minimal,
title = {{Minimal Macro-Based Rewritings of Formal Languages: Theory and Applications in Ontology Engineering (and Beyond)}},
author = {Kindermann, Christian and George, Anne-Marie and Parsia, Bijan and Sattler, Uli},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2024},
pages = {10581-10588},
doi = {10.1609/AAAI.V38I9.28928},
url = {https://mlanthology.org/aaai/2024/kindermann2024aaai-minimal/}
}