The importance of potential intentions has been demonstrated both in the construction of agent systems and in the formalisation of teamwork behaviour. However, there still lacks an adequate semantics for the notion of potential intentions as introduced by Grosz and Kraus in their SharedPlans framework. In this paper, we give a formal semantics to intentions and potential intentions, drawing upon both the representationalist approach and the accessibility-based approach. The model captures the dynamic relationship among intentions and potential intentions by providing (...) semantic rules and conditions. Also, the model treats norms as a special class of intentional context, and it is shown that norms play a critical role in the dynamics of intentions in multiagent systems. The formal semantics allows us to validate some properties that are widely-accepted for intention attitudes. (shrink)

We introduce a conceptual model for reaching group decisions. Our model extends a well-known, single-agent cognitive model, the recognition-primed decision (RPD) model. The RPD model includes a recognition phase and an evaluation phase. Group extensions of the RPD model, applicable to a group of RPD agents, have been considered in the literature, however the proposed models do not formalize how distributed and possibly inconsistent information can be combined in either phase. We show how such information can be utilized by aggregating (...) it using a specific social choice method, namely judgment aggregation. Our model is applicable to hierarchical groups of agents containing at least one RPD agent. (shrink)

In this paper I study intentions of the form, that is, intentions with a we-content, and their role in interpersonal coordination. I focus on the notion of epistemic support for such intentions. Using tools from epistemic game theory and epistemic logic, I cast doubt on whether such support guarantees the other agents' conditional mediation in the achievement of such intentions, something that appears important if intentions with a we-content are to count as genuine intentions. I then formulate a stronger version (...) of epistemic support, one that does indeed ensure the required mediation, but I then argue that it rests on excessively strong informational conditions. In view of this I provide an alternative set of conditions that are jointly sufficient for coordination in games, and I argue that these conditions constitute a plausible alternative to the proposed notion of epistemic support. (shrink)

In this paper I present a dynamic-epistemic hybrid logic for reasoning about information and intention changes in situations of strategic interaction. I provide a complete axiomatization for this logic, and then use it to study intentions-based transformations of decision problems.

This paper focuses on the Enkratic principle of rationality, according to which rationality requires that if an agent sincerely and with conviction believes she ought to X, then X-ing is a goal in her plan. We analyze the logical structure of Enkrasia and its implications for deontic logic. To do so, we elaborate on the distinction between basic and derived oughts, and provide a multi-modal neighborhood logic with three characteristic operators: a non-normal operator for basic oughts, a non-normal operator for (...) goals in plans, and a normal operator for derived oughts. We prove two completeness theorems for the resulting logic, and provide a dynamic extension of the logic by means of product updates. We illustrate how this setting informs deontic logic by considering issues related to the filtering of inconsistent oughts, the restricted validity of deontic closure, and the stability of oughts and goals under dynamics. (shrink)

In this paper I study two ways of transforming decision problems on the basis of previously adopted intentions, ruling out incompatible options and imposing a standard of relevance, with a particular focus on situations of strategic interaction. I show that in such situations problems arise which do not appear in the single-agent case, namely that transformation of decision problems can leave the agents with no option compatible with what they intend. I characterize conditions on the agents’ intentions which avoid such (...) problematic scenarios, in a way that requires each agent to take account of the intentions of others. (shrink)

The present dissertation investigates certain facets of the logical structure of oughts – where “ought” is used as a noun, roughly meaning obligation. I do so by following two lines of inquiry. The first part of the thesis places oughts in the context of practical rationality. The second part of the thesis concerns the inference rules governing arguments about oughts, and specifically the inference rule of Reasoning by Cases. These two lines of inquiry, together, aim to expound upon oughts in (...) rationality and reasoning. The methodology used in this dissertation is the one of philosophical logic, in which logical, qualitative models are developed to support and foster conceptual analysis. The dissertation consists of four main chapters. The first two chapters are devoted to the role of oughts in practical rationality. I focus on the so-called Enkratic principle of rationality, which – in its most general formulation – requires that if an agent believes sincerely and with conviction that she ought to do X, then she intends to X. I develop a logical framework to investigate the (static and dynamic) relation between those oughts believed by the agent and her intentions. It is shown that, under certain minimal assumptions, the Enkratic principle of rationality is a principle of limited validity. The following two chapters of the dissertation constitute a study of the classical inference rule of Reasoning by Cases, which – in its simplest form – moves from the premises “A or B”, “if A then C” and “if B then C” to the conclusion “C”. Recent literature has called the validity of Reasoning by Cases into question, with the most influential counterexample being the so-called Miners’ Puzzle – an instance of Reasoning by Cases where “C” involves oughts. I provide a unifying explanation of why the Miners’ Puzzle emerges. It is shown that, within specific boundaries, Reasoning by Cases is a valid inference rule. (shrink)

In this article we strive to provide a detailed and principled analysis of the role of beliefs in goal processing—that is, the cognitive transition that leads from a mere desire to a proper intention. The resulting model of belief-based goal processing has also relevant consequences for the analysis of intentions, and constitutes the necessary core of a constructive theory of intentions, i.e. a framework that not only analyzes what an intention is, but also explains how it becomes what it is. (...) We discuss similarities and differences between our approach and other standard accounts of intention, in particular Bratman’s planning theory. The aim here is to question and refine the conceptual foundations of many theories of intentional action: as a consequence, although our analysis is not formal in itself, it is ultimately meant to have deep consequences for formal models of intentional agency. (shrink)

While logical theories of information attitudes, such as knowledge, certainty and belief, have flourished in the past two decades, formalization of other facets of rational behavior have lagged behind significantly. One intriguing line of research concerns the concept of intention. I will discuss one approach to tackling the notion within a logical framework, based on a database perspective.

We present a modal logic called (logic of intention and attempt) in which we can reason about intention dynamics and intentional action execution. By exploiting the expressive power of , we provide a formal analysis of the relation between intention and action and highlight the pivotal role of attempt in action execution. Besides, we deal with the problems of instrumental reasoning and intention persistence.

The typical function of goals is to regulate action in a way that furthers goal achievement. Goals are typically set on the assumption that they will help bring the agent closer to the desired state of affairs. However, sometimes endorsement of a goal, or the processes by which the goal is set, can obstruct its achievement. When this happens, the goal is self-defeating. Self-defeating goals are common in both private and social decision-making but have not received much attention by decision (...) theorists. In this paper, we investigate different variants of three major types of self-defeating mechanisms: The goal can be an obstacle to its own fulfilment, goal-setting activities can impede goal achievement, and disclosure of the goal can interfere with its attainment. Different strategies against self-defeasance are tentatively explored, and their efficiency against different types of self-defeasance is investigated. (shrink)

The process of rationally revising beliefs in the light of new information is a topic of great importance and long-standing interest in artificial intelligence. Moreover, significant progress has been made in understanding the philosophical, logical, and computational foundations of belief revision. However, very little research has been reported with respect to the revision of other mental states, most notably propositional attitudes such as desires and intentions. In this paper, we present a first attempt to formulate a general framework for understanding (...) the revision of mental states. We develop an abstract belief-desire-intention model of agents, and introduce a notion of rationality for this model. We then present a series of formal postulates characterizing the processes of adding beliefs, desires, and intentions, updating costs and values, and removing beliefs, desires, and intentions. We also investigate the computational complexity of several problems involving the abstract model and comment on algorithms for revision. (shrink)