Learning Tree Automata with Term Rewriting
Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence. Main Track. Pages 3926-3934.
https://doi.org/10.24963/ijcai.2026/437
Keywords
- Knowledge Representation and Reasoning: Automated reasoning and theorem proving
- Knowledge Representation and Reasoning: Learning and reasoning
Abstract
We present an extension of the Angluin-style learning algorithm for tree automata that incorporates deductive inference.
The learning algorithm is provided with a term rewriting system that specifies properties of the target tree language (e.g., the order of subtrees under a symbol f is irrelevant).
This term rewriting system is used to infer answers to some queries, which reduces the query complexity of the learning algorithm.
We present examples of rewrite systems that express natural properties of tree-structured data, which yield a significant reduction in the number of queries.
@inproceedings{ijcai2026p437,
title = {Learning Tree Automata with Term Rewriting},
author = {Kopystiański, Jakub and Otop, Jan},
booktitle = {Proceedings of the Thirty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-26}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Diego Calvanese},
pages = {3926--3934},
year = {2026},
month = {8},
note = {Main Track},
doi = {10.24963/ijcai.2026/437},
url = {https://doi.org/10.24963/ijcai.2026/437},
}
TY - CPAPER TI - Learning Tree Automata with Term Rewriting AU - Kopystiański, Jakub AU - Otop, Jan T2 - Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-26 PB - International Joint Conferences on Artificial Intelligence Organization PY - 2026 SP - 3926 EP - 3934 DO - 10.24963/ijcai.2026/437 UR - https://doi.org/10.24963/ijcai.2026/437 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
