Theoretical Aspects of Rationality and Knowledge最新文献_第7页

An Epistemic Foundation for Authentication Logics (Extended Abstract) 认证逻辑的认识论基础(扩展摘要)

Theoretical Aspects of Rationality and Knowledge Pub Date : 2017-07-01 DOI: 10.4204/EPTCS.251.21

Joseph Y. Halpern, R. V. D. Meyden, Riccardo Pucella

引用次数: 2

Attainable Knowledge and Omniscience 可获得的知识和无所不知

Theoretical Aspects of Rationality and Knowledge Pub Date : 2017-05-30 DOI: 10.4204/EPTCS.335.24

Pavel Naumov, Jia Tao

引用次数: 0

Together We Know How to Achieve: An Epistemic Logic of Know-How 我们一起知道如何实现:知识的认知逻辑

Theoretical Aspects of Rationality and Knowledge Pub Date : 2017-05-25 DOI: 10.4204/EPTCS.251.32

Pavel Naumov, Jia Tao

引用次数: 42

A Logic for Global and Local Announcements 全局和本地公告的逻辑

Theoretical Aspects of Rationality and Knowledge Pub Date : 2017-05-24 DOI: 10.4204/EPTCS.251.3

F. Belardinelli, H. V. Ditmarsch, W. Hoek

{"title":"A Logic for Global and Local Announcements","authors":"F. Belardinelli, H. V. Ditmarsch, W. Hoek","doi":"10.4204/EPTCS.251.3","DOIUrl":"https://doi.org/10.4204/EPTCS.251.3","url":null,"abstract":"In this paper we introduce {em global and local announcement logic} (GLAL), a dynamic epistemic logic with two distinct announcement operators -- $[phi]^+_A$ and $[phi]^-_A$ indexed to a subset $A$ of the set $Ag$ of all agents -- for global and local announcements respectively. The boundary case $[phi]^+_{Ag}$ corresponds to the public announcement of $phi$, as known from the literature. Unlike standard public announcements, which are {em model transformers}, the global and local announcements are {em pointed model transformers}. In particular, the update induced by the announcement may be different in different states of the model. Therefore, the resulting computations are trees of models, rather than the typical sequences. A consequence of our semantics is that modally bisimilar states may be distinguished in our logic. Then, we provide a stronger notion of bisimilarity and we show that it preserves modal equivalence in GLAL. Additionally, we show that GLAL is strictly more expressive than public announcement logic with common knowledge. We prove a wide range of validities for GLAL involving the interaction between dynamics and knowledge, and show that the satisfiability problem for GLAL is decidable. We illustrate the formal machinery by means of detailed epistemic scenarios.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134458765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Optimizing Epistemic Model Checking using Conditional Independence 利用条件独立优化认知模型检查

Theoretical Aspects of Rationality and Knowledge Pub Date : 2016-10-13 DOI: 10.4204/EPTCS.251.29

R. V. D. Meyden

引用次数: 2

On the Solvability of Inductive Problems: A Study in Epistemic Topology 论归纳问题的可解性:一个认知拓扑的研究

Theoretical Aspects of Rationality and Knowledge Pub Date : 2016-06-24 DOI: 10.4204/EPTCS.215.7

A. Baltag, Nina Gierasimczuk, S. Smets

引用次数: 33

Relating Knowledge and Coordinated Action: The Knowledge of Preconditions Principle 关联知识与协调行动:前提知识原则

Theoretical Aspects of Rationality and Knowledge Pub Date : 2016-06-24 DOI: 10.4204/EPTCS.215.17

Y. Moses

{"title":"Relating Knowledge and Coordinated Action: The Knowledge of Preconditions Principle","authors":"Y. Moses","doi":"10.4204/EPTCS.215.17","DOIUrl":"https://doi.org/10.4204/EPTCS.215.17","url":null,"abstract":"The Knowledge of Preconditions principle (KoP) is proposed as a widely applicable connection between knowledge and action in multi-agent systems. Roughly speaking, it asserts that if some condition is a necessary condition for performing a given action A, then knowing that this condition holds is also a necessary condition for performing A. Since the specifications of tasks often involve necessary conditions for actions, the KoP principle shows that such specifications induce knowledge preconditions for the actions. Distributed protocols or multi-agent plans that satisfy the specifications must ensure that this knowledge be attained, and that it is detected by the agents as a condition for action. The knowledge of preconditions principle is formalised in the runs and systems framework, and is proven to hold in a wide class of settings. Well-known connections between knowledge and coordinated action are extended and shown to derive directly from the KoP principle: a \"common knowledge of preconditions\" principle is established showing that common knowledge is a necessary condition for performing simultaneous actions, and a \"nested knowledge of preconditions\" principle is proven, showing that coordinating actions to be performed in linear temporal order requires a corresponding form of nested knowledge.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133452157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 29

Do players reason by forward induction in dynamic perfect information games? 动态完全信息博弈中玩家是否采用正向归纳法进行推理?

Theoretical Aspects of Rationality and Knowledge Pub Date : 2016-06-24 DOI: 10.4204/EPTCS.215.12

Sujata Ghosh, A. Heifetz, R. Verbrugge

{"title":"Do players reason by forward induction in dynamic perfect information games?","authors":"Sujata Ghosh, A. Heifetz, R. Verbrugge","doi":"10.4204/EPTCS.215.12","DOIUrl":"https://doi.org/10.4204/EPTCS.215.12","url":null,"abstract":"We conducted an experiment where participants played a perfect-information game against a computer, which was programmed to deviate often from its backward induction strategy right at the beginning of the game. Participants knew that in each game, the computer was nevertheless optimizing against some belief about the participant's future strategy. \u0000It turned out that in the aggregate, participants were likely to respond in a way which is optimal with respect to their best-rationalization extensive form rationalizability conjecture - namely the conjecture that the computer is after a larger prize than the one it has foregone, even when this necessarily meant that the computer has attributed future irrationality to the participant when the computer made the first move in the game. Thus, it appeared that participants applied forward induction. However, there exist alternative explanations for the choices of most participants; for example, choices could be based on the extent of risk aversion that participants attributed to the computer in the remainder of the game, rather than to the sunk outside option that the computer has already foregone at the beginning of the game. For this reason, the results of the experiment do not yet provide conclusive evidence for Forward Induction reasoning on the part of the participants.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132387391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 12

Standard State Space Models of Unawareness (Extended Abstract) 无意识的标准状态空间模型(扩展摘要)

Theoretical Aspects of Rationality and Knowledge Pub Date : 2016-06-24 DOI: 10.4204/EPTCS.215.11

P. Fritz, H. Lederman

引用次数: 8

An Axiomatic Approach to Routing 路由的公理化方法

Theoretical Aspects of Rationality and Knowledge Pub Date : 2016-06-24 DOI: 10.4204/EPTCS.215.14

Omer Lev, Moshe Tennenholtz, Aviv Zohar

{"title":"An Axiomatic Approach to Routing","authors":"Omer Lev, Moshe Tennenholtz, Aviv Zohar","doi":"10.4204/EPTCS.215.14","DOIUrl":"https://doi.org/10.4204/EPTCS.215.14","url":null,"abstract":"Information delivery in a network of agents is a key issue for large, complex systems that need to do so in a predictable, efficient manner. The delivery of information in such multi-agent systems is typically implemented through routing protocols that determine how information flows through the network. Different routing protocols exist each with its own benefits, but it is generally unclear which properties can be successfully combined within a given algorithm. We approach this problem from the axiomatic point of view, i.e., we try to establish what are the properties we would seek to see in such a system, and examine the different properties which uniquely define common routing algorithms used today. \u0000We examine several desirable properties, such as robustness, which ensures adding nodes and edges does not change the routing in a radical, unpredictable ways; and properties that depend on the operating environment, such as an \"economic model\", where nodes choose their paths based on the cost they are charged to pass information to the next node. We proceed to fully characterize minimal spanning tree, shortest path, and weakest link routing algorithms, showing a tight set of axioms for each.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116419722","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5