Efficient Epistemic Updates in Rank-Based Belief Networks

Total Page:16

File Type:pdf, Size:1020Kb

Efficient Epistemic Updates in Rank-Based Belief Networks Efficient Epistemic Updates in Rank-Based Belief Networks Dissertation zur Erlangung des akademischen Grades eines Doktors der Philosophie (Dr. phil.) an der Geisteswissenschaftliche Sektion Fachbereich Philosophie vorgelegt von Stefan Alexander Hohenadel Tag der mündlichen Prüfung: 4. September 2012 1. Referent: Prof. Dr. Wolfgang Spohn 2. Referent: PD Dr. Sven Kosub Konstanzer Online-Publikations-System (KOPS) URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-250406 Efficient Epistemic Updates in Rank-Based Belief Networks Stefan Alexander Hohenadel November 9, 2013 A Dissertation Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor in Philosophy. Department of Philosophy Faculty of Humanities University of Konstanz This document was compiled on November 9, 2013 from revision 341 without changes. Abstract – The thesis provides an approach for an efficient update algorithm of rank-based belief networks. The update is performed on two input values: the current doxastic state, rep- resented by the network, and, second, a doxastic evidence that is represented as a change on a subset of the variables in the network. From these inputs, a Lauritzen-Spiegelhalter-styled up- date strategy can compute the updated posterior doxastic state of the network. The posterior state reflects the combination of the evidence and the prior state. This strategy is well-known for Bayesian networks. The thesis transfers the strategy to those networks whose semantics is specified by epistemic ranking functions instead of probability measures. As a foundation, the construction of rank-based belief networks is discussed, which are graphical models for rank- ing functions. It is shown that global, local and pairwise Markov properties are equivalent in rank-based belief networks and, furthermore, that the Hammersley-Clifford-Theorem holds for such ranking networks. This means that from the equivalence of the Markov properties it follows that a potential representation of the actual ranking function can be derived from the network structure. It is shown how by this property the update strategy of the Lauritzen- Spiegelhalter-algorithm can be transferred to ranking networks. For this purpose, the solution of the two main problems is demonstrated: first, the triangulation of the moralized input network and the decompositon of this triangulation to a clique tree. Then, second, message passing can be performed on this clique tree to incorporate the evidence into the clique tree. The entire approach is in fact a technical description of belief revision. Zusammenfassung – Diese Dissertation stellt einen Ansatz für die effiziente Aktualisierung von Rangfunktion-basierten doxastischen Netzwerken vor. Die Aktualisierung eines doxasti- schen Netzwerks erfolgt auf der Basis von zwei Eingaben: dem aktuellen doxastischen Zu- stand, repräsentiert durch das Netzwerk, sowie einer doxastischen Evidenz, die als Änderung von Aktualwerten einer Untermenge von Variablen des Netzwerks formalisiert wird. Aus diesen Eingaben kann mithilfe der Strategie des Algorithmus von Lauritzen & Spiegelhalter der aktualisierte Folgezustand des Netzwerks berechnet werden, in welchem die Evidenz re- flektiert ist. Dieses Vorgehen ist für Bayessche Netze bereits seit langem bekannt und wird hier auf Netze angewandt, deren Semantik statt durch Wahrscheinlichkeitsmaße durch Rang- funktionen spezifiziert ist. Als Grundlegung wird auch die Bildung grafischer Modelle für Rangfunktionen, also Rangfunktion-basierter doxastischer Netzwerke ausführlich diskutiert. Unter anderem wird dabei gezeigt, dass globale, lokale und paarweise Markov-Eigenschaften in Rangfunktion-basierten Netzwerken äquivalent sind und dass weiterhin für solche Rang- netzwerke das Hammersley-Clifford-Theorem gilt. Dies bedeutet, dass aus der Äquivalenz der genannten Markov-Eigenschaften folgt, dass stets eine cliquen-basierte Potentialdarstel- lung der jeweiligen Rangfunktion aus der Netzwerkstruktur abgeleitet werden kann. Es wird gezeigt, wie durch diese Eigenschaft die Aktualisierungsstrategie des Lauritzen-Spiegelhalter- Algorithmus auf Rangfunktion-basierte Netzwerke übertragen werden kann. Hierzu wird die Lösung der beiden Hauptaufgaben gezeigt: Zunächst ist die Triangulierung des moralisierten Netzwerks sowie die Dekomposition des triangulierten Netzwerks zu einem Cliquenbaum auszuführen, danach kann auf dem so gewonnenen Cliquenbaum message passing ausgeführt werden, um die doxastische Evidenz in den Cliquenbaum zu inkorporieren. Dies entspricht einer technischen Darstellung des Revisionsvorgangs von Überzeugungszuständen. 5 6 Contents Preface .............................. 9 IB elief,Belief States, and Belief Change ............... 15 1.1 Introduction · 15 – 1.1.1 Remark on Sources and Citation · 16 – 1.2 A Normative Per- spective on Epistemology · 16 – 1.2.1 Descriptive and Normative Perspective · 16 – 1.2.2 The Philosopher and the Engineer · 17 – 1.2.3 Belief Revision and the Problem of Induction · 23 – 1.3 Elements of a Belief Theory · 26 – 1.4 Propositions as Epistemic Units · 28 – 1.4.1 The Concept of Proposition · 28 – 1.4.2 Propositions Form Algebras · 29 – 1.4.3 Atoms and Atomic Algebras · 32 – 1.4.4 Beliefs, Contents, and Concepts · 33 – 1.5 Epistemic States and Rationality · 37 – 1.5.1 Rationality Postulates · 37 – 1.5.2 Rational Belief Sets · 40 – 1.5.3 Belief Cores · 41 – 1.6 Transitions Between Epistemic States · 42 – 1.6.1 Descrip- tion of Epistemic Updates · 42 – 1.6.2 Transition by Consistent Evidence · 43 – 1.6.3 The Inconsistent Case · 44 – 1.6.4 The Transition Function · 45 IIR anking Functions and Rank-based Conditional Independence ...... 47 2.1 Introduction · 47 – 2.2 Ranking Functions · 48 – 2.2.1 Ranking Functions on Pos- sibilities · 48 – 2.2.2 Negative Ranking Functions · 49 – 2.2.3 Minimitivity, Completeness, and Naturalness · 52 – 2.2.4 Two-sided Ranking Functions · 56 – 2.2.5 Conditional Nega- tive Ranks · 57 – 2.2.6 Conditional Two-sided Ranks · 62 – 2.2.7 A Digression on Positive Ranking Functions · 65 – 2.3 Conditionalization and Revision of Ranking Functions · 68 – 2.3.1 Plain Conditionalization · 68 – 2.3.2 Spohn-conditionalization · 70 – 2.3.3 Shenoy- conditionalization · 73 – 2.4 Rank-based Conditional Independence · 74 IIIG raphical Models for Ranking Functions .............. 81 3.1 Introduction · 81 – 3.1.1 Content of this Chapter · 81 – 3.1.2 Historical Remarks · 82 – 3.1.3 Measurability and Variables · 87 – 3.1.4 Algebras Over Variable Sets · 90 – 3.1.5 Graph- theoretic Preliminaries · 91 – 3.2 Graphoids and Conditional Independence Among Vari- ables · 100 – 3.2.1 Conditional Independence Among Variables · 100 – 3.2.2 RCI is a Gra- phoid · 101 – 3.2.3 Agenda · 103 – 3.3 Ranking Functions and Their Markov Graphs · 104 – 3.3.1 D-Maps, I-Maps, and Markov Properties · 104 – 3.3.2 Markov Blankets and Markov Boundaries · 106 – 3.4 Ranking Functions and Given Markov Graphs · 109 – 3.4.1 Po- tential Representation of Negative Ranking Functions · 109 – 3.4.2 Representations of Negative Ranking Functions by Markov Graphs · 111 – 3.5 RCI and Undirected Graphs · 118 – 3.6 Ranking Networks · 119 – 3.6.1 DAGs as Graphical Models · 119 – 3.6.2 Strict Linear 7 Contents Orderings on Variables · 121 – 3.6.3 Separation in Directed Graphs · 122 – 3.6.4 Directed Markov Properties · 123 – 3.6.5 Factorization in Directed Graphs · 128 – 3.6.6 Potential Representation of Ranking Networks · 130 – 3.7 Perfect Maps of Ranking Functions · 131 – 3.7.1 Ranking Functions and DAGs · 131 – 3.7.2 Characterization of CLs that have Perfect Maps · 133 – 3.7.3 Outlook: Can CLs Be Made DAG-isomorphic? · 136 IVB elief Propagation in Ranking Networks............... 137 4.1 Introduction · 137 – 4.2 Hunter’s Algorithm for Polytrees · 140 – 4.3 The LS- Strategy on Ranking Networks: An Outline · 142 – 4.4 Phase 1 – Triangulation and De- composition of the Network · 146 – 4.4.1 Methods for Obtaining the Clique Tree from the Initial Network · 146 – 4.4.2 Triangulating Graphs: A Brief Survey · 149 – 4.4.3 Desired Criteria for Triangulations of Graphs · 153 – 4.4.4 Generating the Elimination Ordering · 155 – 4.4.5 The MCS-M Algorithm · 158 – 4.4.6 Determining the Set of Cliques of the Fill-In-Graph · 159 – 4.4.7 Inline Recognition of Cliques · 161 – 4.4.8 Inline Tree Construction · 166 – 4.4.9 An Algorithm for Decomposing a Moralized Ranking Network · 171 – 4.4.10 A Digression on Triangulatedness and the Epistemic Domain · 174 – 4.5 Phase 2 – Message Passing on the Clique Tree · 176 – 4.5.1 Local Computation on Cliques · 176 – 4.5.2 Locally Available In- formation · 182 – 4.5.3 Pre-Initializing the Permanent Belief Base · 183 – 4.5.4 Bottom-Up Propagation: Conditional Ranks of the Cliques · 184 – 4.5.5 Top-Down Propagation: Joint Ranks of the Separators · 186 – 4.5.6 Processing Update Information · 188 – 4.5.7 Queries on the Clique Tree · 188 – 4.6 Conclusion · 189 – 4.6.1 Achievements · 189 – 4.6.2 Remarks on Aspects Not Discussed · 191 – 4.7 Outlook: Learning Ranking Networks and Induction to the Unknown · 191 AAC omputed Example for Decomposition ............... 193 BAC omputed Example for Updating ................. 199 2.1 The Ranking Network · 199 – 2.2 Initialization Phase · 200 – 2.2.1 Going Bottom-Up: Computing the Conditional Ranks · 203 – 2.2.2 Going Top-Down: Joint Ranks of the Cliques · 205 – 2.3 Update By New Evidence · 206 Acknowledgements ......................... 209 Index of Definitions ......................... 211 Index of Symbols .......................... 215 Index of Algorithms ........................
Recommended publications
  • Two Coherence Principles Author(S): Wolfgang Spohn Source: Erkenntnis (1975-), Vol
    Two Coherence Principles Author(s): Wolfgang Spohn Source: Erkenntnis (1975-), Vol. 50, No. 2/3, Coherence and Dynamics of Belief (1999), pp. 155-175 Published by: Springer Stable URL: http://www.jstor.org/stable/20012913 Accessed: 04/11/2010 09:34 Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at http://www.jstor.org/action/showPublisher?publisherCode=springer. Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Springer is collaborating with JSTOR to digitize, preserve and extend access to Erkenntnis (1975-). http://www.jstor.org WOLFGANG SPOHN TWO COHERENCE PRINCIPLES 1. INTRODUCTION The purpose of this paper is twofold. On the one hand, it is a self-contained continuation of Spohn (1991).
    [Show full text]
  • Vienna Circle Institute Library
    Vienna Circle Institute Library Volume 4 Series editor Friedrich Stadler University of Vienna, Institute Vienna Circle, Wien, Austria Institut Wiener Kreis Society for the Advancement of the Scientifi c World Conception Advisory Editorial Board: Ilkka Niiniluoto, University of Helsinki, Finland Jacques Bouveresse, Collège de France, Paris, Otto Pfersmann, Université Paris I Panthéon – France Sorbonne, France Martin Carrier, University of Bielefeld, Germany Miklós Rédei, London School of Economics, UK Nancy Cartwright, London School of Alan Richardson, University of British Economics, UK Columbia, CDN Richard Creath, Arizona State University, USA Gerhard Schurz, University of Düsseldorf, Massimo Ferrari, University of Torino, Italy Germany Michael Friedman, Stanford University, USA Peter Schuster, University of Vienna, Austria Maria Carla Galavotti, University of Bologna, Karl Sigmund, University of Vienna, Austria Italy Hans Sluga, University of California at Berkeley, Peter Galison, Harvard University, USA USA Malachi Hacohen, Duke University, USA Elliott Sober, University of Wisconsin, USA Rainer Hegselmann, University of Bayreuth, Antonia Soulez, Université de Paris 8, France Germany Wolfgang Spohn, University of Konstanz, Michael Heidelberger, University of Tübingen, Germany Germany Thomas E. Uebel, University of Manchester, UK Don Howard, University of Notre Dame, USA Pierre Wagner, Université de Paris 1, Sorbonne, Paul Hoyningen-Huene, University of Hanover, France Germany C. Kenneth Waters, University of Minnesota, USA Clemens Jabloner,
    [Show full text]
  • 8897690 Lprob 1.Pdf
    CAMBRIDGE AND VIENNA FRANK P. RAMSEY AND THE VIENNA CIRCLE VIENNA CIRCLE INSTITUTE YEARBOOK [2004] 12 VIENNA CIRCLE INSTITUTE YEARBOOK [2004] 12 Institut ‘Wiener Kreis’ Society for the Advancement of the Scientific World Conception Series-Editor: Friedrich Stadler Director, Institut ‘Wiener Kreis’ and University of Vienna, Austria Advisory Editorial Board: Honorary Consulting Editors: Rudolf Haller, University of Graz, Austria, Coordinator Kurt E. Baier Nancy Cartwright, London School of Economics, UK Francesco Barone Robert S. Cohen, Boston University, USA C.G. Hempel † Wilhelm K. Essler, University of Frankfurt/M., Germany Stephan Kö rner † Kurt Rudolf Fischer, University of Vienna, Austria Henk Mulder † Michael Friedman, University of Indiana, Bloomington, USA Arne Naess Peter Galison, Harvard University, USA Paul Neurath † Adolf Grünbaum, University of Pittsburgh, USA Willard Van Orman Quine † Rainer Hegselmann, University of Bayreuth, Germany Marx W. Wartofsky † Michael Heidelberger, University of Tübingen, Germany Jaakko Hintikka, Boston University, USA Review Editor: Gerald Holton, Harvard University, USA Michael Stöltzner Don Howard, University of Notre Dame, USA Allan S. Janik, University of Innsbruck, Austria Editorial Work/Layout/Production: Richard Jeffrey, Princeton University, USA Hartwig Jobst Andreas Kamlah, University of Osnabrück, Germany Camilla R. Nielsen Eckehart Köhler, University of Vienna, Austria Erich Papp Anne J. Kox, University of Amsterdam, The Netherlands Saul A. Kripke, Princeton University, USA Editorial
    [Show full text]
  • RANKING THEORY Franz Huber in Epistemology Ranking Theory Is A
    RANKINGTHEORY Franz Huber 8 In epistemology ranking theory is a theory of belief and its revision. It studies how an ideal doxastic agent should organize her beliefs and conditional beliefs at a given moment in time, and how she should revise her beliefs and conditional beliefs across time when she receives new information. In this entry I will first present some background, most notably the AGM theory of belief revision (Alchourrón, Gärdenfors, & Makinson, 1985). In order to motivate the introduction of ranking theory I will then focus on the problem of iterated belief revisions. After presenting the elements of ranking theory (Spohn, 1988, 2012) I will show how this theory solves the problem of iterated belief revisions. I will conclude by sketching two areas of future research and by mentioning applications of ranking theory outside epistemology. Along the way we will see how ranking theory, a theory of belief, compares to subjective probability theory or Bayesianism, which is a theory of partial beliefs or degrees of belief. 1 introduction Sophia believes many things, among others that it will rain on Tuesday, that it will be sunny on Wednesday, and that weather forecasts are always right. Belief revision theory tells Sophia how to revise her beliefs when she learns that the weather forecast for Tuesday and Wednesday predicts rain. As we will see, this depends on the details of her beliefs, but under one way of filling in the details she should keep her belief that it will rain on Tuesday and give up her belief that it will be sunny on Wednesday.
    [Show full text]
  • Laws: a Ranking Theoretic Account
    LAWS: A RANKING THEORETIC ACCOUNT Wolfgang Spohn Department of Philosophy University of Konstanz Preliminary Remarks This is my reading material for the 5th annual formal epistemology workshop at UW Madison, May 14-18, 2008. I shall try to condense the essentials of this material into a 45 minutes talk. Here, however, I would like to present my full material that mainly consists of chapter 12 of my book on ranking theory that I am about to write. The chapter is not self-contained and requires at least an introduc- tion into ranking theory. For this reason I have prefixed such an introduction that I have taken from another paper of mine. All in all, that makes for a somewhat un- even reading, but the text should be complete as far as it goes. It also makes for an uneven numbering, which I have only slightly adapted. So, please keep in mind that this is a mixture of two texts, each with its own introduction. You may skip section 12.6, and you need not read all the details and proofs of section 12.5. Content: 1. An Introduction to Ranking Theory 2 1.1 Introduction 2 1.2 Basics 5 1.3 Reasons and Their Balance 14 1.4 The Dynamics of Belief and the Measurement of Belief 17 12. Laws and Their Confirmation 25 12.1 A Plan for the Next Chapters 25 12.2 The Problem of Lawlikeness 27 12.3 Laws, Symmetry, and Instantial Relevance 34 12.4 Laws and Persistence 41 12.5 The Confirmation of Laws 49 12.6 A Priori Lawfulness? 63 References 67 2 1.
    [Show full text]
  • Conditionals: a Unifying Ranking-Theoretic Perspective
    Philosophers’ volume 15, no. 1 1. Introduction1 Imprint january 2015 The topic of conditionals is an extremely important one. It lies at the bottom of so many philosophical issues (causation, dispositions, lawlikeness, etc.), and current theories of conditionals seem to fairly ground these issues. On the other hand, the topic has become ever messier. Philosophical opinions grossly diverge, not only about de- tails, but also about such fundamental questions as to whether or not Conditionals: conditionals have truth-values. And the linguistic phenomenology is so rich, the interaction with tense, mood, negation, quantifiers, etc., so complicated, and the pragmatics so imperspicuous that plausible examples can be found for and against nearly every claim or account. A Unifying Ranking- The situation seems quite desperate. One might say that the situation is inevitable; there is no reduc- tion of complex reality to simple theories. However, I am convinced that the present confusion is also brought about by the fact that the Theoretic Perspective discussions of the last 45 years have focused on suboptimal paradigms, propositional logic, probability theory, objective similarity spheres, or subjective entrenchment orderings: all of them are not optimally suit- ed for laying foundations to any kind of conditionals. This conviction grounds in my further conviction that the philo- sophical applications of conditional logic are better dealt with by rank- ing theory, as I have extensively displayed in Spohn (2012, ch. 12–15). If this should really be so, the deeper reason can only be that rank- ing theory is better suited for treating conditionals themselves. In this Wolfgang Spohn paper, I cannot give a full comparative argument, but my ambition is University of Konstanz at least to display that ranking theory is well suited for a comprehen- sive and unified account of conditionals.
    [Show full text]
  • Volume 7, Number 7 July 2013
    Volume 7, Number 7 July 2013 www.thereasoner.org ISSN 1757-0522 overcome problems he found with Peter Gardenfors’¨ account Contents of the dynamics of belief. He introduced ranking functions as so-called ordinal conditional functions to the scientific commu- Editorial 79 nity in 1988. Since then, Spohn’s philosophizing was strongly influenced by the work on ranking theory. Features 80 Though ranking theory is a theory of rational belief change, its basic notion is that of a degree of dis- News 83 belief. The rank of a proposition is a non-negative integer that indicates how What’s Hot in . 85 strongly an agent disbelieves this proposition. For this reason Events 87 ranks are sometimes called Courses and Programmes 89 negative ranks. These degrees of disbelief trivially determine Jobs and Studentships 90 the extent to which a proposition is believed: if a proposition is disbelieved to some degree, its negation is believed to that Editorial degree. If an agent neither disbelieves a proposition nor its Wolfgang Spohn is no stranger to the readers negation, she is indifferent. of The Reasoner. Four years ago Matteo Mor- While preparing our interview ganti interviewed him on his work and his views with Wolfgang Spohn we discussed how influential ranking on the state of the philosophy theory is today. It seemed to us that while the existence of rank- of science. At that time, Spohn ing theory is well known, its content is rarely studied. To many mentioned a book on ranking it may seem that subjective probability theory is all the theory theory he was working on.
    [Show full text]
  • Causation: an Alternative
    CAUSATION: AN ALTERNATIVE Wolfgang Spohn Abstract: The paper builds on the basically Humean general idea that A is a cause of B iff A and B both occur, A precedes B, and A raises the metaphysical or epis- temic status of B given the obtaining circumstances. It argues that in pursuit of a theory of deterministic causation this ‘status raising’ is best explicated not in regu- larity or counterfactual terms, but in terms of ranking functions. On this basis, it constructs a rigorous theory of deterministic causation that successfully deals with cases of overdetermination and preemption. It finally indicates how the account’s profound epistemic relativization induced by ranking theory can be undone. 1. Introduction 2. Variables, Propositions, Time 3. Induction first 4. Causation 5. Redundant Causation 6. Objectivization 1. Introduction Counterfactual analyses of causation have run through many epicycles.1 It is time to look at a genuine alternative, which is in principle available since 20 years.2 The logic of counterfactuals, as fully developed in Lewis [1973a], was an indis- pensible means for such counterfactual analyses. This is why they developed into a constructive research programme only with Lewis [1973b]. It has been carried on throughout the years. But it seems it has received greatest attention just recently.3 1 The major cycles have been produced by David Lewis himself. See Lewis ([1973b], [1986], [2000]. Hints to further cycles may be found there. 2 It is first presented in my [1983]. 3 See, e.g., the April issue of the Journal of Philosophy 97 (2000), or the collection by Collins et al.
    [Show full text]
  • If Oswald Had Not Killed Kennedy«: Spohn on Counterfactuals
    Penultimate version, March 2016; final version appeared in Von Rang und Namen Philosophical Essays in Honour of Wolfgang Spohn, eds. W. Freitag, H. Rott, H. Sturm and A. Zinke, Münster: Mentis 2016, pp. 379399. »If Oswald had not killed Kennedy«: Spohn on counterfactuals Hans Rott Abstract Wolfgang Spohn’s theory of ranking functions is an elegant and powerful theory of the structure and dynamics of doxastic states. In two recent papers, Spohn has applied it to the analysis of conditionals, claiming to have presented a uni- fied account of indicative and subjunctive (counterfactual) conditionals. I argue that his analysis fails to account for counterfactuals that refer to indirect causes. The strategy of taking the transitive closure that Spohn employs in the theory of causation is not available for counterfactuals. I have a close look at Spohn’s treatment of the famous Oswald-Kennedy case in order to illustrate my points. I sketch an alternative view that seems to avoid the problems. Keywords: Conditionals, counterfactuals, indicative conditionals, subjunctive conditionals, ranking theory, Spohn 1. Introduction It must have been around 1981 when I heard Wolfgang Spohn give a seminar talk on the dialectics between spurious and hidden causes at LMU Munich. I still remember vividly that it was one of the two magic moments of my student times. (The other one was Ulrich Blau’s talk on the hangman and the liar paradoxes. Both papers were pub- lished in a voluminous Erkenntnis special issue that was at the same time a Festschrift devoted to Wolfgang Stegmüller’s 60th birthday). This kind of philosophy was exactly what I wanted to do! In the acedemic year 1981/82 I attended Wolfgang’s class Der Kausalitätsbegriff aus analytischer Sicht in which he started developing his own the- ory of causation.
    [Show full text]
  • Christian Damböck Editor In Uences on the Aufbau Vienna Circle Institute Yearbook
    Vienna Circle Institute Yearbook Christian Damböck Editor In uences on the Aufbau Vienna Circle Institute Yearbook Institut ‘Wiener Kreis’ Society for the Advancement of the Scientifi c World Conception Volume 18 Series Editor Friedrich Stadler , Univ. of Vienna & Inst. Vienna Circle , Wien , Austria Advisory Editorial Board Jacques Bouveresse, Collège de France, Paris, France Martin Carrier, University of Bielefeld, Germany Nancy Cartwright, London School of Economics, UK Richard Creath, Arizona State University, USA Massimo Ferrari, University of Torino, Italy Michael Friedman, Stanford University, USA Maria Carla Galavotti, University of Bologna, Italy Peter Galison, Harvard University, USA Malachi Hacohen, Duke University, USA Rainer Hegselmann, University of Bayreuth, Germany Michael Heidelberger, University of Tübingen, Germany Don Howard, University of Notre Dame, USA Paul Hoyningen-Huene, University of Hanover, Germany Clemens Jabloner, Hans-Kelsen-Institut, Vienna, Austria Anne J. Kox, University of Amsterdam, The Netherlands Martin Kusch, University of Vienna, Austria James G. Lennox, University of Pittsburgh, USA Juha Manninen, Helsinki Collegium for Advanced Studies, Finland Thomas Mormann, University of Donostia/San Sebastián, Spain Edgar Morscher, University of Salzburg, Austria Kevin Mulligan, Université de Genève, Switzerland Elisabeth Nemeth, University of Vienna, Austria Julian Nida-Rümelin, University of Munich, Germany Ilkka Niiniluoto, University of Helsinki, Finland Otto Pfersmann, Université Paris I Panthéon – Sorbonne, France Miklós Rédei, London School of Economics, UK Alan Richardson, University of British Columbia, CDN Gerhard Schurz, University of Düsseldorf, Germany Peter Schuster, University of Vienna, Austria Karl Sigmund, University of Vienna, Austria Hans Sluga, University of California at Berkeley, USA Elliott Sober, University of Wisconsin, USA Antonia Soulez, Université de Paris 8, France Wolfgang Spohn, University of Konstanz, Germany Thomas E.
    [Show full text]
  • Volume 7, Number 7 July 2013
    Volume 7, Number 7 July 2013 www.thereasoner.org ISSN 1757-0522 Contents Editorial Features News What’s Hot in . Events Courses and Programmes Jobs and Studentships Editorial Wolfgang Spohn is no stranger to the readers of The Reasoner. Four years ago Matteo Morganti interviewed him on his work and his views on the state of the philosophy of science. At that time, Spohn mentioned a book on ranking theory he was working on. With this book, ranking theory was supposed to be “reaching adult- hood”. Last year, The Laws of Belief: Ranking Theory and Its Philosophical Applications was finally published at OUP. It was distinguished by the Lakatos Award 2012. This is good reason to take a closer look at ranking theory. Spohn developed ranking theory in the early 80’s in order to overcome problems he found with Peter Gardenfors’¨ account of the dynamics of belief. He introduced ranking functions as so-called ordinal conditional functions to the scientific community in 1988. Since then, Spohn’s philosophizing was strongly influenced by the work on ranking theory. Though ranking theory is a theory of rational belief change, its basic notion is that of a degree of disbelief. The rank of a proposition is a non-negative integer that indicates how strongly an agent disbelieves this proposition. For this reason ranks are sometimes called neg- ative ranks. These degrees of disbelief trivially determine the extent to which a proposition is believed: if a proposition is dis- believed to some degree, its negation is believed to that degree. If an agent neither disbelieves a proposition nor its negation, she is indifferent.
    [Show full text]
  • Review of Wolfgang Spohn the Laws of Belief: Ranking Theory and Its Philosophical Implications (Oxford University Press, 2012)
    Review of Wolfgang Spohn The Laws of Belief: Ranking Theory and its Philosophical Implications (Oxford University Press, 2012) Jake Chandler Weighing in at close to 600 pages of densely written material and packed with theorems and definitions, Wolfgang Spohn’s Lakatos Award winning opus magnum is an impressive volume, offering a comprehensive overview of the systematic and highly distinctive body of work that he has been developing over the past 30 years. The central aim of The Laws of Belief is to outline a formal theory of rational opinion change that is capable of delivering insights into questions that have been of traditional interest to epistemologists and philosophers of science. This, of course, is a theoretical role that many would take to already be comfortably occupied by the popular Bayesian model of degrees of confidence, aka ‘degrees of belief’. But Spohn disagrees. His view is that, since many traditional debates in epistemology and the philosophy of science have been framed in terms of the notion of belief, rather than of degree of confidence, Bayesianism is at least prima facie ill-suited to the task at hand. Furthermore, he argues, the prospects of expanding the Bayesian model so as to accommodate the notion of plain belief are rather poor: best simply start from scratch with a theory of belief dynamics. Accordingly, Spohn’s point of departure is an axiomatic theory of belief change. More specifically, it is a theory of iterated belief contraction: a theory of how one ought to adjust one’s overall set of beliefs in response to a succession of retractions of one or more of its members.
    [Show full text]