This volume concerns Rational Agents - humans, players in a game, software or institutions - which must decide the proper next action in an atmosphere of partial information and uncertainty. The book collects formal accounts of Uncertainty, Rationality and Agency, and also of their interaction. It will benefit researchers in artificial systems which must gather information, reason about it and then make a rational decision on which action to take.

We shall introduce a set of fundamental legal concepts, providing a definition of each of them. This set will include, besides the usual deontic modalities (obligation, prohibition and permission), the following notions: obligative rights (rights related to other’s obligations), permissive rights, erga-omnes rights, normative conditionals, liability rights, different kinds of legal powers, potestative rights (rights to produce legal results), result-declarations (acts intended to produce legal determinations), and sources of the law.

Hamblin's Action-State Semantics provides a sound philosophical foundation for understanding the character of the imperative. Taking this as our inspiration, in this paper we present a logic of action, which we call ST, that captures the clear ontological distinction between being responsible for the achievement of a state of affairs and being responsible for the performance of an action. We argue that a relativised modal logic of type RT founded upon a ternary relation over possible worlds integrated with a basic (...) tense logic captures intuitions of the Hamblinian model of imperatives. The logic implements a direct mapping of each of Hamblin's key concepts: strategies, partial strategies and wholehearted satisfaction. (shrink)

Hamblin’s Action-State Semantics provides a sound philosophical foundation for understanding the character of the imperative. Taking this as our inspiration, in this paper we present a logic of action, which we call ST, that captures the clear ontological distinction between being responsible for the achievement of a state of affairs and being responsible for the performance of an action. We argue that a relativised modal logic of type RT founded upon a ternary relation over possible worlds integrated with a basic (...) tense logic captures intuitions of the Hamblinian model of imperatives. The logic implements a direct mapping of each of Hamblin’s key concepts: strategies, partial strategies and wholehearted satisfaction. (shrink)

It is now more than ten years since the EU FET project ALFEBIITE finished, during which its researchers made original and distinctive contributions to (inter alia) formal models of trust, model-checking, and action logics. ALFEBIITE was also a highly inter-disciplinary project, with partners from computer science, philosophy, cognitive science and law. In this paper, we reflect on the interaction between computer scientists and information and IT lawyers on the idea of the ‘open agent society’. This inspired a programme of research (...) whose investigation into conceptual challenges has carried it from the logical specification of agent societies and dynamic norm-governed systems to self-organising electronic institutions, while developing several technologies for agent-based modelling and complex event recognition. The outcomes of this inter-disciplinary collaboration have also influenced current research into using the open agent society as a platform for socio-technical systems, and other collective adaptive systems. We present a number of research challenges, including the ideas of computational justice and polycentric governance, and explore a number of ethical, legal and social implications. We contend that, in order to address these issues and challenges, the continued inter-disciplinary collaboration between computer science and IT lawyers is critical. (shrink)

Nonmonotonic causal logic is a knowledge representation language designed for describing domains that involve actions and change. The process of literal completion, similar to program completion familiar from the theory of logic programming, can be used to translate some nonmonotonic causal theories into classical logic. Its applicability is restricted, however, to theories that deal with truth-valued fluents, represented by predicate symbols. In this note we introduce functional completion—a more general process that can be applied to causal theories in which fluents (...) are treated as functions. (shrink)

Disputes over causes play a central role in legal argumentation and liability attribution. Legal approaches to causation often struggle to capture cause-in-fact in complex situations, e.g. overdetermination, preemption, omission. In this paper, we first assess three current theories of causation to illustrate their strengths and weaknesses in capturing cause-in-fact. Secondly, we introduce a semi-formal framework for modelling causal arguments through strict and defeasible rules. Thirdly, the framework is applied to the Althen vaccine injury case. And lastly, we discuss the need (...) for new criteria based on a common causal argumentation framework and propose ideas on how to integrate the current theories of causation to assess the strength of causal arguments, while also acknowledging the tension between evidence-based and policy-based causal analysis in law. (shrink)

Disputes over causes play a central role in legal argumentation and liability attribution. Legal approaches to causation often struggle to capture cause-in-fact in complex situations, e.g. overdetermination, preemption, omission. In this paper, we first assess three current theories of causation to illustrate their strengths and weaknesses in capturing cause-in-fact. Secondly, we introduce a semi-formal framework for modelling causal arguments through strict and defeasible rules. Thirdly, the framework is applied to the Althen vaccine injury case. And lastly, we discuss the need (...) for new criteria based on a common causal argumentation framework and propose ideas on how to integrate the current theories of causation to assess the strength of causal arguments, while also acknowledging the tension between evidence-based and policy-based causal analysis in law. (shrink)

Disputes over causes play a central role in legal argumentation and liability attribution. Legal approaches to causation often struggle to capture cause-in-fact in complex situations, e.g. overdetermination, preemption, omission. In this paper, we first assess three current theories of causation to illustrate their strengths and weaknesses in capturing cause-in-fact. Secondly, we introduce a semi-formal framework for modelling causal arguments through strict and defeasible rules. Thirdly, the framework is applied to the Althen vaccine injury case. And lastly, we discuss the need (...) for new criteria based on a common causal argumentation framework and propose ideas on how to integrate the current theories of causation to assess the strength of causal arguments, while also acknowledging the tension between evidence-based and policy-based causal analysis in law. (shrink)

Possible worlds semantics for conditionals leave open the problem of how to construct models for realistic domains. In this paper, we show how to adapt logics of action and change such as John McCarthy’s Situation Calculus to conditional logics. We illustrate the idea by presenting models for conditionals whose antecedents combine a declarative condition with a hypothetical action.

Knowledge-based programs (KBPs) are a powerful notion for expressing action policies in which branching conditions refer to implicit knowledge and call for a deliberation task at execution time. However, branching conditions in KBPs cannot refer to possibly erroneous beliefs or to graded belief, such as “if my belief that φ holds is high then do some action α else perform some sensing action β”.

A thematic priority of the European Union’s Framework V research and development programme was the creation of a user-friendly information society which met the needs of citizens and enterprises. In practice, though, for example in the case of on-line digital music, the needs of citizens and enterprises may be in conflict. This paper proposes to leverage the appearance of ‘intelligence’ in the platform layer of a layered communications architecture to avoid such conflicts in similar applications in the future. The key (...) idea is that if the intelligence is encapsulated in an agent, then the agents should be organized as a society, and then the rules of the society can be used to ensure ‘responsible’ behaviour. We discuss how an agent society can be used to regulate behaviour in future information trading scenarios, and conclude that this approach offers a ‘third way’ which can satisfy the (reasonable) needs of both citizens and enterprises in the user-friendly information society. (shrink)

Traditionally, consistency is the only criterion for the quality of a theory in logic-based approaches to reasoning about actions. This work goes beyond that and contributes to the metatheory of actions by investigating what other properties a good domain description should have. We state some metatheoretical postulates concerning this sore spot. When all postulates are satisfied we call the action theory modular. Besides being easier to understand and more elaboration tolerant in McCarthy’s sense, modular theories have interesting properties. We point (...) out the problems that arise when the postulates about modularity are violated, and propose algorithmic checks that can help the designer of an action theory to overcome them. (shrink)

The paper discusses some properties of system descriptions in action language – a recent extension of action language by defined fluents. We give a sufficient condition guaranteeing that states of an system description are fully determined by statics and inertial fluents. In system descriptions satisfying this condition, defined fluents simply facilitate the description of dynamic domains; they are not essential and can be eliminated. We use our sufficient condition to identify a common core of action languages and. This is an (...) expansion of the work of, who identified a common core of languages and. The results presented in this paper are based on the close relationship between action languages and the theory of logic programs under the answer set semantics. (shrink)

Action theory may be regarded as a theoretical foundation of AI, because it provides in a logically coherent way the principles of performing actions by agents. But, more importantly, action theory offers a formal ontology mainly based on set-theoretic constructs. This ontology isolates various types of actions as structured entities: atomic, sequential, compound, ordered, situational actions etc., and it is a solid and non-removable foundation of any rational activity. The paper is mainly concerned with a bunch of issues centered around (...) the notion of performability of actions. It seems that the problem of performability of actions, though of basic importance for purely practical applications, has not been investigated in the literature in a systematic way thus far. This work, being a companion to the book as reported, elaborates the theory of performability of actions based on relational models and formal constructs borrowed from formal lingusistics. The discussion of performability of actions is encapsulated in the form of a strict logical system. This system is semantically defined in terms of its intended models in which the role of actions of various types is accentuated. Since due to the nature of compound actions the system is not finitary, other semantic variants of are defined. The focus in on the system of performability of finite compound actions. An adequate axiom system for is defined. The strong completeness theorem is the central result. The role of the canonical model in the proof of the completeness theorem is highlighted. The relationship between performability of actions and dynamic logic is also discussed. (shrink)

The action language C+ of Giunchiglia, Lee, Lifschitz, McCain and Turner is a high-level, logical formalism for the representation of domains involving action and change. However, one cannot directly express relationships which hold between states more than one time-step distant, or even say that one action determines another at the next time. We present C+timed, a generalization of C+ which removes these limitations. As for C+, translations to the language of causal theories are given. We also define a new kind (...) of transition system called a ‘run system’ to provide a graphical semantics. Finally, we show how domains involving prohibition and permission can be modelled, by incorporating the ideas of another extension of C+. (shrink)

A new version of transition logic is presented. It integrates transitions, which change world states, and classical reasoning, restricted in the paper to Horn logic. This is achieved by defining a deductive relationship ⊢ among formulas for a partially ordered set of transitions. This novel integration might form the core for a unified framework for practical reasoning with the potential of a full exploitation of the maturing techniques from classical planning and deduction. For the chosen formula type the logic at (...) the same time offers one possible clarification of the deductive formalism envisioned for original STRIPS but never made precise before. (shrink)

Multi-agent systems where the agents are developed by parties with competing interests, and where there is no access to an agent’s internal state, are often classified as ‘open’. The members of such systems may inadvertently fail to, or even deliberately choose not to, conform to the system specification. Consequently, it is necessary to specify the normative relations that may exist between the members, such as permission, obligation, and institutional power. We present a framework being developed for executable specification of open (...) multi-agent systems. We adopt a bird’s eye view of these systems, as opposed to an agent’s perspective whereby it reasons about how it should act. This paper is devoted to the presentation of various examples from the NetBill protocol formalised in terms of institutional power, permission and obligation. We express the system specification in the Event Calculus and execute the specification by means of a logic programming implementation. We also give several example formalisations of sanctions for dealing with violations of permissions and obligations. We distinguish between an open multi-agent system and the procedure by which an agent enters and leaves the system. We present examples from the specification of a role-management protocol for NetBill, and demonstrate the interplay between such a protocol and the corresponding multi-agent system. (shrink)

The work described in this report is motivated by the desire to test the expressive possibilities of action language C+. The Causal Calculator (CCalc) is a system that answers queries about action domains described in a fragment of that language. The Zoo World and the Traffic World have been proposed by Erik Sandewall in his Logic Modelling Workshop—an environment for communicating axiomatizations of action domains of nontrivial size. -/- The Zoo World consists of several cages and the exterior, gates between (...) them, and animals of several species, including humans. Actions in this domain include moving within and between cages, opening and closing gates, and mounting and riding animals. The Traffic World includes vehicles moving continuously between road crossings subject to a number of restrictions, such as speed limits and keeping a fixed safety distance away from other vehicles on the road. We show how to represent the two domains in the input language of CCalc, and how to use CCalc to test these representations. (shrink)

structures, or interpretations, in the sense of first-order logic. In C+, on the other hand, a state is an interpreta-.