In this paper we study AGM contraction and revision of rules using input/output logical theories. We replace propositional formulas in the AGM framework of theory change by pairs of propositional formulas, representing the rule based character of theories, and we replace the classical consequence operator Cn by an input/output logic. The results in this paper suggest that, in general, results from belief base dynamics can be transferred to rule base dynamics, but that a similar transfer of AGM theory change to (...) rule change is much more problematic. First, we generalise belief base contraction to rule base contraction, and show that two representation results of Hansson still hold for rule base contraction. Second, we show that the six so-called basic postulates of AGM contraction are consistent only for some input/output logics, but not for others. In particular, we show that the notorious recovery postulate can be satisfied only by basic output, but not by simple-minded output. Third, we show how AGM rule revision can be defined in terms of AGM rule contraction using the Levi identity. We highlight various topics for further research. (shrink)

Modern belief revision theory is based to a large extent on partial meet contraction that was introduced in the seminal article by Carlos Alchourrón, Peter Gärdenfors, and David Makinson that appeared in 1985. In the same year, Alchourrón and Makinson published a significantly different approach to the same problem, called safe contraction. Since then, safe contraction has received much less attention than partial meet contraction. The present paper summarizes the current state of knowledge on safe contraction, provides some new results (...) and offers a list of unsolved problems that are in need of investigation. (shrink)

This paper provides an analysis of contrary-to-duty reasoning from the proof-theoretical perspective of category theory. While Chisholm’s paradox hints at the need of dyadic deontic logic by showing that monadic deontic logics are not able to adequately model conditional obligations and contrary-to-duties, other arguments can be objected to dyadic approaches in favor of non-monotonic foundations. We show that all these objections can be answered at one fell swoop by modeling conditional obligations within a deductive system defined as an instance of (...) a symmetric monoidal closed category. Using category theory as a foundational framework for logic, we show that it is possible to model conditional normative reasoning and conflicting obligations within a monadic approach without adding further operators or considering deontic conditionals as primitive. (shrink)

We present two defeasible logics of norm-propositions (statements about norms) that (i) consistently allow for the possibility of normative gaps and normative conflicts, and (ii) map each premise set to a sufficiently rich consequence set. In order to meet (i), we define the logic LNP, a conflict- and gap-tolerant logic of norm-propositions capable of formalizing both normative conflicts and normative gaps within the object language. Next, we strengthen LNP within the adaptive logic framework for non-monotonic reasoning in order to meet (...) (ii). This results in the adaptive logics LNPr and LNPm, which interpret a given set of premises in such a way that normative conflicts and normative gaps are avoided ‘whenever possible’. LNPr and LNPm are equipped with a preferential semantics and a dynamic proof theory. (shrink)

This paper generalises classical revision theory of the AGM brand to sets of norms. This is achieved substituting input/output logic for classical logic and tracking the changes. Operations of derogation and amendment—analogues of contraction and revision—are defined and characterised, and the precise relationship between contraction and derogation, on the one hand, and derogation and amendment on the other, is established. It is argued that the notion of derogation, in particular, is a very important analytical tool, and that even core deontic (...) concepts such as that of permission resists a satisfactory analysis without it. By way of illustration the last section of the paper analyses the much debated concept of positive permission, of which there turns out to be more than one kind. (shrink)

Imperatives cannot be true or false, so they are shunned by logicians. And yet imperatives can be combined by logical connectives: "kiss me and hug me" is the conjunction of "kiss me" with "hug me". This example may suggest that declarative and imperative logic are isomorphic: just as the conjunction of two declaratives is true exactly if both conjuncts are true, the conjunction of two imperatives is satisfied exactly if both conjuncts are satisfied—what more is there to say? Much more, (...) I argue. "If you love me, kiss me", a conditional imperative, mixes a declarative antecedent ("you love me") with an imperative consequent ("kiss me"); it is satisfied if you love and kiss me, violated if you love but don't kiss me, and avoided if you don't love me. So we need a logic of three -valued imperatives which mixes declaratives with imperatives. I develop such a logic. (shrink)

This article aims to achieve two goals: to show that probability is not the only way of dealing with uncertainty ; and to provide evidence that logic-based methods can well support reasoning with uncertainty. For the latter claim, two paradigmatic examples are presented: logic programming with Kleene semantics for modelling reasoning from information in a discourse, to an interpretation of the state of affairs of the intended model, and a neural-symbolic implementation of input/output logic for dealing with uncertainty in dynamic (...) normative contexts. (shrink)

Realism for agents with unconditional beliefs, desires and intentions has been analyzed in modal logic. This paper provides a logical analysis of realism for agents with conditional beliefs and desires in a rule based approach analogous to Reiter's default logic. We distinguish two types of realism, which we call ‘a priori' and ‘a posteriori' realism. We analyze whether these two new properties are compatible with other properties discussed in the literature, such as existence of extensions. We show that Reiter's default (...) logic is too strong, in the sense that a weaker notion of maximality of extensions is needed to satisfy realism. Finally we show that several existing approaches do not satisfy the new realism properties, and we introduce a new construction that does satisfy them. (shrink)

The paper discusses ten philosophical problems in deontic logic: how to formally represent norms, when a set of norms may be termed ‘coherent’, how to deal with normative conflicts, how contraryto-duty obligations can be appropriately modeled, how dyadic deontic operators may be redefined to relate to sets of norms instead of preference relations between possible worlds, how various concepts of permission can be accommodated, how meaning postulates and counts-as conditionals can be taken into account, and how sets of norms may (...) be revised and merged. The problems are discussed from the viewpoint of input/output logic as developed by van der Torre & Makinson. We argue that norms, not ideality, should take the central position in deontic semantics, and that a semantics that represents norms, as input/output logic does, provides helpful tools for analyzing, clarifying and solving the problems of deontic logic. (shrink)

This article aims to achieve two goals: to show that probability is not the only way of dealing with uncertainty ; and to provide evidence that logic-based methods can well support reasoning with uncertainty. For the latter claim, two paradigmatic examples are presented: logic programming with Kleene semantics for modelling reasoning from information in a discourse, to an interpretation of the state of affairs of the intended model, and a neural-symbolic implementation of input/output logic for dealing with uncertainty in dynamic (...) normative contexts. (shrink)

Modelling a complex phenomenon such as the mind presents tremendous computational complexity challenges. Modelling field theory addresses these challenges in a non-traditional way. The main idea behind MFT is to match levels of uncertainty of the model with levels of uncertainty of the evaluation criterion used to identify that model. When a model becomes more certain, then the evaluation criterion is adjusted dynamically to match that change to the model. This process is called the Dynamic Logic of Phenomena for model (...) construction and it mimics processes of the mind and natural evolution. This paper provides a formal description of DLP by specifying its syntax, semantics, and reasoning system. We also outline links between DLP and other logical approaches. Computational complexity issues that motivate this work are presented using an example of polynomial models. (shrink)

In this paper I propose violation games as the basis of formal logics to represent and reason about norms, i.e. as the foundation of deontic logic. Deontic logic is an applied non-classical logic reflecting a way in which we conceptualize normative reasoning. By introducing violation games as a fundamental principle of deontic logic, I am introducing a new way of looking at familiar problems in normative reasoning, with the aim of introducing a new approach for handling norms in intelligent systems.

The volume analyses and develops David Makinson’s efforts to make classical logic useful outside its most obvious application areas. The book contains chapters that analyse, appraise, or reshape Makinson’s work and chapters that develop themes emerging from his contributions. These are grouped into major areas to which Makinsons has made highly influential contributions and the volume in its entirety is divided into four sections, each devoted to a particular area of logic: belief change, uncertain reasoning, normative systems and the resources (...) of classical logic. Among the contributions included in the volume, one chapter focuses on the “inferential preferential method”, i.e. the combined use of classical logic and mechanisms of preference and choice and provides examples from Makinson’s work in non-monotonic and defeasible reasoning and belief revision. One chapter offers a short autobiography by Makinson which details his discovery of modern logic, his travels across continents and reveals his intellectual encounters and inspirations. The chapter also contains an unusually explicit statement on his views on the role of logic in philosophy. (shrink)

Formal arguments are often represented by pairs, but in this paper we consider normative arguments represented by sequences of triples, where constitutive norms derive institutional facts from brute facts, and regulative norms derive deontic facts like obligations and permissions from institutional facts. The institutional facts may be seen as the reasons explaining or warranting the deontic obligations and permissions, and therefore they can be attacked by other normative arguments too. We represent different aspects of normative reasoning by different kinds of (...) consistency checks among these triples, and we use formal argumentation theory to resolve conflicts among such normative arguments. In particular, we introduce various requirements for arguing about norms concerning violations, contrary-to-duty obligations, dilemmas, conflict resolution and different kinds of norms, and we introduce a formal argumentation theory satisfying the requirements. In order to illustrate our framework, we introduce a running example based on university regulations for prospective and actual students. (shrink)

Input/output logics are abstract structures designed to represent conditional obligations and goals. In this paper we use them to study conditional permission. This perspective provides a clear separation of the familiar notion of negative permission from the more elusive one of positive permission. Moreover, it reveals that there are at least two kinds of positive permission. Although indistinguishable in the unconditional case, they are quite different in conditional contexts. One of them, which we call static positive permission, guides the citizen (...) and law enforcement authorities in the assessment of specific actions under current norms, and it behaves like a weakened obligation. Another, which we call dynamic positive permission, guides the legislator. It describes the limits on the prohibitions that may be introduced into a code, and under suitable conditions behaves like a strengthened negative permission. (shrink)

This paper is concerned with removing the identity schema from the axiomatic basis of deontic conditionals. This is in order to allow a stipulated ideal to be contrary or opposite in nature to the fact it is predicated upon. It is desirable, or so it is argued, to retain the order-theoretic orientation of preferential semantics towards the analysis of deontic conditionals, more specifically of maximality semantics in the tradition from Bengt Hansson. So understood, the problem involves abstracting away the settledness (...) assumption that is built in to maximality semantics. This is the assumption that what is optimal given ϕ is that which all the best ϕ-states have in common, notably ϕ itself. We propose a solution based on a strict and finite preference relation over which deontic conditionals are evaluated by letting ϕ-states evolve freely, as fate or fortune would have it, into different possibly ensuing optima that may but need not be ϕ-states themselves. The result is a deontic conditional that does not have identity. This new conditional is shown to be a proper generalization of the Hansson conditional. Hansson’s conditional can be recovered in the new idiom as a special case. Indeed, the new semantics is general enough to cover several apparently very different conceptions of deontic conditionality. For instance, the input/output logic known as basic output is a sublogic of the new system. This is somewhat surprising and suggests that there may yet be unity to be had in the field of deontic logic. (shrink)

When a conflict of duties arises, a resolution is often sought by use of an ordering of priority or importance. This paper examines how such a conflict resolution works, compares mechanisms that have been proposed in the literature, and gives preference to one developed by Brewka and Nebel. I distinguish between two cases – that some conflicts may remain unresolved, and that a priority ordering can be determined that resolves all – and provide semantics and axiomatic systems for accordingly defined (...) dyadic deontic operators. (shrink)

Counterfactuals are inherently ambiguous in the sense that the same counterfactual may be true under one mode of counterfactualization but false under the other. Many have regarded the ambiguity of counterfactuals as consisting in the distinction between forward-tracking and backtracking counterfactuals. This is incorrect since the ambiguity persists even in cases not involving backtracking counterfactualization. In this paper, I argue that causal modeling semantics has the resources enough for accounting for the ambiguity of counterfactuals. Specifically, we need to distinguish two (...) types of causal manipulation, which I call “intervention” and “extrapolation” respectively. To intervene in a causal model M is to change M’s structural equations in some specific ways, while to extrapolate M is to change the value assignment of M’s variables in some specific ways. I argue that intervention and extrapolation offer a natural explanation for the ambiguity of counterfactuals. (shrink)

Normative systems have been advocated as an effective tool to regulate interaction in multi-agent systems. The use of deontic operators and the ability to represent defeasible information are known to be two fundamental ingredients to represent and reason about normative systems. In this paper, after introducing a framework that combines standard deontic logic and non-monotonic logic programming, deontic logic programs (DLP), we tackle the fundamental problem of equivalence between normative systems using a deontic extension of David Pearce’s Equilibrium Logic and (...) its monotonic basis, the logic of Here-and-There. We also show how deontic logic programs can be used to represent and reason about normative systems, and establish a strong connection with input-output logic. (shrink)

Modeling a complex phenomena such as the mind presents tremendous computational complexity challenges. Modeling field theory (MFT) addresses these challenges in a non-traditional way. The main idea behind MFT is to match levels of uncertainty of the model (also, a problem or some theory) with levels of uncertainty of the evaluation criterion used to identify that model. When a model becomes more certain, then the evaluation criterion is adjusted dynamically to match that change to the model. This process is called (...) the Dynamic Logic of Phenomena (DLP) for model construction and it mimics processes of the mind and natural evolution. This paper provides a formal description of DLP by specifying its syntax, semantics, and reasoning system. We also outline links between DLP and other logical approaches. Computational complexity issues that motivate this work are presented using an example of polynomial models. (shrink)

This paper presents and discusses a novel approach to indeterministic belief revision. An indeterministic belief revision operator assumes that, when an agent is confronted with a new piece of information, it can revise its belief sets in more than one way. We define a rational agent not only in terms of what it believes but also of what it desires and wants to achieve. Hence, we propose that the agent’s goals play a role in the choice of (possibly) one of (...) the several available revision options. Properties of the new belief revision mechanism are also investigated. (shrink)

A single global authority is not sufficient to regulate heterogenous agents in multiagent systems based on distributed architectures, due to idiosyncratic local situations and to the need to regulate new issues as soon as they arise. On the one hand institutions should be structured as normative systems with a hierarchy of authorities able to cope with the dynamics of local situations, but on the other hand higher authorities should be able to delimit the autonomy of lower authorities to issue valid (...) norms. In this paper, we study the interplay of obligations and strong permissions in the context of hierarchies of authorities using input/output logic, because its explicit norm base facilitates reasoning about norm base maintenance, and it covers a variety of conditional obligations and permissions. We combine the logic with constraints, priorities and hierarchies of authorities. In this setting, we observe that Makinson and van der Torre’s notion of prohibition immunity for permissions is no longer sufficient, and we introduce a new notion of permission as exception and a new distinction between static and dynamic norms. We show how strong permissions can dynamically change an institution by adding exceptions to obligations, provide an explicit representation of what is permitted to the subjects of the normative system and allow higher level authorities to limit the power of lower level authorities to change the normative system. (shrink)

In this paper we present a Gentzen system for reasoning with contrary-to-duty obligations. The intuition behind the system is that a contrary-to-duty is a special kind of normative exception. The logical machinery to formalise this idea is taken from substructural logics and it is based on the definition of a new non-classical connective capturing the notion of reparational obligation. Then the system is tested against well-known contrary-to-duty paradoxes.

The DAPRECO knowledge base is the main outcome of the interdisciplinary project bearing the same name. It is a repository of rules written in LegalRuleML, an XML formalism designed to be a standard for representing the semantic and logical content of legal documents. The rules represent the provisions of the General Data Protection Regulation, the new Regulation that is significantly affecting the digital market in the European Union and beyond. The DAPRECO knowledge base builds upon the Privacy Ontology, which provides (...) a model for the legal concepts involved in the GDPR, by adding a further layer of constraints in the form of if-then rules, referring either to standard first order logic implications or to deontic statements. If-then rules are formalized in reified Input/Output logic and then codified in LegalRuleML. Reified Input/Output logic is an application of standard Input/Output logic for legal reasoning, in which Input/Output logic is combined with the reification-based approach in Hobbs and Gordon. The DAPRECO knowledge base is then a case study for reified Input/Output logic, and it shows that the formalism indeed appears to be a good candidate to effectively formalize, via uniform and simple representations, complex linguistic/deontic phenomena that may be found in legal texts. To date, the DAPRECO knowledge base is the biggest knowledge base in LegalRuleML and Input/Output logic freely available online. (shrink)

We translate unconstrained and constrained input/output logics as introduced by Makinson and van der Torre to modal logics, using adaptive logics for the constrained case. The resulting reformulation has some additional benefits. First, we obtain a proof-theoretic characterization of input/output logics. Second, we demonstrate that our framework naturally gives rise to useful variants and allows to express important notions that go beyond the expressive means of input/output logics, such as violations and sanctions.

This paper discusses the relation between deontic logic and the study of conversational interactions. Special attention is given to the notion of remedial interchange as analysed by sociologists and linguistic pragmaticians. This notion is close to the one of contrary-to-duty (reparational) obligation, which deontic logicians have been studying in its own right. The present article also investigates the question of whether some of the aspects of conversational interactions can fruitfully be described by using formal tools originally developed in the study (...) of iterated belief change. I here adapt the latter tools to deontic logic, and attempt an account of remedial interchange (and, more generally, contrary-to-duty reasoning) in terms of commutation. This account brings the dynamics of obligations to the fore. (shrink)

In this paper we study AGM contraction and revision of rules using input/output logical theories. We replace propositional formulas in the AGM framework of theory change by pairs of propositional formulas, representing the rule based character of theories, and we replace the classical consequence operator Cn by an input/output logic. The results in this paper suggest that, in general, results from belief base dynamics can be transferred to rule base dynamics, but that a similar transfer of AGM theory change to (...) rule change is much more problematic. First, we generalise belief base contraction to rule base contraction, and show that two representation results of Hansson still hold for rule base contraction. Second, we show that the six so-called basic postulates of AGM contraction are consistent only for some input/output logics, but not for others. In particular, we show that the notorious recovery postulate can be satisfied only by basic output, but not by simple-minded output. Third, we show how AGM rule revision can be defined in terms of AGM rule contraction using the Levi identity. We highlight various topics for further research. (shrink)

One goal of normative multi-agent system theory is to formulate principles for normative system change that maintain the rule-like structure of norms and preserve links between norms and individual agent obligations. A central question raised by this problem is whether there is a framework for norm change that is at once specific enough to capture this rule-like behavior of norms, yet general enough to support a full battery of norm and obligation change operators. In this paper we propose an answer (...) to this question by developing a bimodal logic for norms and obligations called NO. A key to our approach is that norms are treated as propositional formulas, and we provide some independent reasons for adopting this stance. Then we define norm change operations for a wide class of modal systems, including the class of NO systems, by constructing a class of modal revision operators that satisfy all the AGM postulates for revision, and constructing a class of modal contraction operators that satisfy all the AGM postulates for contraction. More generally, our approach yields an easily extendable framework within which to work out principles for a theory of normative system change. (shrink)

The aim of this paper is to strengthen the point made by Horty about the relationship between reason holism and moral particularism. In the literature prima facie obligations have been considered as the only source of reason holism. I strengthen Horty’s point in two ways. First, I show that contrary-to-duties provide another independent support for reason holism. Next I outline a formal theory that is able to capture these two sources of holism. While in simple settings the proposed account coincides (...) with Horty’s one, this is not true in more complicated or “realistic” settings in which more than two norms collide. My chosen formalism is so-called input/output logic. A bottom-line example is introduced. It raises the issue of whether the conventional wisdom is right in assuming that normative reasons run parallel to epistemic ones. (shrink)