paper-with-me

홈 › Papers

Strategically knowing how

2017-05-15 · Raul Fervari, Andreas Herzig, Yanjun Li, Yanjing Wang

In this paper, we propose a single-agent logic of goal-directed knowing how extending the standard epistemic logic of knowing that with a new knowing how operator. The semantics of the new operator is based on the idea that knowing how to achieve $\phi$ means that there exists a (uniform) strategy such that the agent knows that it can make sure $\phi$. We give an intuitive axiomatization of our logic and prove the soundness, completeness, and decidability of the logic. The crucial axioms relating knowing that and knowing how illustrate our understanding of knowing how in this setting. This logic can be used in representing both knowledge-that and knowledge-how.

📄 PDF Abstract BibTeX arXiv:1705.05254

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Tableaux for the Logic of Strategically Knowing How

2023-07-11 · Yanjun Li

The logic of goal-directed knowing-how extends the standard epistemic logic with an operator of knowing-how. The knowing-how operator is interpreted as that there exists a strategy such that the agent knows that the stra…

A Game-theoretic Understanding of Repeated Explanations in ML Models

2022-02-05 · Kavita Kumari, Murtuza Jadliwala, Sumit Kumar Jha, Anindya Maiti

This paper formally models the strategic repeated interactions between a system, comprising of a machine learning (ML) model and associated explanation method, and an end-user who is seeking a prediction/label and its ex…

Large Language Models can Strategically Deceive their Users when Put Under Pressure

2023-11-09 · Jérémy Scheurer, Mikita Balesni, Marius Hobbhahn

We demonstrate a situation in which Large Language Models, trained to be helpful, harmless, and honest, can display misaligned behavior and strategically deceive their users about this behavior without being instructed t…

Management

Knowing Whether

2013-11-30 · Jie Fan, Yanjing Wang, Hans van Ditmarsch

Knowing whether a proposition is true means knowing that it is true or knowing that it is false. In this paper, we study logics with a modal operator Kw for knowing whether but without a modal operator K for knowing that…

How Far Are LLMs from Professional Poker Players? Revisiting Game-Theoretic Reasoning with Agentic Tool Use

2026-01-31 · Minhua Lin, Enyan Dai, Hui Liu, Xianfeng Tang 외 arxiv

As Large Language Models (LLMs) are increasingly applied in high-stakes domains, their ability to reason strategically under uncertainty becomes critical. Poker provides a rigorous testbed, requiring not only strong acti…

Reinforcement Learning