dc.contributor.author | Baltag, Alexandru | |
dc.contributor.author | Li, Dazhu | |
dc.contributor.author | Pedersen, Mina Young | |
dc.date.accessioned | 2023-04-03T11:54:10Z | |
dc.date.available | 2023-04-03T11:54:10Z | |
dc.date.created | 2022-04-04T12:30:45Z | |
dc.date.issued | 2022 | |
dc.identifier.issn | 0925-8531 | |
dc.identifier.uri | https://hdl.handle.net/11250/3061813 | |
dc.description.abstract | Formal learning theory formalizes the process of inferring a general result from examples, as in the case of inferring grammars from sentences when learning a language. In this work, we develop a general framework—the supervised learning game—to investigate the interaction between Teacher and Learner. In particular, our proposal highlights several interesting features of the agents: on the one hand, Learner may make mistakes in the learning process, and she may also ignore the potential relation between different hypotheses; on the other hand, Teacher is able to correct Learner’s mistakes, eliminate potential mistakes and point out the facts ignored by Learner. To reason about strategies in this game, we develop a modal logic of supervised learning and study its properties. Broadly, this work takes a small step towards studying the interaction between graph games, logics and formal learning theory. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Springer | en_US |
dc.title | A Modal Logic for Supervised Learning | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | acceptedVersion | en_US |
dc.rights.holder | Copyright 2022 Springer | en_US |
cristin.ispublished | true | |
cristin.fulltext | postprint | |
cristin.qualitycode | 1 | |
dc.identifier.doi | 10.1007/s10849-022-09359-w | |
dc.identifier.cristin | 2015121 | |
dc.source.journal | Journal of Logic, Language and Information | en_US |
dc.source.pagenumber | 213-234 | en_US |
dc.identifier.citation | Journal of Logic, Language and Information. 2022, 31, 213-234. | en_US |
dc.source.volume | 31 | en_US |