English

An Algebraic Approach to Learning and Grounding

Computation and Language 2022-07-05 v2 Formal Languages and Automata Theory Logic in Computer Science

Abstract

We consider the problem of learning the semantics of composite algebraic expressions from examples. The outcome is a versatile framework for studying learning tasks that can be put into the following abstract form: The input is a partial algebra \alg\alg and a finite set of examples (φ1,O1),(φ2,O2),(\varphi_1, O_1), (\varphi_2, O_2), \ldots, each consisting of an algebraic term φi\varphi_i and a set of objects~OiO_i. The objective is to simultaneously fill in the missing algebraic operations in \alg\alg and ground the variables of every φi\varphi_i in OiO_i, so that the combined value of the terms is optimised. We demonstrate the applicability of this framework through case studies in grammatical inference, picture-language learning, and the grounding of logic scene descriptions.

Keywords

Cite

@article{arxiv.2204.02813,
  title  = {An Algebraic Approach to Learning and Grounding},
  author = {Johanna Björklund and Adam Dahlgren Lindström and Frank Drewes},
  journal= {arXiv preprint arXiv:2204.02813},
  year   = {2022}
}

Comments

Accepted to LearnAut 2022 at ICALP 2022

R2 v1 2026-06-24T10:39:50.291Z