752 research outputs found

    Cut-free Calculi and Relational Semantics for Temporal STIT Logics

    Get PDF
    We present cut-free labelled sequent calculi for a central formalism in logics of agency: STIT logics with temporal operators. These include sequent systems for Ldm , Tstit and Xstit. All calculi presented possess essential structural properties such as contraction- and cut-admissibility. The labelled calculi G3Ldm and G3Tstit are shown sound and complete relative to irreflexive temporal frames. Additionally, we extend current results by showing that also Xstit can be characterized through relational frames, omitting the use of BT+AC frames

    A logical analysis of responsibility attribution : emotions, individuals and collectives

    Get PDF
    International audienceThe aim of this article is to provide a logical analysis of the concept of responsibility attribution; that is, how agents ascribe responsibility about the consequences of actions, either to themselves or to other agents. The article is divided in two parts. The first part investigates the importance of the concept of responsibility attribution for emotion theory in general and, in particular, for the theory of attribution emotions such as guilt, pride, moral approval and moral disapproval. The second part explores the collective dimension of responsibility attribution and attribution emotions, namely the concepts of collective responsibility and collective guilt. The proposed analysis is based on an extension of the logic STIT (the logic of ‘Seeing To It That’) with three different types of knowledge and common knowledge modal operators depending on the time of choice: before one’s choice, after one’s choice but before knowing the choices of other agents, and after the choices of all agents have become public. Decidability of the satisfiability problem of the logic is studied in the article

    Grounding power on actions and mental attitudes

    Get PDF
    International audienceThe main objective of this work is to develop a logic called IAL (Intentional Agency Logic) in which we can reason about mental states of agents, action occurrences, and agentive and group powers. IAL will be exploited for a formal analysis of different forms of power such as an agent i's power of achieving a certain result and an agent i's power over another agent j (alias social power)

    What an Agent Ought To Do

    Get PDF
    This paper reviewes Horty\u27s 2001 book `Agency and Deontic Logic\u27. We place Horty\u27s research I a broader context and discuss the relevancy for logics for multi-agent systems

    Choice-Driven Counterfactuals

    Get PDF

    Group Norms for Multi-Agent Organisations

    Get PDF
    W. W. Vasconcelos acknowledges the support of the Engineering and Physical Sciences Research Council (EPSRC-UK) within the research project “Scrutable Autonomous Systems” (Grant No. EP/J012084/1). The authors thank the three anonymous reviewers for their comments, suggestions, and constructive criticisms. Thanks are due to Dr. Nir Oren, for comments on earlier versions of the article, and Mr. Seumas Simpson, for proofreading the manuscript. Any remaining mistakes are the sole responsibility of the authors.Peer reviewedPostprin

    Reasoning about coalitional agency and ability in the logics of "bringing-it-about"

    Get PDF
    The logics of "bringing-it-about" have been part of a prominent tradition for the formalization of individual and institutional agency. They are the logics to talk about what states of affairs an acting entity brings about while abstracting away from the means of action. Elgesem\u27s proposal analyzes the agency of individual agents as the goal-directed manifestation of an individual ability. It has become an authoritative modern reference. The first contribution of this paper is to extend Elgesem\u27s logic of individual agency and ability to coalitions. We present a general theory and later propose several possible specializations. As a second contribution, we offer algorithms to reason with the logics of bringing-it-about and we analyze their computational complexity
    • 

    corecore