The Right and the Good, a classic of twentieth-century philosophy by the great scholar Sir David Ross, is now presented in a new edition with a substantial introduction by Philip Stratton-Lake, a leading expert on Ross. Ross's book is the pinnacle of ethical intuitionism, which was the dominant moral theory in British philosophy for much of the nineteenth and early twentieth century. Intuitionism is now enjoying a considerable revival, and Stratton-Lake provides the context for a proper understanding of Ross's great (...) work today. (shrink)

This paper explains how to use a new software tool for argument diagramming available free on the Internet, showing especially how it can be used in the classroom to enhance critical thinking in philosophy. The user loads a text file containing an argument into a box on the computer interface, and then creates an argument diagram by dragging lines from one node to another. A key feature is the support for argumentation schemes, common patterns of defeasible reasoning historically know as (...) topics . Several examples are presented, as well as the results of an experiment in using the system with students in a university classroom. (shrink)

An extended review of what is known about the formal behaviour of nonmonotonic inference operations, including those generated by the principal systems in the artificial intelligence literature. Directed towards computer scientists and others with some background in logic.

"A sequel to Pollock's How to Build a Person, this volume builds upon that theoretical groundwork for the implementation of rationality through artificial ...

An abstract framework for structured arguments is presented, which instantiates Dung's ('On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming, and n- Person Games', Artificial Intelligence , 77, 321-357) abstract argumentation frameworks. Arguments are defined as inference trees formed by applying two kinds of inference rules: strict and defeasible rules. This naturally leads to three ways of attacking an argument: attacking a premise, attacking a conclusion and attacking an inference. To resolve such attacks, preferences may (...) be used, which leads to three corresponding kinds of defeat: undermining, rebutting and undercutting defeats. The nature of the inference rules, the structure of the logical language on which they operate and the origin of the preferences are, apart from some basic assumptions, left unspecified. The resulting framework integrates work of Pollock, Vreeswijk and others on the structure of arguments and the nature of defeat and extends it in several respects. Various rationality postulates are proved to be satisfied by the framework, and several existing approaches are proved to be a special case of the framework, including assumption-based argumentation and DefLog. (shrink)

FOUNDATIONS OF ETHICS THE GIFFORD LECTURES delivered in the University of Aberdeen, 1935-6 by SIR W. DAVID ROSS Provost of Oriel College, Oxford President of..

The book can also be used as an excellent text for graduate-level courses in AI, operations research, or applied probability.

In this much-anticipated book, Jonathan Dancy offers the only available full-scale treatment of particularism in ethics, a view with which he has been associated for twenty years. Dancy now presents particularism as the view that the possibility of moral thought and judgement does not in any way depend on an adequate supply of principles. He grounds this claim on a form of reasons-holism, holding that what is a reason in one case need not be any reason in another, and maintaining (...) that moral reasons are no different in this respect from others. Ethics Without Principles offers detailed treatment and criticism of opposing positions of all sorts, with useful summaries. It also contains three chapters on the nature of what Dancy calls 'contributory' reasons, which, though the topic of much interest at the moment, are not often discussed in anything like the detail given here. And it offers a distinctive form of value-holism to go with the holism of reasons. As Dancy's definitive statement on particularism, the book will be required reading for all those working on moral philosophy and ethical theory. (shrink)

Counterfactuals is David Lewis' forceful presentation of and sustained argument for a particular view about propositions which express contrary to fact conditionals, including his famous defense of realism about possible worlds and his theory of laws of nature.

In this sequence of philosophical essays about natural science, the author argues that fundamental explanatory laws, the deepest and most admired successes of modern physics, do not in fact describe regularities that exist in nature. Cartwright draws from many real-life examples to propound a novel distinction: that theoretical entities, and the complex and localized laws that describe them, can be interpreted realistically, but the simple unifying laws of basic theory cannot.

This paper dwells upon formal models of changes of beliefs, or theories, which are expressed in languages containing a binary conditional connective. After defining the basic concept of a (non-trivial) belief revision model. I present a simple proof of Gärdenfors''s (1986) triviality theorem. I claim that on a proper understanding of this theorem we must give up the thesis that consistent revisions (additions) are to be equated with logical expansions. If negated or might conditionals are interpreted on the basis of (...) autoepistemic omniscience, or if autoepistemic modalities (Moore) are admitted, even more severe triviality results ensue. It is argued that additions cannot be philosophically construed as parasitic (Levi) on expansions. In conclusion I outline somed logical consequences of the fact that we must not expect monotonic revisions in languages including conditionals. (shrink)

The goal of this paper is to frame a theory of reasons--what they are, how they support actions or conclusions--using the tools of default logic. After sketching the basic account of reasons as provided by defaults, I show how it can be elaborated to deal with two more complicated issues: first, situations in which the priority relation among defaults, and so reasons as well, is itself established through default reasoning; second, the treatment of undercutting defeat and exclusionary reasons. Finally, and (...) by way of application, I show how the resulting account can shed some light on Jonathan Dancy's argument from reason holism to a form of extreme particularism in moral theory. (shrink)

This paper presents a formal account of how to determine the discourse relations between propositions introduced in a text, and the relations between the events they describe. The distinct natural interpretations of texts with similar syntax are explained in terms of defeasible rules. These characterise the effects of causal knowledge and knowledge of language use on interpretation. Patterns of defeasible entailment that are supported by the logic in which the theory is expressed are shown to underly temporal interpretation.

Princeton University Press, 1974. This book is out of print, but can be downloaded as a pdf file (5 MB).

Rule-applying legal arguments are traditionally treated as a kind of syllogism. Such a treatment overlooks the fact that legal principles and rules are not statements which describe the world, but rather means by which humans impose structure on the world. Legal rules create legal consequences, they do not describe them. This has consequences for the logic of rule- and principle-applying arguments, the most important of which may be that such arguments are defeasible. This book offers an extensive analysis of the (...) role of rules and principles in legal reasoning, which focuses on the close relationship between rules, principles, and reasons. Moreover, it describes a logical theory which assigns a central place to the notion of reasons for and against a conclusion, and which is especially suited to deal with rules and principles. (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.

Evidential reasoning is hard, and errors can lead to miscarriages of justice with serious consequences. Analytic methods for the correct handling of evidence come in different styles, typically focusing on one of three tools: arguments, scenarios or probabilities. Recent research used Bayesian networks for connecting arguments, scenarios, and probabilities. Well-known issues with Bayesian networks were encountered: More numbers are needed than are available, and there is a risk of misinterpretation of the graph underlying the Bayesian network, for instance as a (...) causal model. The formalism presented here models presumptive arguments about coherent hypotheses that are compared in terms of their strength. No choice is needed between qualitative or quantitative analytic styles, since the formalism can be interpreted with and without numbers. The formalism is applied to key concepts in argumentative, scenario and probabilistic analyses of evidential reasoning, and is illustrated with a fictional crime investigation example based on Alfred Hitchcock’s film ‘To Catch A Thief’. (shrink)

A textbook for graduate students of philosophy, computer science, and mathematics, on various approaches to nonmonotonic logic, with emphasis on they way in which they fall into an overall pattern.

In this paper it is argued that, in order to solve the problem of iterated belief change, both the belief state and its input should be represented as epistemic entrenchment (EE) relations. A belief revision operation is constructed that updates a given EE relation to a new one in light of an evidential EE relation. It is shown that the operation in question satisfies generalized versions of the Gärdenfors revision postulates. The account offered is motivated by Spohn's ordinal conditionalization functions, (...) and can be seen as the Jeffrization of a proposal considered by Rott. (shrink)

We present new probabilistic generalizations of Pearl’s entailment in System Z and Lehmann’s lexicographic entailment, called Zλ- and lexλ-entailment, which are parameterized through a value λ ∈ [0,1] that describes the strength of the inheritance of purely probabilistic knowledge. In the special cases of λ = 0 and λ = 1, the notions of Zλ- and lexλ-entailment coincide with probabilistic generalizations of Pearl’s entailment in System Z and Lehmann’s lexicographic entailment that have been recently introduced by the author. We show (...) that the notions of Zλ- and lexλ-entailment have similar properties as their classical counterparts. In particular, they both satisfy the rationality postulates of System P and the property of Rational Monotonicity. Moreover, Zλ-entailment is weaker than lexλ-entailment, and both Zλ- and lexλ-entailment are proper generalizations of their classical counterparts. (shrink)

First published in 1985, D. M. Armstrong's original work on what laws of nature are has continued to be influential in the areas of metaphysics and philosophy of science. Presenting a definitive attack on the sceptical Humean view, that laws are no more than a regularity of coincidence between stances of properties, Armstrong establishes his own theory and defends it concisely and systematically against objections. Presented in a fresh twenty-first-century series livery, and including a specially commissioned preface written by Marc (...) Lange, illuminating its continuing importance and relevance to philosophical enquiry, this influential work is available for a new generation of readers. (shrink)

We consider the connections between belief revision, conditional logic and nonmonotonic reasoning, using as a foundation the approach to theory change developed by Alchourrón, Gärdenfors and Makinson (the AGM approach). This is first generalized to allow the iteration of theory change operations to capture the dynamics of epistemic states according to a principle of minimal change of entrenchment. The iterative operations of expansion, contraction and revision are characterized both by a set of postulates and by Grove's construction based on total (...) pre-orders on the set of complete theories of the belief logic. We present a sound and complete conditional logic whose semantics is based on our iterative revision operation, but which avoids Gärdenfors's triviality result because of a severely restricted language of beliefs and hence the weakened scope of our extended postulates. In the second part of the paper, we develop a computational approach to theory dynamics using Rott's E-bases as a representation for epistemic states. Under this approach, a ranked E-base is interpreted as standing for the most conservative entrenchment compatible with the base, reflecting a kind of foundationalism in the acceptance of evidence for a belief. Algorithms for the computation of our iterative versions of expansion, contraction and revision are presented. Finally, we consider the relationship between nonmonotonic reasoning and both conditional logic and belief revision. Adapting the approach of Delgrande, we show that the unique extension of a default theory expressed in our conditional logic of belief revision corresponds to the most conservative belief state which respects the theory: however, this correspondence is limited to propositional default theories. Considering first order default theories, we present a belief revision algorithm which incorporates the assumption of independence of default instances and propose the use of a base logic for default reasoning which incorporates uniqueness of names. We conclude with an examination of the behavior of an implemented system on some of Lifschitz's benchmark problems in nonmonotonic reasoning. (shrink)

1: Linguistic and Epistemological Background 1 . 1 : Generic Reference vs. Generic Predication 1 . 2 : Why are there any Generic Sentences at all? 1 . 3 : Generics and Exceptions, Two Bad Attitudes 1 . 4 : Exceptions and Generics, Some Other Attitudes 1 . 5 : Generics and Intensionality 1 . 6 : Goals of an Analysis of Generic Sentences 1 . 7 : A Little Notation 1 . 8 : Generics vs. Explicit Statements of Regularities..

This paper presents a nonmonotonic deontic logic based on commonsense entailment. It establishes criteria a successful account of obligation should satisfy, and develops a theory that satisfies them. The theory includes two conditional notions of prima facie obligation. One is constitutive; the other is epistemic, and follows nonmonotonically from the constitutive notion. The paper defines unconditional notions of prima facie obligation in terms of the conditional notions.

We study a probabilistic logic based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence). We examine probabilistic conditional knowledge bases associated with imprecise probability assessments defined on arbitrary families of conditional events. We introduce a notion of conditional interpretation defined directly in terms of precise probability assessments. We also examine a property of strong satisfiability which is related to the notion of toleration well known in default reasoning. In our framework we give more (...) general definitions of the notions of probabilistic consistency and probabilistic entailment of Adams. We also recall a notion of strict p-consistency and some related results. Moreover, we give new proofs of some results obtained in probabilistic default reasoning. Finally, we examine the relationships between conditional probability rankings and the notions of g-coherence and g-coherent entailment. (shrink)

A study in the logic of theory change, examining the properties of maxichoice contraction and revision operations.

In this wide-ranging philosophical work, Koons takes on two powerful dogmas--anti-realism and materialism.

An assertion of high conditional probability or, more briefly, an HCP assertion is a statement of the type: The conditional probability of B given A is close to one. The goal of this paper is to construct logics of HCP assertions whose conclusions are highly likely to be correct rather than certain to be correct. Such logics would allow useful conclusions to be drawn when the premises are not strong enough to allow conclusions to be reached with certainty. This goal (...) is achieved by taking Adams' (1966) logic, changing its intended application from conditionals to HCP assertions, and then weakening its criterion for entailment. According to the weakened entailment criterion, called the Criterion of Near Surety and which may be loosely interpreted as a Bayesian criterion, a conclusion is entailed if and only if nearly every model of the premises is a model of the conclusion. The resulting logic, called NSL, is nonmonotonic. Entailment in this logic, although not as strict as entailment in Adams' logic, is more strict than entailment in the propositional logic of material conditionals. Next, NSL was modified by requiring that each HCP assertion be scaled; this means that to each HCP assertion was associated a bound on the deviation from 1 of the conditional probability that is the subject of the assertion. Scaling of HCP assertions is useful for breaking entailment deadlocks. For example, it it is known that the conditional probabilities of C given A and of - C given B are both close to one but the bound on the former's deviation from 1 is much smaller than the latter's, then it may be concluded that in all likelihood the conditional probability of C given A ∧ B is close to one. The resulting logic, called NSL-S, is also nonmonotonic. Despite great differences in their definitions of entailment, entailment in NSL is equivalent to Lehmann and Magidor's rational closure and, disregarding minor differences concerning which premise sets are considered consistent, entailment in NSL-S is equivalent to entailment in Goldszmidt and Pearl's System-Z⁺. Bacchus, Grove, Halpern, and Koller proposed two methods of developing a predicate calculus based on the Criterion of Near Surety. In their randomstructures method, which assumed a prior distribution similar to that of NSL, it appears possible to define an entailment relation equivalent to that of NSL. In their random-worlds method, which assumed a prior distribution dramatically different from that of NSL, it is known that the entailment relation is different from that of NSL. (shrink)