Basic infobase change

7Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Generalisations of theory change involving arbitrary sets of wffs instead of belief sets have become known as base change. In one view, a base should be thought of as providing more structure to its generated belief set, and can be used to determine the theory change operation associated with a base change operation. In this paper we extend a proposal along these lines by Meyer et al. [12]. We take an infobase as a finite sequence of wffs, with each element in the sequence being seen as an independently obtained bit of information, and define appropriate infobase change operations. The associated theory change operations satisfy the AGM postulates for theory change [1]. Since an infobase change operation produces a new infobase, it allows for iterated infobase change. We measure iterated infobase change against the postulates proposed by Darwiche et al. [2,3] and Lehmann [10].

Cite

CITATION STYLE

APA

Meyer, T. (1999). Basic infobase change. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1747, pp. 156–167). Springer Verlag. https://doi.org/10.1007/3-540-46695-9_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free