Ensuring the trustworthiness of autonomous systems and artificial intelligence is an important interdisciplinary endeavour. In this position paper, we argue that this endeavour will benefit from technical advancements in capturing various forms of responsibility, and we present a comprehensive research agenda to achieve this. In particular, we argue that ensuring the reliability of autonomous system can take advantage of technical approaches for quantifying degrees of responsibility and for coordinating tasks based on that. Moreover, we deem that, in certifying the legality (...) of an AI system, formal and computationally implementable notions of _responsibility_, _blame_, _accountability_, and _liability_ are applicable for addressing potential responsibility gaps (i.e. situations in which a group is responsible, but individuals’ responsibility may be unclear). This is a call to enable AI systems themselves, as well as those involved in the design, monitoring, and governance of AI systems, to represent and reason about who can be seen as responsible in prospect (e.g. for completing a task in future) and who can be seen as responsible retrospectively (e.g. for a failure that has already occurred). To that end, in this work, we show that across all stages of the design, development, and deployment of trustworthy autonomous systems (TAS), responsibility reasoning should play a key role. This position paper is the first step towards establishing a road map and research agenda on how the notion of responsibility can provide novel solution concepts for ensuring the _reliability_ and _legality_ of TAS and, as a result, enables an effective embedding of AI technologies into society. (shrink)

This paper contributes an analysis and formalisation of Damasio’s theory on core consciousness. Three important concepts in this theory are ‘emotion’, ‘feeling’ and ‘feeling a feeling’ . In particular, a simulation model is described of the dynamics of basic mechanisms leading via emotion and feeling to core consciousness, and dynamic properties are formally specified that hold for these dynamics at a more global level. These properties have been automatically checked for the simulation model. Moreover, a formal analysis is made of (...) relevant notions of representation used by Damasio. As part of this analysis, specifications of representation relations have been verified and confirmed against the simulation model. (shrink)

In this paper, reduction and its pragmatics are discussed in light of the development in computer science of languages to describe processes. The design of higher-level description languages within computer science has had the aim of allowing for description of the dynamics of processes in the (physical) world on a higher level avoiding all (physical) details of these processes. The higher description levels developed have dramatically increased the complexity of applications that came within reach. The pragmatic attitude of a (scientific) (...) practitioner in this area has become inherently anti-reductionist, but based on well-established reduction relations. The paper discusses how this perspective can be related to reduction in general, and to other domains where description of dynamics plays a main role, in particular, biological and cognitive domains. (shrink)

Compositional verification aims at managing the complexity of theverification process by exploiting compositionality of the systemarchitecture. In this paper we explore the use of a temporal epistemiclogic to formalize the process of verification of compositionalmulti-agent systems. The specification of a system, its properties andtheir proofs are of a compositional nature, and are formalized within acompositional temporal logic: Temporal Multi-Epistemic Logic. It isshown that compositional proofs are valid under certain conditions.Moreover, the possibility of incorporating default persistence ofinformation in a system, is (...) explored. A completion operation on aspecific type of temporal theories, temporal completion, is introducedto be able to use classical proof techniques in verification withrespect to non-classical semantics covering default persistence. (shrink)