We examine a special case of inquiry games and give an account of the informational import of asking questions. We focus on yes-or-no questions, which always carry information about the questioner's strategy, but never about the state of Nature, and show how strategic information reduces uncertainty through inferences about other players' goals and strategies. This uncertainty cannot always be captured by information structures of classical game theory. We conclude by discussing the connection with Gricean pragmatics and contextual constraints on interpretation.

We examine a special case of inquiry games and give an account of the informational import of asking questions. We focus on yes-or-no questions, which always carry information about the questioner's strategy, but never about the state of Nature, and show how strategic information reduces uncertainty through inferences about other players' goals and strategies. This uncertainty cannot always be captured by information structures of classical game theory. We conclude by discussing the connection with Gricean pragmatics and contextual constraints on interpretation.Send (...) article to KindleTo send this article to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle. Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply. Find out more about the Kindle Personal Document Service.HOW CAN QUESTIONS BE INFORMATIVE BEFORE THEY ARE ANSWERED? STRATEGIC INFORMATION IN INTERROGATIVE GAMESVolume 9, Issue 2Emmanuel J. Genot and Justine JacotDOI: https://doi.org/10.1017/epi.2012.8Your Kindle email address Please provide your Kindle [email protected]@kindle.com Available formats PDF Please select a format to send. By using this service, you agree that you will only keep articles for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services. Please confirm that you accept the terms of use. Cancel Send ×Send article to Dropbox To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to Dropbox. HOW CAN QUESTIONS BE INFORMATIVE BEFORE THEY ARE ANSWERED? STRATEGIC INFORMATION IN INTERROGATIVE GAMESVolume 9, Issue 2Emmanuel J. Genot and Justine JacotDOI: https://doi.org/10.1017/epi.2012.8Available formats PDF Please select a format to send. By using this service, you agree that you will only keep articles for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services. Please confirm that you accept the terms of use. Cancel Send ×Send article to Google Drive To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to Google Drive. HOW CAN QUESTIONS BE INFORMATIVE BEFORE THEY ARE ANSWERED? STRATEGIC INFORMATION IN INTERROGATIVE GAMESVolume 9, Issue 2Emmanuel J. Genot and Justine JacotDOI: https://doi.org/10.1017/epi.2012.8Available formats PDF Please select a format to send. By using this service, you agree that you will only keep articles for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services. Please confirm that you accept the terms of use. Cancel Send ×Export citation Request permission. (shrink)

M. B. Hintikka and J. Hintikka claimed that their reconstruction of the ‘Sherlock Holmes sense of deduction’ can “serve as an explication for the link between intelligence and memory”. The claim is vindicated, first for the single-agent case, where the reconstruction captures strategies for accessing the content of a distributed and associative memory; then, for the multi-agent case, where the reconstruction captures strategies for accessing knowledge distributed in a community. Moreover, the reconstruction of the ‘Sherlock Holmes sense of deduction’ allows (...) to conceptualize those strategies as belonging to a continuum of behavioral strategies. (shrink)

The Barth–Krabbe–Hintikka–Hintikka Problem, independently raised by Barth and Krabbe and Hintikka and Hintikka Sherlock Holmes confronts modern logic: Toward a theory of information-seeking through questioning. Indiana University Press, Bloomington, 1983), is the problem of characterizing the strategic reasoning of the players of dialogical logic and game-theoretic semantics games from rational preferences rather than rules. We solve the problem by providing a set of preferences for players with bounded rationality and specifying strategic inferences from those preferences, for a variant of logical (...) dialogues. This solution is generalized to both game-theoretic semantics and orthodox dialogical logic. (shrink)

This article demonstrates that typical restrictions which are imposed in dialogical logic in order to recover first-order logical consequence from a fragment of natural language argumentation are also forthcoming from preference profiles of boundedly rational players, provided that these players instantiate a specific player type and compute partial strategies. We present two structural rules, which are formulated similarly to closure rules for tableaux proofs that restrict players' strategies to a mapping between games in extensive forms and proof trees. Both rules (...) are motivated from players' preferences and limitations; they can therefore be viewed as being player-self-imposable. First-order logical consequence is thus shown to result from playing a specific type of argumentation game. The alignment of such games with the normative model of the Pragma-dialectical theory of argumentation is positively evaluated. But explicit rules to guarantee that the argumentation game instantiates first-order logical consequence have now become gratuitous, since their normative content arises directly from players' preferences and limitations. A similar naturalization for non-classical logics is discussed. (shrink)

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. (shrink)

In this paper I present the double disjunction task as introduced by Johnson-Laird. This experiment is meant to show how mental model theory explains the discrepancy between logical competence and logical performance of individuals in deductive reasoning. I review the results of the task and identify three problems in the way the task is designed, that all fall under a lack of coordination between the subject and the experimenter, and an insufficient representation of the semantic/pragmatic interface. I then propose a (...) reformulation of the task, that makes explicit the underlying semantic reasoning and emphasizes the difference of interpretation of the DDT between the experimenter and the subjects. (shrink)

If semantic consequence is analyzed with extensive games, logical reasoning can be accounted for by looking at how players solve entailment games. However, earlier approaches to game semantics cannot achieve this reduction, by want of explicitly dened preferences for players. Moreover, although entailment games can naturally translate the idea of argumentation about a common ground, a cognitive interpretation is undermined by the complexity of strategic reasoning. We thus describe a class of semantic extensive entailment game with algorithmic players, who have (...) preferences for parsimonious spending of computational resources and thus compute partial strategies under qualitative uncertainty about future histories. We prove the existence of local preferences for moves and of strategic fixpoints that allow to map game-trees to tableaux proofs, and exhibit a strategy prole that solves the fixpoint selection problem, and can be mapped to systematic constructions of semantic trees, yielding a completeness result by translation. We then discuss the correspondence between proof heuristics and strategies in our games, the relations of our games to gts, and possible extensions to other entailment relations. We conclude that the main interest of our result lies in the possibility to bridge argumentative and cognitive models of logical reasoning, rather than in new meta-theoretic results. All proofs are given in appendix. (shrink)

Instructions in Wason’s Selection Task underdetermine empirical subjects’ representation of the underlying problem, and its admissible solutions. We model the Selection Task as an interrogative learning problem, and reasoning to solutions as: selection of a representation of the problem; and: strategic planning from that representation. We argue that recovering Wason’s ‘normative’ selection is possible only if both stages are constrained further than they are by Wason’s formulation. We conclude comparing our model with other explanatory models, w.r.t. to empirical adequacy, and (...) modeling of bounded rationality. (shrink)

Our aim in this paper is to provide a referential account of functional anaphora within a Skolem functions framework. We will give an interpretation of indefinite NPs as Skolem terms in order to show that the referential link established between an anaphoric pronoun and its antecedent is a descriptive one. Then we will argue that functional anaphora can be understood as a particular kind of E-type pronouns, in the sense that, for a large corpus, the pronoun can be replaced by (...) a descriptive expression of a first-order language. It will next be shown that the functional framework can be fruitfully applied to other kinds of sentences involving pronominal anaphora,especially in modal contexts. (shrink)