ABSTRACT Inspired by legal reasoning, this paper presents a semantics and proof theory of a system for defeasible argumentation. Arguments are expressed in a logic-programming language with both weak and strong negation, conflicts between arguments are decided with the help of priorities on the rules. An important feature of the system is that these priorities are not fixed, but are themselves defeasibly derived as conclusions within the system. Thus debates on the choice between conflicting arguments can also be modelled. The (...) semantics of the system is given with a fixpoint definition, while its proof theory is stated in dialectical style, where a proof takes the form of a dialogue between a proponent and an opponent of an argument: an argument is shown to be justified if the proponent can make the opponent run out of moves in whatever way the opponent attacks. (shrink)

The present volume is a sequel to Deontic Logic: Introductory and Systematic Readings : its purpose is to offer a view of some of the main directions of research in contemporary deontic logic. Most of the articles included in Introductory and Systematic Readings represent what may be called the standard modal approach to deontic logic, in which de on tic logic is treated as a branch of modal logic, and the normative concepts of obligation, permission and prohibition are regarded as (...) analogous to the "alethic" modalities necessity, possibility and impossibility. As Simo Knuuttila shows in his contribution to the present volume, this approach goes back to late medieval philosophy. Several 14th century philosophers observed the analogies between deontic and alethic modalities and discussed the deontic interpretations of various laws of modal logic. In contemporary deontic logic the modal approach was revived by G. H. von Wright's classic paper 'Deontic Logic'. Certain analogies between deontic and alethic modalities are obvious and uncontroversial, but the standard approach has often been criticized on the ground that it exaggerates the analogies and tends to ignore those features of normative concepts which distinguish them from other modalities. (shrink)

There was a long tradition in philosophy according to which good reasoning had to be deductively valid. However, that tradition began to be questioned in the 1960’s, and is now thoroughly discredited. What caused its downfall was the recognition that many familiar kinds of reasoning are not deductively valid, but clearly confer justification on their conclusions. Here are some simple examples.

This paper points out some problems with two recent logical systems – one due to Prakken and Sartor, the other due to Kowalski and Toni – designedfor the representation of defeasible arguments in general, but with a specialemphasis on legal reasoning.

A central theme throughout the impressive series of philosophical books and articles Stephen Toulmin has published since 1948 is the way in which assertions and opinions concerning all sorts of topics, brought up in everyday life or in academic research, can be rationally justified. Is there one universal system of norms, by which all sorts of arguments in all sorts of fields must be judged, or must each sort of argument be judged according to its own norms? In The Uses (...) of Argument Toulmin sets out his views on these questions for the first time. In spite of initial criticisms from logicians and fellow philosophers, The Uses of Argument has been an enduring source of inspiration and discussion to students of argumentation from all kinds of disciplinary background for more than forty years. (shrink)

A textbook on modal logic, intended for readers already acquainted with the elements of formal logic, containing nearly 500 exercises. Brian F. Chellas provides a systematic introduction to the principal ideas and results in contemporary treatments of modality, including theorems on completeness and decidability. Illustrative chapters focus on deontic logic and conditionality. Modality is a rapidly expanding branch of logic, and familiarity with the subject is now regarded as a necessary part of every philosopher's technical equipment. Chellas here offers an (...) up-to-date and reliable guide essential for the student. (shrink)

In a previous paper we developed a general theory of input/output logics. These are operations resembling inference, but where inputs need not be included among outputs, and outputs need not be reusable as inputs. In the present paper we study what happens when they are constrained to render output consistent with input. This is of interest for deontic logic, where it provides a manner of handling contrary-to-duty obligations. Our procedure is to constrain the set of generators of the input/output system, (...) considering only the maximal subsets that do not yield output conflicting with a given input. When inputs are authorised to reappear as outputs, both maxichoice revision in the sense of Alchourr6n/Makinson and the default logic of Poole emerge as special cases, and there is a close relation with Reiter default logic. However, our focus is on the general case where inputs need not be outputs. We show in what contexts the consistency of input with output may be reduced to its consistency with a truth-functional combination of components of generators, and under what conditions constrained output may be obtained by a derivation that is constrained at every step. (shrink)

The aim of this paper is twofold: (i) to introduce the framework of update semantics and to explain what kind of semantic phenomena may successfully be analysed in it: (ii) to give a detailed analysis of one such phenomenon: default reasoning.

We investigate under what conditions contrary-to-duty (CTD) structures lacking temporal and action elements can be given a coherent reading. We argue, contrary to some recent proposals, that CTD is not an instance of defeasible reasoning, and that methods of nonmonotonic logics are inadequate since they are unable to distinguish between defeasibility and violation of primary obligations. We propose a semantic framework based on the idea that primary and CTD obligations are obligations of different kinds: a CTD obligation pertains to, or (...) pre-supposes, a certain context in which a primary obligation is already violated. This framework is presented initially as an extension of Standard Deontic Logic (SDL), a normal modal logic of type KD, and is illustrated by application to a series of examples. The concluding section is concerned with some resemblances between CTD and defeasible reasoning. We show first that the SDL-based framework contains a flaw and must be adjusted. A discussion of possible adjustments, including an alternative treatment in terms of a preference-based semantics, reveals difficulties that are reminiscent of problems in defeasible reasoning and intensional accounts of defeasible conditionals. (shrink)

Several years ago I came across a marvelous little paper in which Hector-Neri Castaneda shows that standard versions of act utilitarian l ism are formally incoherent. I was intrigued by his argument. It had long seemed to me that I had a firm grasp on act utilitarianism. Indeed, it had often seemed to me that it was the clearest and most attractive of normative theories. Yet here was a simple and relatively uncontrover sial argument that showed, with only some trivial (...) assumptions, that the doctrine is virtually unintelligible. The gist of Castaneda's argument is this: suppose we understand act utilitarianism to be the view that an act is obligatory if and only if its utility exceeds that of each alternative. Suppose it is obligatory for a certain person to perform an act with two parts - we can call it 'A & B'. Then, obviously enough, it is also obligatory for this person to perform the parts, A and B. If act utilitarianism were true, we appar ently could infer that the utility of A & B is higher than that of A, and higher than that of B (because A & B is obligatory, and the other acts are alternatives to A & B). (shrink)

It is natural and important to have a formal representation of plain belief, according to which propositions are held true, or held false, or neither. (In the paper this is called a deterministic representation of epistemic states). And it is of great philosophical importance to have a dynamic account of plain belief. AGM belief revision theory seems to provide such an account, but it founders at the problem of iterated belief revision, since it can generally account only for one step (...) of revision. The paper discusses and rejects two solutions within the confines of AGM theory. It then introduces ranking functions (as I prefer to call them now; in the paper they are still called ordinal conditional functions) as the proper (and, I find, still the best) solution of the problem, proves that conditional independence w.r.t. ranking functions satisfies the so-called graphoid axioms, and proposes general rules of belief change (in close analogy to Jeffrey's generalized probabilistic conditionalization) that encompass revision and contraction as conceived in AGM theory. Indeed, the parallel to probability theory is amazing. Probability theory can profit from ranking theory as well since it is also plagued by the problem of iterated belief revision even if probability measures are conceived as Popper measures (see No. 11). Finally, the theory is compared with predecessors which are numerous and impressive, but somehow failed to explain the all-important conditional ranks in the appropriate way. (shrink)

Since the early 1980s, logical theories of belief revision have offered formal methods for the transformation of knowledge bases or “corpora” of data and beliefs. Early models have dealt with unconditional acceptance and integration of potentially belief-contravening pieces of information into the existing corpus. More recently, models of “non-prioritized” revision were proposed that allow the agent rationally to refuse to accept the new information. This paper introduces a refined method for changing beliefs by specifying constraints on the relative plausibility of (...) propositions. Like the earlier belief revision models, the method proposed is a qualitative one, in the sense that no numbers are needed in order to specify the posterior plausibility of the new information. We use reference beliefs in order to determine the degree of entrenchment of the newly accepted piece of information. We provide two kinds of semantics for this idea, give a logical characterization of the new model, study its relation with other operations of belief revision and contraction, and discuss its intuitive strengths and weaknesses. (shrink)

We discuss similarities and residual differences, within the general semantic framework of minimality, between defeasible inference, belief revision, counterfactual conditionals, updating — and also conditional obligation in deontic logic. Our purpose is not to establish new results, but to bring together existing material to form a clear overall picture.

This paper develops an informal semantics for 'ought to be' and 'ought to be given...' and argues for its plausibility. A feature of the semantics is that it invalidates 'if a entails b, And o(a), Then o(b)' and 'if o(a) & o(b), Then o(a&b)', While validating detachment for conditional obligation.

We describe a model of iterated belief revision that extends the AGM theory of revision to account for the effect of a revision on the conditional beliefs of an agent. In particular, this model ensures that an agent makes as few changes as possible to the conditional component of its belief set. Adopting the Ramsey test, minimal conditional revision provides acceptance conditions for arbitrary right-nested conditionals. We show that problem of determining acceptance of any such nested conditional can be reduced (...) to acceptance tests for unnested conditionals. Thus, iterated revision can be accomplished in a "virtual" manner, using uniterated revision. (shrink)