Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Semantic Games for Algorithmic Players

Författare

Summary, in English

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.

Avdelning/ar

Publiceringsår

2012

Språk

Engelska

Dokumenttyp

Konferensbidrag

Ämne

  • Philosophy

Conference name

Decisions, Games & Logic '12

Conference date

2012-06-29

Status

Published

Forskningsgrupp

  • Lund University Information Quality Research Group (LUIQ)