{"type":"ScholarlyArticle","title":"Learning Tree Automata with Term Rewriting","authors":[{"name":"Jakub Kopystiański","slug":"jakub-kopystianski","given":"Jakub","family":"Kopystiański","affiliation":""},{"name":"Jan Otop","slug":"jan-otop","given":"Jan","family":"Otop","affiliation":""}],"abstract":"We present an extension of the Angluin-style learning algorithm for tree automata that incorporates deductive inference. \r\nThe 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). \r\nThis term rewriting system is used to infer answers to some queries, which reduces the query complexity of the learning algorithm. \r\nWe present examples of rewrite systems that express natural properties of tree-structured data, which yield a significant reduction in the number of queries.","doi":"10.24963/ijcai.2026/437","url":"https://ijcai.org/proceedings/2026/437","pdf":"https://ijcai.org/proceedings/2026/0437.pdf","markdown":"https://ijcai.org/proceedings/2026/437.md","bibtex":"https://ijcai.org/proceedings/2026/bibtex/437","volume":{"slug":"2026","title":"Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2026","url":"https://ijcai.org/proceedings/2026/","year":2026,"location":"Bremen, Germany","dates":"15-21 August 2026","editors":"Diego Calvanese","isbn":"978-1-956792-09-6","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2026"},"section":"Knowledge Representation and Reasoning","track":"Main Track","number":437,"pages":{"first":3926,"last":3934},"keywords":["Knowledge Representation and Reasoning: Automated reasoning and theorem proving","Knowledge Representation and Reasoning: Learning and reasoning"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}