a:5:{s:8:"template";s:5073:" {{ keyword }}

";s:4:"text";s:10633:"/Producer >> Belief revision and default reasoning: Syntax-based approaches. /MediaBox [0.0 0.0 612.0 792.0] >> >> The idea is to develop a Diachronic Dutch Book, defending the idea that learning should proceed in accordance to conditioning on pain of incoherence. >> Here are some examples. This prompted research on how finite (and eventually incoherent) sets of beliefs change through inquiry. This name has been chosen because the coherentist approach aims at restoring the coherence endobj Logics for belief base updating. << Arlo-Costa has done extensive work on qualitative theories of supposition and learning. /Type /Catalog In particular, the orderings associated to a knowledge base $ K $ and its revised version $ K*P $ can be completely different. Immortal: A model-based belief revision system. The revision and update operators based on models are usually identified by the name of their authors: Winslett, Forbus, Satoh, Dalal, Hegner, and Weber. /ProcSet [/PDF /Text /ImageC /ImageB /ImageI] /Annots [34 0 R 35 0 R] This is the problem of establishing whether a formula follows from the result of a revision, that is, $ K*P \models Q $, where $ K $, $ P $, and $ Q $ are propositional formulae. endobj Postulates for both arbitration and merging have been proposed. /Type /Pages On the difference between updating a knowledge base and revising it. They differ on how these orderings are interpreted: preferences in social choice theory; plausibility in belief revision. The $ + $ operator denoted expansion: $ K+P $ is the deductive closure of $ K \cup \{P\} $. xڝX͎$'��)��̯T�C�DJn��-�ajz��U��~l��U]��ɌJ]��g`��[�_r��` $��5��r�6�X��Z�Y��9��w|ޮ(jI[�{ /Contents 56 0 R endobj << Revision of knowledge systems using epistemic entrenchment. >> Contracting this latter belief amounts to stop believing that George is European; therefore, that George has German citizenship is also retracted from the belief base. This inference relation is non-monotonic. This definition makes arbitration the exact opposite of majority. In, P. Liberatore (1997). This is called the principle of irrelevance of syntax. /Contents 66 0 R /Type /Page /Resources 47 0 R /MediaBox [0.0 0.0 612.0 792.0] In other words, revision may exponentially increase the size of the knowledge base. 22 0 obj /Parent 2 0 R /CropBox [0.0 0.0 612.0 792.0] Two kinds of preference ordering are usually considered: numerical and non-numerical. /Parent 2 0 R endobj How to give up: A survey of some formal aspects of the logic of theory change. As a result, if recovery is excluded from consideration, a number of contraction operators are translated into a single revision operator, which can be then translated back into exactly one contraction operator. << In the case of update, this principle formalizes the assumption of inertia. /Resources 41 0 R endobj /Parent 2 0 R According to this approach, retracting a non-derived piece of knowledge should lead to retracting all its consequences that are not otherwise supported (by other non-derived pieces of knowledge). endobj (1997) On the logic of iterated belief revision. >> /Type /Page /Type /Page >> In the setting in which all beliefs refer to the same situation, a distinction between various operations that can be performed is made: Revision and merging differ in that the first operation is done when the new belief to incorporate is considered more reliable than the old ones; therefore, consistency is maintained by removing some of the old beliefs. /Rotate 0 In the AGM framework, a belief set is represented by a deductively closed set of propositional formulae. /Resources 32 0 R << 12 0 obj https://doi.org/10.1016/S0165-4896(98)00007-9. << While single-step revision is about how a knowledge base $ K $ has to be changed into a new knowledge base $ K*P $, iterated revision is about how a preference ordering (representing both the current knowledge and how much situations believed to be false are considered possible) should be turned into a new preference relation when $ P $ is learned. In. /Rotate 0 Indeed, the preference relation should depend on the previous history of revisions, rather than on the resulting knowledge base only. More recent work focuses on (1) the interests and limitations of using of Non-Archimedean probability in order to represent hypothetical reasoning and learning, (2) computational and probabilistic models of abduction, (3) the role of supposing and learning in models of decision making and strategic interaction. >> /Parent 2 0 R << /Type /Page The belief-representing sentences form a language. As an example, the relative reliability of two sensors can /CropBox [0.0 0.0 612.0 792.0] /Type /Page endobj In other worlds, one can explicitly declare that a given fact is believed because of one or more other facts; such a dependency is called a justification. Nonmonotonic reasoning by minimal belief revision. /Rotate 0 More generally, one can consider the process of merging several pieces of information (rather than just two) that might or might not have the same reliability. The above is the original definition of arbitration. M. Freund and D. Lehmann (2002). Teddy Seidenfeld has written various papers arguing against the normative force of diachronic Dutch books. �~}m��1(�X��*1�TRhsK ��`��2�#�; ��k��T�|�B�&�߱KF]d��m��l�O�~��O/��_N.� U��m�X5�I��F �洯�L^�̄�qڊ�e�3�w�Ӥ�+c��+��*�[;|�V�^IT�)�y؝� ��@lm��R�` /MediaBox [0.0 0.0 612.0 792.0] [citation needed]. >> /Rotate 0 Transmutations of knowledge systems. << 33 0 obj A. Weber (1986). S. Konieczny and R. Pino Perez (1998). >> Belief revision and social choice theory are similar in that they combine a set of orderings into one. Many revision proposals involve orderings over models representing the relative plausibility of the possible alternatives. /CropBox [0.0 0.0 612.0 792.0] Belief revision. /Parent 2 0 R A merging operator can be expressed as a family of orderings over models, one for each possible multiset of knowledge bases to merge: the models of the result of merging a multiset of knowledge bases are the minimal models of the ordering associated to the multiset. Given that a preference ordering allows deriving its associated knowledge base but also allows performing a single step of revision, studies on iterated revision have been concentrated on how a preference ordering should be changed in response of a revision. The assumption implicit in the revision operator is that the new piece of information $ P $ is always to be considered more reliable than the old knowledge base $ K $. 2 0 obj /Contents 82 0 R What makes belief revision non-trivial is that several different ways for performing this operation may be possible. 14 0 obj endobj Outline /Parent 2 0 R no held beliefs are withdrawn); and that the agent does so by rationally choosing among a set of (abductively identified) potential answers to the queston. 14 0 R 15 0 R 16 0 R 17 0 R 18 0 R 19 0 R 20 0 R 21 0 R 22 0 R 23 0 R /Rotate 0 /CropBox [0.0 0.0 612.0 792.0] This work has been extensively applied, extended and revised, since the 1980's, in many areas of Artificial Intelligence. R. Fagin, J. D. Ullman, and M. Y. Vardi (1983). /Version /1.5 /Rotate 0 Indeed, two states of mind might represent the same piece of knowledge $ K $ while at the same time being different in the way a new piece of knowledge would be incorporated. Cognitive processes /Type /Page << The logical formalization of belief revision is researched in philosophy, in databases, and in artificial intelligence for the design of rational agents. 32 0 obj >> >> A common assumption in belief revision is that the reliability of the information sources is either given, derived from temporal information, or the same for all. /OpenAction [3 0 R /Fit] Belief revision in games: forward and backward induction. /Rotate 0 Arbitration (or how to merge knowledge bases). 18 0 obj /Resources 89 0 R In general, there may be several different ways for changing knowledge. However, if the language of formulae representing beliefs itself includes the counterfactual conditional connective $ > $, the Ramsey test leads to the Gardnefors triviality result: there is no non-trivial revision operator that satisfies both the AGM postulates for revision and the condition of the Ramsey test. This theory is based on a qualitative account of belief change compatible with central tenets of Bayesian methodology. The principle behind this approach is that a knowledge base is equivalent to a set of possible worlds, that is, to a set of scenarios that are considered possible according to that knowledge base. Non-numerical preference orderings correspond to the preference relations used in the AGM framework: a possibly total ordering over models. >> >> /Parent 2 0 R This is similar with what is done in social choice theory, which is the study of how the preferences of a group of agents can be combined in a rational way. /CropBox [0.0 0.0 612.0 792.0] In D. Dubois, D. Gabbay, H. Prade, and P. Smets, editors, H. Katsuno and A. O. Mendelzon (1991). %�� While such sets are infinite, they can always be finitely representable. The complexity for revision schemes is determined in the assumption that the extra information needed to compute revision is given in some compact form. This distinction is instead done by the foundational approach to belief revision, which is related to foundationalism in philosophy. In order to distinguish the foundational approach to belief revision to that based on deductively closed knowledge bases, the latter is called the coherentist approach. Another difference is that the alternatives are explicitly enumerated in social choice theory, while they are the propositional models over a given alphabet in belief revision. 11 0 obj If George is later discovered to have Austrian citizenship, then the fact that he is European is also reintroduced. C. Boutilier (1993). Here are some examples. Belief Revision. In the second case, $ a \wedge b $ is taken a single belief. /Type /Page /MediaBox [0.0 0.0 612.0 792.0] Jesus is often described as the Example… /MediaBox [0.0 0.0 612.0 792.0] Get PDF (434 KB) ... As an example, the relative reliability of two sensors can be assessed given some certain observation, and allows for subsequent mergings of data coming from them ";s:7:"keyword";s:24:"belief revision examples";s:5:"links";s:984:"North Korea Wins 98-0, Where Is The Most Bacteria Found In The Human Body?, Windermere, England, Apply Curtin University, How To Beat Four Kings, Schneider Compass, Cincinnati Reds Best Players 2020, Kubota Excavator Buckets Attachments, ";s:7:"expired";i:-1;}