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)

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)

This article proposes a systematic application of recent developments in the logic of preference to a number of topics in deontic logic. The key junction is the well-known Hansson conditional for dyadic obligations. These conditionals are generalized by pairing them with reasoning about syntactic priority structures. The resulting two-level approach to obligations is tested first against standard scenarios of contrary-to-duty obligations, leading also to a generalization for the Kanger-Anderson reduction of deontic logic. Next, the priority framework is applied to model (...) two intuitively different sorts of deontic dynamics of obligations, based on information changes and on genuine normative events. In this two-level setting, we also offer novel takes on vexed issues such as the Chisholm paradox and modelling strong permission. Finally, the priority framework is shown to provide a unifying setting for the study of operations on norms as such, in particular, adding or deleting individual norms, and even merging whole norm systems in different manners. (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)

We present the inconsistency-adaptive deontic logic DP r , a nonmonotonic logic for dealing with conflicts between normative statements. On the one hand, this logic does not lead to explosion in view of normative conflicts such as O A ∧ O ∼A, O A ∧ P ∼A or even O A ∧ ∼O A. On the other hand, DP r still verifies all intuitively reliable inferences valid in Standard Deontic Logic (SDL). DP r interprets a given premise set ‘as normally (...) as possible’ with respect to SDL. Whereas some SDL-rules are verified unconditionally by DP r , others are verified conditionally. The latter are applicable unless they rely on formulas that turn out to behave inconsistently in view of the premises. This dynamic process is mirrored by the proof theory of DP r. (shrink)

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)

This article proposes a systematic application of recent developments in the logic of preference to a number of topics in deontic logic. The key junction is the well‐known Hansson conditional for dyadic obligations. These conditionals are generalized by pairing them with reasoning about syntactic priority structures. The resulting two‐level approach to obligations is tested first against standard scenarios of contrary‐to‐duty obligations, leading also to a generalization for the Kanger‐Anderson reduction of deontic logic. Next, the priority framework is applied to model (...) two intuitively different sorts of deontic dynamics of obligations, based on information changes and on genuine normative events. In this two‐level setting, we also offer novel takes on vexed issues such as the Chisholm paradox and modelling strong permission. Finally, the priority framework is shown to provide a unifying setting for the study of operations on norms as such, in particular, adding or deleting individual norms, and even merging whole norm systems in different manners. (shrink)

Philosophers like G.H. von Wright and D. Makinson have pointed to serious challenges regarding the foundations of deontic logic. In this paper, I suggest that to deal successfully with these challenges a reconsideration of the research program of the discipline is useful. Some problems that have troubled this particular field of logical study for decades may disappear or appear more tractable if we view them from the perspective of a language game introduced by D. Lewis involving three characters: the Master, (...) the Slave and the Kibitzer. The adoption of this perspective opens a natural approach to a new layout of the domain of deontic studies. I propose dividing deontic logic into six sub-areas which are distinguished by their focus on the different idioms typical of the individual players, by conceiving the language game as either being static or as dynamic and by the aims of the logical inquiry. What kind of insights the proposed perspective provides is illustrated by an analysis of the so-called Ross paradox—a problem that has troubled deontic logic since its origins and, though it was many times pronounced solved, still keeps coming back ‘alive and kicking’. (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 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)

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)

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)

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)

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)

The effectiveness of a compliance management framework can be guaranteed only if the framework is based on sound conceptual and formal foundations. In particular, the formal language used in the CMF is able to expressively represent the specifications of normative requirements that impose constraints on various activities of a business process. However, if the language used lacks expressiveness and the modelling constructs proposed in the CMF are not able to properly represent different types of norms, it can significantly impede the (...) reliability of the compliance results produced by the CMF. This paper investigates whether existing CMFs are able to provide reasoning and modeling support for various types of normative requirements by evaluating the conceptual foundations of the modeling constructs that existing CMFs use to represent a specific type of norm. The evaluation results portray somewhat a bleak picture of the state-of-the-affairs when it comes to represent norms as none of the existing CMFs is able to provide a comprehensive reasoning and modeling support. Also, it points to the shortcomings of the CMFs and emphasises exigent need of new modeling languages with sound theoretical and formal foundations for representing legal norms. (shrink)

In this paper we propose an extension of Defeasible Logic to represent and compute different concepts of defeasible permission. In particular, we discuss some types of explicit permissive norms that work as exceptions to opposite obligations or encode permissive rights. Moreover, we show how strong permissions can be represented both with, and without introducing a new consequence relation for inferring conclusions from explicit permissive norms. Finally, we illustrate how a preference operator applicable to contrary-to-duty obligations can be combined with a (...) new operator representing ordered sequences of strong permissions. The logical system is studied from a computational standpoint and is shown to have linear computational complexity. (shrink)

One main goal of argumentation theory is to evaluate arguments and to determine whether they should be accepted or rejected. When there is no clear answer, a third option, being undecided, has to be taken into account. Indecision is often not considered explicitly, but rather taken to be a collection of all unclear or troubling cases. However, current philosophy makes a strong point for taking indecision itself to be a proper object of consideration. This paper aims at revealing parallels between (...) the findings concerning indecision in philosophy and the treatment of indecision in argumentation theory. By investigating what philosophical forms and norms of indecision are involved in argumentation theory, we can improve our understanding of the different uncertain evidential situations in argumentation theory. (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)

It's natural to think that the principles expressed by the statements "Promises ought to be kept" and "We ought to help those in need" are defeasible. But how are we to make sense of this defeasibility? On one proposal, moral principles have hedges or built-in unless clauses specifying the conditions under which the principle doesn't apply. On another, such principles are contributory and, thus, do not specify which actions ought to be carried out, but only what counts in favor or (...) against them. Drawing on a defeasible logic framework, this paper sets up three models: one model for each proposal, as well as a third model capturing a mixed view on principles that combines them. It then explores the structural connections between the three models and establishes some equivalence results, suggesting that the seemingly different views captured by the models are closer than standardly thought. (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)

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)