Semantic Games for Algorithmic Players

Abstract

We describe a class of semantic extensive entailment game with algorithmic players, related to game-theoretic semantics, and generalized to classical first-order semantic entailment. Players have preferences for parsimonious spending of computational resources, and compute partial strategies, under qualitative uncertainty about future histories. We prove the existence of local preferences for moves, and strategic fixpoints, that allow to map eeg game-tree to the building rules and closure rules of Smullyan's semantic tableaux. We also exhibit a strategy profile that solves the fixpoint selection problem, and can be mapped to systematic constructions of semantic trees, yielding a completeness result by translation. We conclude on possible generalizations of our games.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2020-01-13

Downloads
8 (#1,345,183)

6 months
13 (#219,908)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Justine Jacot
Lund University
Emmanuel Genot
Lund University