Infobase change: A first approximation [Book Review]
David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jonathan Jenkins Ichikawa
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Logic, Language and Information 9 (3):353-377 (2000)
Generalisations of theory change involving operations on arbitrary sets ofwffs instead of on belief sets (i.e., sets closed under a consequencerelation), have become known as base change. In one view, a base should bethought of as providing more structure to its generated belief set, whichmeans that it can be employed to determine the theory contraction operationassociated with a base contraction operation. In this paper we follow suchan approach as the first step in defining infobase change. We think of an infobase as a finite set of wffs consisting of independently obtainedbits of information. Taking AGM theory change (Alchourrón et al. 1985) as the general framework, we present a method that uses the structure of aninfobase B to obtain an AGM theory contraction operation for contractingthe belief set Cn(B). Both the infobase and the obtained theory contraction operation then play a role in constructing a unique infobasecontraction operation. Infobase revision is defined in terms of an analogueof the Levi Identity, and it is shown that the associated theory revisionoperation satisfies the AGM postulates for revision. Because every infobaseis associated with a unique infobase contraction and revision operation, the method also allows for iterated base change.
|Keywords||base change base contraction base revision belief contraction belief revision iterated base change theory change|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Samir Chopra, Aditya Ghose & Thomas Meyer (2003). Non-Prioritized Ranked Belief Change. Journal of Philosophical Logic 32 (4):417-443.
Thomas Meyer (2001). On the Semantics of Combination Operations. Journal of Applied Non-Classical Logics 11 (1-2):59-84.
Similar books and articles
Richard Booth & Eva Richter (2005). On Revising Fuzzy Belief Bases. Studia Logica 80 (1):29 - 61.
Abhaya C. Nayak (1994). Foundational Belief Change. Journal of Philosophical Logic 23 (5):495 - 533.
Mark Jago (2006). Resource-Bounded Belief Revision and Contraction. In P. Torroni, U. Endriss, M. Baldoni & A. Omicini (eds.), Declarative Agent Languages and Technologies III. Springer 141--154.
Oliver Schulte (1999). Minimal Belief Change and the Pareto Principle. Synthese 118 (3):329-361.
Sven Ove Hansson (1993). Reversing the Levi Identity. Journal of Philosophical Logic 22 (6):637 - 669.
Sven Ove Hansson (2009). Replacement—a Sheffer Stroke for Belief Change. Journal of Philosophical Logic 38 (2):127 - 149.
Hans Rott & Maurice Pagnucco (1999). Severe Withdrawal (and Recovery). Journal of Philosophical Logic 28 (5):501-547.
Horacio Arló-Costa & Isaac Levi (2006). Contraction: On the Decision-Theoretical Origins of Minimal Change and Entrenchment. Synthese 152 (1):129 - 154.
Thomas Meyer (2001). Basic Infobase Change. Studia Logica 67 (2):215-242.
Added to index2009-01-28
Total downloads21 ( #188,894 of 1,934,581 )
Recent downloads (6 months)3 ( #195,826 of 1,934,581 )
How can I increase my downloads?