Learning regular sets from queries and counterexamples
Information and Computation
Dynamic Epistemic Logic
The complexity of reachability in randomized sabotage games
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Moving in a network under random failures: A complexity analysis
Science of Computer Programming
Connectivity games over dynamic networks
Theoretical Computer Science
| Hi-index | 0.00 |
In formal approaches to inductive learning, the ability to learn is understood as the ability to single out a correct hypothesis from a range of possibilities. Although most of the existing research focuses on the characteristics of the learner, in many paradigms the significance of the teacher's abilities and strategies is in fact undeniable. Motivated by this observation, this paper highlights the interactive nature of learning by showing its relation with games. We show how learning can be seen as a sabotage-type game between Teacher and Learner, and we present different variants based on the level of cooperativeness and the actions available to the players, characterizing the existence of winning strategies by formulas of Sabotage Modal Logic and analyzing their complexity. We also give a two-way conceptual account of how to further combine games and learning: we propose to use game theory to analyze the grammar inference approach, and moreover, we indicate that existing inductive inference games can be analyzed using learning theory tools. Our work aims at unifying game-theoretical and logical approach to formal learning theory.