paper-with-me

Papers

The Logic of Doxastic Strategies

2023-12-12 · Junli Jiang, Pavel Naumov

In many real-world situations, there is often not enough information to know that a certain strategy will succeed in achieving the goal, but there is a good reason to believe that it will. The paper introduces the term ``doxastic'' for such strategies. The main technical contribution is a sound and complete logical system that describes the interplay between doxastic strategy and belief modalities.

📄 PDF Abstract BibTeX arXiv:2312.07107

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

The Doxastic Interpretation of Team Semantics

2013-05-21 · Pietro Galliani

We advance a doxastic interpretation for many of the logical connectives considered in Dependence Logic and in its extensions, and we argue that Team Semantics is a natural framework for reasoning about beliefs and belie…

Some Doxastic Łukasiewicz Logic

2021-11-04 · Doratossadat Dastgheib, Hadi Farahani

We propose a doxastic \L ukasiewicz logic \textbf{B\L} that is sound and complete with respect to the class of Kripke-based models in which atomic propositions and accessibility relations are both infinitely valued in th…

Revisable Justified Belief: Preliminary Report

2015-03-27 · Alexandru Baltag, Bryan Renne, Sonja Smets

The theory $\mathsf{CDL}$ of Conditional Doxastic Logic is the single-agent version of Board's multi-agent theory $\mathsf{BRSIC}$ of conditional belief. $\mathsf{CDL}$ may be viewed as a version of AGM belief revision t…

Representing states in iterated belief revision

2023-05-16 · Paolo Liberatore

Iterated belief revision requires information about the current beliefs. This information is represented by mathematical structures called doxastic states. Most literature concentrates on how to revise a doxastic state a…

Negation

On the Solvability of Inductive Problems: A Study in Epistemic Topology

2016-06-24 · Alexandru Baltag, Nina Gierasimczuk, Sonja Smets

We investigate the issues of inductive problem-solving and learning by doxastic agents. We provide topological characterizations of solvability and learnability, and we use them to prove that AGM-style belief revision is…