An account of how a rational agent should revise beliefs in the light of new evidence. This theory is set apart from previous belief revision theories by being computationally implementable, provides rigorous mathematical theory of dependency networks and formulates and investigates the complexity of algorithms for rational agents revising beliefs.
An account of how a rational agent should revise beliefs in the light of new evidence. This theory is set apart from previous belief revision theories by being computationally implementable, provides rigorous mathematical theory of dependency networks and formulates and investigates the complexity of algorithms for rational agents revising beliefs.
Neil Tennant holds a BA in Mathematics and Philosophy, and a PhD in logic, from the University of Cambridge. His researches in Logic and Philosophy of Science have been supported by the British Academy, the Alexander von Humboldt Foundation, the Australian Research Council, and the National Endowment for the Humanities. He has held chairs in Philosophy at the University of Stirling and the Australian National University, and visiting professorships or fellowships at Dartmouth College, the University of Michigan, the Pittsburgh Center for Philosophy of Science, The ANU Institute for Advanced Studies, and Churchill College, Cambridge. He is currently Arts & Humanities Distinguished Professor in Philosophy at The Ohio State University.
Inhaltsangabe
1: Introduction Part I: Computational Considerations 2: Computing Changes in Belief 3: Global Conditions on Contraction 4: A Formal Theory of Contraction 5: Specification of a Contraction Algorithm 6: A Prolog Program for Contraction 7: Results of Running our Program for Contraction Part II: Logical and Philosophical Considerations 8: Core Logic is the Inviolable Core of Logic 9: The Finitary Predicament 10: Mathematical Justifications are Not Infinitely Various Part III: Comparisons 11: Differences with Other Formal Theories 12: Connections with Various Epistemological Accounts
1: Introduction Part I: Computational Considerations 2: Computing Changes in Belief 3: Global Conditions on Contraction 4: A Formal Theory of Contraction 5: Specification of a Contraction Algorithm 6: A Prolog Program for Contraction 7: Results of Running our Program for Contraction Part II: Logical and Philosophical Considerations 8: Core Logic is the Inviolable Core of Logic 9: The Finitary Predicament 10: Mathematical Justifications are Not Infinitely Various Part III: Comparisons 11: Differences with Other Formal Theories 12: Connections with Various Epistemological Accounts
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Shop der buecher.de GmbH & Co. KG Bürgermeister-Wegele-Str. 12, 86167 Augsburg Amtsgericht Augsburg HRA 13309
