Over the past few decades, cognitive science has identified several forms of reasoning that make essential use of conceptual knowledge. Despite significant theoretical and empirical progress, there is still no unified framework for understanding how concepts are used in reasoning. This paper argues that the theory of conceptual spaces is capable of filling this gap. Our strategy is to demonstrate how various inference mechanisms which clearly rely on conceptual information—including similarity, typicality, and diagnosticity-based reasoning—can be modeled using principles derived from (...) conceptual spaces. Our first topic analyzes the role of expectations in inductive reasoning and their relation to the structure of our concepts. We examine the relationship between using generic expressions in natural language and common-sense reasoning as a second topic. We propose that the strength of a generic can be described by distances between properties and prototypes in conceptual spaces. Our third topic is category-based induction. We demonstrate that the theory of conceptual spaces can serve as a comprehensive model for this type of reasoning. The final topic is analogy. We review some proposals in this area, present a taxonomy of analogical relations, and show how to model them in terms of distances in conceptual spaces. We also briefly discuss the implications of the model for reasoning with concepts in artificial systems. (shrink)

In this paper, we outline a comprehensive approach to composed analogies based on the theory of conceptual spaces. Our algorithmic model understands analogy as a search procedure and builds upon the idea that analogical similarity depends on a conceptual phenomena called ‘dimensional salience.’ We distinguish between category-based, property-based, event-based, and part-whole analogies, and propose computationally-oriented methods for explicating them in terms of conceptual spaces.

Category-based induction is an inferential mechanism that uses knowledge of conceptual relations in order to estimate how likely is for a property to be projected from one category to another. During the last decades, psychologists have identified several features of this mechanism, and they have proposed different formal models of it. In this article; we propose a new mathematical model for category-based induction based on distances on conceptual spaces. We show how this model can predict most of the properties of (...) this kind of reasoning while providing a solid theoretical foundation for it. We also show that it subsumes some of the previous models proposed in the literature and that it generates new predictions. (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)

This paper presents a uniform semantic treatment of nonmonotonic inference operations that allow for inferences from infinite sets of premises. The semantics is formulated in terms of selection functions and is a generalization of the preferential semantics of Shoham (1987), (1988), Kraus, Lehman, and Magidor (1990) and Makinson (1989), (1993). A selection function picks out from a given set of possible states (worlds, situations, models) a subset consisting of those states that are, in some sense, the most preferred ones. A (...) proposition α is a nonmonotonic consequence of a set of propositions Γ iff α holds in all the most preferred Γ-states. In the literature on revealed preference theory, there are a number of well-known theorems concerning the representability of selection functions, satisfying certain properties, in terms of underlying preference relations. Such theorems are utilized here to give corresponding representation theorems for nonmonotonic inference operations. At the end of the paper, the connection between nonmonotonic inference and belief revision, in the sense of Alchourrón, Gärdenfors, and Makinson, is explored. In this connection, infinitary belief revision operations that allow for the revision of a theory with a possibly infinite set of propositions are introduced and characterized axiomatically. (shrink)

In a recent article, Zhang and Foo generalized the AGM postulates for contraction to include infinite epistemic input. The new type of belief change is called set contraction. Zhang and Foo also introduced a constructive model for set contraction, called nicely ordered partition, as a generalization of epistemic entrenchment. It was shown however that the functions induced from nicely ordered partitions do not quite match the postulates for set contraction. The mismatch was fixed with the introduction of an extra condition (...) called the limit postulate. The limit postulate establishes a connection between contraction by infinite epistemic input and contraction by finite epistemic input (reducing the former to the latter) and it is appealing both on mathematical and on conceptual grounds. It is debatable however whether the limit postulate can be adopted as a general feature of rationality in set contraction. Instead we propose that the limit postulate is viewed as a condition characterizing an important special case of set contraction functions. With this reading in mind, in this article we introduce an alternative generalization of epistemic entrenchment, based on the notion of comparative possibility. We prove that the functions induced from comparative possibility preorders precisely match those satisfying the postulates for set contraction (without the limit postulate). The relationship between comparative possibility and epistemic entrenchment is also investigated. Finally, we formulate necessary and sufficient conditions under which the functions induced from comparative possibility preorders coincide with the special class of contraction functions characterized by the limit postulate. (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)

Hans Rott has argued, most recently in his book Change, Choice and Inference, that certain formal correspondences between belief revision and rational choice have important philosophical implications, claiming that the former strongly indicate the unity of practical and theoretical reason as well as the primacy of practical reason. In this paper, I confront Rott's argument with three serious challenges. My conclusion is that, while Rott's work is indisputable as a formal achievement, the philosophical consequences he wants to draw are not (...) forthcoming. (shrink)

A vast and interesting family of natural semantics for belief revision is defined. Suppose one is given a distance d between any two models. One may then define the revision of a theory K by a formula α as the theory defined by the set of all those models of α that are closest, by d, to the set of models of K. This family is characterized by a set of rationality postulates that extends the AGM postulates. The new postulates (...) describe properties of iterated revisions. (shrink)

The paper studies first order extensions of classical systems of modal logic (see (Chellas, 1980, part III)). We focus on the role of the Barcan formulas. It is shown that these formulas correspond to fundamental properties of neighborhood frames. The results have interesting applications in epistemic logic. In particular we suggest that the proposed models can be used in order to study monadic operators of probability (Kyburg, 1990) and likelihood (Halpern-Rabin, 1987).

Since the earliest formalisation of default logic by Reiter many contributions to this appealing approach to nonmonotonic reasoning have been given. The different formalisations are here presented in a general framework that gathers the basic notions, concepts and constructions underlying default logic. Our view is to interpret defaults as special rules that impose a restriction on the juxtaposition of monotonic Hubert-style proofs of a given logicL. We propose to describe default logic as a logic where the juxtaposition of default proofs (...) is subordinate to a restriction condition . Hence a default logic is a pair (L, ) where properties of the logic , like compactness, can be interpreted through the restriction condition . Different default systems are then given a common characterization through a specific condition on the logicL. We also prove cumulativity for any default logic (L, ) by slightly modifying the notion of default proof. We extend, in fact, the language ofL in a way close to that followed by Brewka in the formulation of his cumulative default system. Finally we show the existence of infinitely many intermediary default logics, depending on and called linear logics, which lie between Reiter's and ukaszewicz' versions of default logic. (shrink)

In Gärdenfors and Makinson :197–245, 1994) and Gärdenfors it was shown that it is possible to model nonmonotonic inference using a classical consequence relation plus an expectation-based ordering of formulas. In this article, we argue that this framework can be significantly enriched by adopting a conceptual spaces-based analysis of the role of expectations in reasoning. In particular, we show that this can solve various epistemological issues that surround nonmonotonic and default logics. We propose some formal criteria for constructing and updating (...) expectation orderings based on conceptual spaces, and we explain how to apply them to nonmonotonic reasoning about objects and properties. (shrink)

This book provides a critical examination of how the choice of what to believe is represented in the standard model of belief change. In particular the use of possible worlds and infinite remainders as objects of choice is critically examined. Descriptors are introduced as a versatile tool for expressing the success conditions of belief change, addressing both local and global descriptor revision. The book presents dynamic descriptors such as Ramsey descriptors that convey how an agent’s beliefs tend to be changed (...) in response to different inputs. It also explores sentential revision and demonstrates how local and global operations of revision by a sentence can be derived as a special case of descriptor revision. Lastly, the book examines revocation, a generalization of contraction in which a specified sentence is removed in a process that may possibly also involve the addition of some new information to the belief set. (shrink)

Reasoning is not just following logical rules, but a large part of human reasoning depends on our expectations about the world. To some extent, non-monotonic logic has been developed to account for the role of expectations. In this article, the focus is on expectations based on actions and their consequences. The analysis is based on a two-vector model of events where an event is represented in terms of two main components – the force of an action that drives the event, (...) and the result of its application. Actions are modelled in terms of the force domain and the results are modelled with the aid of different domains for locations or properties of objects. As a consequence, the assumption that reasoning about causal relations should be made in terms of propositional structures becomes very unnatural. Instead, the reasoning will be based on the geometric and topological properties of causes and effects modelled in conceptual spaces. (shrink)

This thesis studies the role of conceptual content in inference and reasoning. The first two chapters offer a theoretical and historical overview of the relation between inference and meaning in philosophy and psychology. In particular, a critical analysis of the formality thesis, i.e., the idea that rational inference is a rule-based and topic-neutral mechanism, is advanced. The origins of this idea in logic and its influence in philosophy and cognitive psychology are discussed. Chapter 3 consists of an analysis of the (...) relationship between inference and representation. It is argued that inference has to be studied from a pluralistic per- spective due to its dependence on different formats of representing information. The following four chapters apply conceptual spaces, a formal theory of concepts within cognitive semantics, to three concept-based inference-types. First, an explication of Sellars notion of material inference is advanced. Later, the model is extended to account for nonmonotonic inference by studying the role expectations in reasoning. Finally, a conceptual space-model of category-based induction is presented. This model predicts most of the empirical properties of this psychological phenomenon and subsumes some of the previous theories in psychology. It is stated that the explanatory fruitfulness of this new approach is evidence for the failure of the formality thesis and calls for a unified model of rational inference that puts semantics at center stage. The last chapter of the thesis discusses how inference and concepts interact in scientific reasoning, which makes constant use of hybrid symbolic structures for representing conceptual information. Stephen Toulmin’s notions of method of representation and inferential technique are developed and applied in a case study about the emergence of the notion of instantaneous speed during the passage from geometrical physics to analytical mechanics. It is claimed that this analysis provides support to the pluralistic perspective for theorizing about reasoning. (shrink)

This book aims to lay bare the logical foundations of tractable reasoning. It draws on Marvin Minsky's seminal work on frames, which has been highly influential in computer science and, to a lesser extent, in cognitive science. Only very few people have explored ideas about frames in logic, which is why the investigation in this book breaks new ground. The apparent intractability of dynamic, inferential reasoning is an unsolved problem in both cognitive science and logic-oriented artificial intelligence. By means of (...) a logical investigation of frames and frame concepts, Andreas devises a novel logic of tractable reasoning, called frame logic. Moreover, he devises a novel belief revision scheme, which is tractable for frame logic. These tractability results shed new light on our logical and cognitive means to carry out dynamic, inferential reasoning. Modularity remains central for tractability, and so the author sets forth a logical variant of the massive modularity hypothesis in cognitive science. (shrink)

We present an approach to combining three areas of research which we claim are all based on information theory: knowledge representation in Artificial Intelligence and Cognitive Science using prototypes, plans, or schemata; formal semantics in natural language, especially the semantics of the `if-then' conditional construct; and the logic of subjunctive conditionals first developed using a possible worlds semantics by Stalnaker and Lewis. The basic premise of the paper is that both schema-based inference and the semantics of conditionals are based on (...) Dretske's notion of information flow and Barwise and Perry's notion of a constraint in situation semantics. That is, the connection between antecedent and consequent of a conditional `if were the case then would be the case' is an informational relation holding with respect to a pragmatically determined utterance situation. The bridge between AI and conditional logic is that a prototype or planning schema represents a situation type, and the background assumptions underlying the application of a schema in a situation correspond to channel conditions on the flow of information. Adapting the work of Stalnaker and Lewis, the semantics of conditionals is modeled by a refinement ordering on situations: a conditional `if then ' holds with respect to a situation if all the minimal refinements of the situation that support also support . We present new logics of situations, information flow, and subjunctive conditionals based on three-valued partial logic that formalizes our approach, and conclude with a discussion of the resulting theory of conditionals, including the "paradoxes" of conditional implication, the difference between truth conditions and assertability conditions for subjunctive conditionals, and the relationship between subjunctive and indicative conditionals. (shrink)

The process [by which any individual settles into new opinions] is always the same. The individual has a stock of old opinions already, but he meets a new experience that puts them to a strain…. The result is an inward trouble to which his mind till then had been a stranger, and from which he seeks to escape by modifying his previous mass of opinions. He saves as much of it as he can, for in this matter of belief we (...) are all extreme conservatives. So he tries to change first this opinion, and then that (for they resist change very variously), until at last some new idea comes up which he can graft upon the ancient stock with a minimum of disturbance of the latter, some idea that mediates between the stock and the new experience and runs them into one most felicitously and expediently.The new idea is then adopted as the true one. It preserves the older stock of truths with a minimum of modification, stretching them just enough to make them admit the novelty, but conceiving that in ways as familiar as the case leaves possible. (William James, Lectures on Pragmatism, 1907). (shrink)

We show in this paper that the AGM postulates are too weak to ensure the rational preservation of conditional beliefs during belief revision, thus permitting improper responses to sequences of observations. We remedy this weakness by proposing four additional postulates, which are sound relative to a qualitative version of probabilistic conditioning. Contrary to the AGM framework, the proposed postulates characterize belief revision as a process which may depend on elements of an epistemic state that are not necessarily captured by a (...) belief set. We also show that a simple modification to the AGM framework can allow belief revision to be a function of epistemic states. We establish a model-based representation theorem which characterizes the proposed postulates and constrains, in turn, the way in which entrenchment orderings may be transformed under iterated belief revision. (shrink)

Information received from different sources can be inconsistent. Even when the sources of information can be ordered on the basis of their trustworthiness, it turns out that extracting an acceptable notion of support for information is a non-trivial matter, as is the question what information a rational agent should accept. Here it is shown how a support ordering on the information can be generated and how it can be used to decide what information to accept and what not to accept. (...) This ordering, it turns out, is closely related to notions such as Epistemic Entrenchment and Grove spheres studied in belief revision. (shrink)

A notion of an epistemic state is introduced as a generalization of common representations suggested for belief change. Based on it, a new kind of nonmonotonic inference relation corresponding to belief contractions is defined. A number of representation results is established that cover both traditional AGM contractions and contractions that do not satisfy recovery.

Theoria, Volume 88, Issue 3, Page 494-528, June 2022.

Modal accounts of normality in non-monotonic reasoning traditionally have an underlying semantics based on a notion of preference amongst worlds. In this paper, we motivate and investigate an alternative semantics, based on ordered accessibility relations in Kripke frames. The underlying intuition is that some world tuples may be seen as more normal, while others may be seen as more exceptional. We show that this delivers an elegant and intuitive semantic construction, which gives a new perspective on defeasible necessity. Technically, the (...) revisited logic does not change the expressive power of our previously defined preferential modalities. This conclusion follows from an analysis of both semantic constructions via a generalisation of bisimulations to the preferential case. Reasoners based on the previous semantics therefore also suffice for reasoning over the new semantics. We complete the picture by investigating different notions of defeasible conditionals in modal logic that can also be captured within our framework. (shrink)

We investigate the research programme of dynamic doxastic logic (DDL) and analyze its underlying methodology. The Ramsey test for conditionals is used to characterize the logical and philosophical differences between two paradigmatic systems, AGM and KGM, which we develop and compare axiomatically and semantically. The importance of Gärdenfors’s impossibility result on the Ramsey test is highlighted by a comparison with Arrow’s impossibility result on social choice. We end with an outlook on the prospects and the future of DDL.

The expressive power of logic is believed to be able to model most of the fundamental aspects of information retrieval. However, it is also understood that classical logic is ineffective for handling partiality and uncertainty in IR. Applying non-classical logics such as the AGM belief revision logic and the possibilistic logic to adaptive information retrieval is appealing since they provide a powerful and rigorous framework to model partiality and uncertainty inherent in any IR processes. The maxi-adjustment method, which is an (...) effective computational apparatus of the AGM paradigm, is applied to develop the learning components of the adaptive information agents. Essentially, maxi-adjustment allows the partial representation K of a user's information needs N to be refined gradually based on the user's relevance feedback t. Generally speaking, learning in adaptive information agents is characterised by the AGM belief revision Kt*. On the other hand, possibilistic logic supports a gradated assessment of the uncertainty arising from matching K with the imperfect characterisation d of an information object D. Information matching in adaptive information agents is underpinned by K ƕ d, where ƕ is the possibilistic inference relation. This paper illustrates how maxi-adjustment and possibilistic deduction can be applied to develop the adaptive information agents. Their impact on the agents learning autonomy and explanatory power is also discussed. (shrink)

We offer a probabilistic model of rational consequence relations (Lehmann and Magidor, 1990) by appealing to the extension of the classical Ramsey-Adams test proposed by Vann McGee in (McGee, 1994). Previous and influential models of nonmonotonic consequence relations have been produced in terms of the dynamics of expectations (Gärdenfors and Makinson, 1994; Gärdenfors, 1993).'Expectation' is a term of art in these models, which should not be confused with the notion of expected utility. The expectations of an agent are some form (...) of belief weaker than absolute certainty. Our model offers a modified and extended version of an account of qualitative belief in terms of conditional probability, first presented in (van Fraassen, 1995). We use this model to relate probabilistic and qualitative models of non-monotonic relations in terms of expectations. In doing so we propose a probabilistic model of the notion of expectation. We provide characterization results both for logically finite languages and for logically infinite, but countable, languages. The latter case shows the relevance of the axiom of countable additivity for our probability functions. We show that a rational logic defined over a logically infinite language can only be fully characterized in terms of finitely additive conditional probability. (shrink)

One of the main tools in the study of nonmonotonic consequence relations is the representation of such relations in terms of preferential models. In this paper we give an unified and simpler framework to obtain such representation theorems.

Systems of logico-probabilistic reasoning characterize inference from conditional assertions that express high conditional probabilities. In this paper we investigate four prominent LP systems, the systems _O, P_, _Z_, and _QC_. These systems differ in the number of inferences they licence _. LP systems that license more inferences enjoy the possible reward of deriving more true and informative conclusions, but with this possible reward comes the risk of drawing more false or uninformative conclusions. In the first part of the paper, we (...) present the four systems and extend each of them by theorems that allow one to compute almost-tight lower-probability-bounds for the conclusion of an inference, given lower-probability-bounds for its premises. In the second part of the paper, we investigate by means of computer simulations which of the four systems provides the best balance of reward versus risk. Our results suggest that system _Z_ offers the best balance. (shrink)

Richard Bradley has initiated a new debate, with Brian Hill and Jake Chandler as further participants, about the implications of a number of so-called triviality results surrounding the Ramsey test for conditionals. I comment on this debate and argue that ‘Inclusion’ and ‘Preservation’, which were originally introduced as postulates for the rational revision of factual beliefs, have little to recommend them in the first place when extended to languages containing conditionals. I question the philosophical method of postulation that was applied (...) in the new debate, and instead base my arguments on explicit representations of belief states and canonical constructions of belief state revisions. (shrink)

We introduce a simple generalization of Gardenfors and Makinson’s epistemic entrenchment called partial entrenchment. We show that preferential inference can be generated as the sceptical counterpart of an inference mechanism defined directly on partial entrenchment.

In their unifying theory to model uncertainty, Friedman and Halpern (1995–2003) applied plausibility measures to default reasoning satisfying certain sets of axioms. They proposed a distinctive condition for plausibility measures that characterizes “qualitative” reasoning (as contrasted with probabilistic reasoning). A similar and similarly fundamental, but more general and thus stronger condition was independently suggested in the context of “basic” entrenchment-based belief revision by Rott (1996–2003). The present paper analyzes the relation between the two approaches to formalizing basic notions of plausibility (...) as used in qualitative default reasoning. While neither approach is a special case of the other, translations can be found that elucidate their relationship. I argue that Rott’s notion of plausibility allows for a more modular set-up and has a better philosophical motivation than that of Friedman and Halpern. (shrink)

Alchourrón devoted his last years to the analysis of the notion of defeasible conditionalization. He developed a formal system capturing the essentials of this notion. His definition of the defeasible conditional is given in terms of strict implication operator and a modal operator f which is interpreted as a revision function at the language level. In this paper, we will point out that this underlying revision function is more general than the well known AGM revision [4]. In addition, we will (...) give a complete characterization of that more general kind of revision and will show how permits to unify models of revision given by other authors. Alchourrón dedicó sus últimos años al análisis de la noción de condicionalización derrotable. Desarrolló un sistema formal que captura los aspectos esenciales de esta noción. Su definición de condicional revisable está dada en términos del operador de implicación estricta y un operador modal f el cual es interpretado en el nivel del lenguaje como una función de revisión. En este trabajo señalamos que la función de revisión subyacente es más general que la bien conocida función de revisión de AGM. Además, presentaremos una caracterización completa de una clase de revisión más general y mostraremos cómo nuestro modelo permite unificar los modelos de revisión propuestos por otros autores. (shrink)

Alchourrón, Gärdenfors and Makinson have developed and investigated a set of rationality postulates which appear to capture much of what is required of any rational system of theory revision. This set of postulates describes a class of revision functions, however it does not provide a constructive way of defining such a function. There are two principal constructions of revision functions, namely an epistemic entrenchment and a system of spheres. We refer to their approach as the AGM paradigm. We provide a (...) new constructive modeling for a revision function based on a nice preorder on models, and furthermore we give explicit conditions under which a nice preorder on models, an epistemic entrenchment, and a system of spheres yield the same revision function. Moreover, we provide an identity which captures the relationship between revision functions and update operators (as defined by Katsuno and Mendelzon). (shrink)

The problem of how to remove information from an agent's stock of beliefs is of paramount concern in the belief change literature. An inquiring agent may remove beliefs for a variety of reasons: a belief may be called into doubt or the agent may simply wish to entertain other possibilities. In the prominent AGM framework for belief change, upon which the work here is based, one of the three central operations, contraction, addresses this concern (the other two deal with the (...) incorporation of new information). Makinson has generalised this work by introducing the notion of a withdrawal operation. Underlying the account proffered by AGM is the idea of rational belief change. A belief change operation should be guided by certain principles or integrity constraints in order to characterise change by a rational agent. One of the most noted principles within the context of AGM is the Principle of Informational Economy. However, adoption of this principle in its purest form has been rejected by AGM leading to a more relaxed interpretation. In this paper, we argue that this weakening of the Principle of Informational Economy suggests that it is only one of a number of principles which should be taken into account. Furthermore, this weakening points toward a Principle of Indifference. This motivates the introduction of a belief removal operation that we call severe withdrawal. We provide rationality postulates for severe withdrawal and explore its relationship with AGM contraction. Moreover, we furnish possible worlds and epistemic entrenchment semantics for severe withdrawals. (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)

Emotions imply a revision of our beliefs inasmuch as they are triggered by a discrepancy between our expectancies and new situations. I will study the converse relation: how emotions, particularly recurrent emotions that reappear in similar situations in the long term, are incentives to revise not only our beliefs but also the order of priorities between their related desires. Understanding how affects can revise both beliefs—under their committing aspect—and the order of desires, implies seeing the dynamics of affects as interacting (...) with external dynamics and the order of priorities as a weak one. These philosophical considerations shed new light on the diversity of emotions, on their different temporalities, and on the paradox of emotional sharing. (shrink)

The connections between nonmonotonic reasoning and belief revision are well-known. A central problem in the area of nonmonotonic reasoning is the problem of default entailment, i.e., when should an item of default information representing “if θ is true then, normally, φ is true” be said to follow from a given set of items of such information. Many answers to this question have been proposed but, surprisingly, virtually none have attempted any explicit connection to belief revision. The aim of this paper (...) is to give an example of how such a connection can be made by showing how the lexicographic closure of a set of defaults may be conceptualised as a process of iterated revision by sets of sentences. Specifically we use the revision method of Nayak. (shrink)