Semantic Games for Algorithmic Players
(2012) Decisions, Games & Logic '12- Abstract
- We describe a class of semantic extensive entailment game (eeg) with algorithmic players, related to game-theoretic semantics (gts), 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 (st). 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.... (More) - We describe a class of semantic extensive entailment game (eeg) with algorithmic players, related to game-theoretic semantics (gts), 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 (st). 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. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3172562
- author
- Genot, Emmanuel LU and Jacot, Justine LU
- organization
- publishing date
- 2012
- type
- Contribution to conference
- publication status
- published
- subject
- conference name
- Decisions, Games & Logic '12
- conference dates
- 2012-06-29
- language
- English
- LU publication?
- yes
- id
- 93b7d9fd-ee16-4bf1-a6a7-c9153a94496c (old id 3172562)
- date added to LUP
- 2016-04-04 13:05:45
- date last changed
- 2021-03-30 10:45:12
@misc{93b7d9fd-ee16-4bf1-a6a7-c9153a94496c, abstract = {{We describe a class of semantic extensive entailment game (eeg) with algorithmic players, related to game-theoretic semantics (gts), 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 (st). 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<br/><br> result by translation. We conclude on possible generalizations of our games.}}, author = {{Genot, Emmanuel and Jacot, Justine}}, language = {{eng}}, title = {{Semantic Games for Algorithmic Players}}, url = {{https://lup.lub.lu.se/search/files/6051382/3172574.pdf}}, year = {{2012}}, }