An Epistemic Perspective on Consistency of Concurrent Computations

Consistency properties of concurrent computations, e.g., sequential consistency, linearizability, or eventual consistency, are essential for devising correct concurrent algorithms. In this paper, we present a logical formalization of such consistency properties that is based on a standard logic of knowledge. Our formalization provides a declarative perspective on what is imposed by consistency requirements and provides some interesting unifying insight on differently looking properties

Does religious belief impact philosophical analysis?

One popular conception of natural theology holds that certain purely rational arguments are insulated from empirical inquiry and independently establish conclusions that provide evidence, justification, or proof of God’s existence. Yet, some raise suspicions that philosophers and theologians’ personal religious beliefs inappropriately affect these kinds of arguments. I present an experimental test of whether philosophers and theologians’ argument analysis is influenced by religious commitments. The empirical findings suggest religious belief affects philosophical analysis and offer a challenge to theists and atheists, alike: reevaluate the scope of natural theology’s conclusions or acknowledge and begin to address the influence of religious belief

Dynamic Logic of Common Knowledge in a Proof Assistant

Common Knowledge Logic is meant to describe situations of the real world where a group of agents is involved. These agents share knowledge and make strong statements on the knowledge of the other agents (the so called \emph{common knowledge}). But as we know, the real world changes and overall information on what is known about the world changes as well. The changes are described by dynamic logic. To describe knowledge changes, dynamic logic should be combined with logic of common knowledge. In this paper we describe experiments which we have made about the integration in a unique framework of common knowledge logic and dynamic logic in the proof assistant \Coq. This results in a set of fully checked proofs for readable statements. We describe the framework and how a proof can beComment: 15

Situation awareness and ability in coalitions

This paper proposes a discussion on the formal links between the Situation Calculus and the semantics of interpreted systems as far as they relate to Higher-Level Information Fusion tasks. Among these tasks Situation Analysis require to be able to reason about the decision processes of coalitions. Indeed in higher levels of information fusion, one not only need to know that a certain proposition is true (or that it has a certain numerical measure attached), but rather needs to model the circumstances under which this validity holds as well as agents' properties and constraints. In a previous paper the authors have proposed to use the Interpreted System semantics as a potential candidate for the unification of all levels of information fusion. In the present work we show how the proposed framework allow to bind reasoning about courses of action and Situation Awareness. We propose in this paper a (1) model of coalition, (2) a model of ability in the situation calculus language and (3) a model of situation awareness in the interpreted systems semantics. Combining the advantages of both Situation Calculus and the Interpreted Systems semantics, we show how the Situation Calculus can be framed into the Interpreted Systems semantics. We illustrate on the example of RAP compilation in a coalition context, how ability and situation awareness interact and what benefit is gained. Finally, we conclude this study with a discussion on possible future works

A virtue epistemology of the Internet: Search engines, intellectual virtues and education

This paper applies a virtue epistemology approach to using the Internet, as to improve our information-seeking behaviours. Virtue epistemology focusses on the cognitive character of agents and is less concerned with the nature of truth and epistemic justification as compared to traditional analytic epistemology. Due to this focus on cognitive character and agency, it is a fruitful but underexplored approach to using the Internet in an epistemically desirable way. Thus, the central question in this paper is: How to use the Internet in an epistemically virtuous way? Using the work of Jason Baehr, it starts by outlining nine intellectual or epistemic virtues: curiosity, intellectual autonomy, intellectual humility, attentiveness, intellectual carefulness, intellectual thoroughness, open-mindedness, intellectual courage and intellectual tenacity. It then explores how we should deploy these virtues and avoid the corresponding vices when interacting with the Internet, particularly search engines. Whilst an epistemically virtuous use of the Internet will not guarantee that one will acquire true beliefs, understanding or even knowledge, it will strongly improve one’s information-seeking behaviours. The paper ends with arguing that teaching and assessing online intellectual virtues should be part of school and university curricula, perhaps embedded in critical thinking courses, or even better, as individual units

Asynchronous Announcements

We propose a multi-agent epistemic logic of asynchronous announcements, where truthful announcements are publicly sent but individually received by agents, and in the order in which they were sent. Additional to epistemic modalities the logic contains dynamic modalities for making announcements and for receiving them. What an agent believes is a function of her initial uncertainty and of the announcements she has received. Beliefs need not be truthful, because announcements already made may not yet have been received. As announcements are true when sent, certain message sequences can be ruled out, just like inconsistent cuts in distributed computing. We provide a complete axiomatization for this \emph{asynchronous announcement logic} (AA). It is a reduction system that also demonstrates that any formula in $AA$ is equivalent to one without dynamic modalities, just as for public announcement logic. The model checking complexity is in PSPACE. A detailed example modelling message exchanging processes in distributed computing in $AA$ closes our investigation

An Abstract Formal Basis for Digital Crowds

Crowdsourcing, together with its related approaches, has become very popular in recent years. All crowdsourcing processes involve the participation of a digital crowd, a large number of people that access a single Internet platform or shared service. In this paper we explore the possibility of applying formal methods, typically used for the verification of software and hardware systems, in analysing the behaviour of a digital crowd. More precisely, we provide a formal description language for specifying digital crowds. We represent digital crowds in which the agents do not directly communicate with each other. We further show how this specification can provide the basis for sophisticated formal methods, in particular formal verification.Comment: 32 pages, 4 figure