Computing Knowledge Base Updates.
Álvaro del Val · 1992
We present syntactic characterizations of propositional update operators based in the PMA approach [ Winslett, 1988a, Winslett, 1988b ] ), and develop algorithms for computing the updated database on the basis of this characterization. Unlike any other previous work in this area, the methods presented here do not require direct manipulation or explicit storage of complete models of the database. They also appear to be easily extensible to other update operators based in the idea of minimal change. 1 INTRODUCTION Much recent work has been devoted to giving accounts of belief revision based on the work of Alchourr 'on, Gardenfors and Makinson ( [ Alchourr'on et al., 1985 ] , [ Gardenfors, 1988 ] , [ Gardenfors and Makinson, 1988 ] ), who try to formalize the notion of a minimal belief change through a set of postulates that every revision operator should satisfy. [ Katsuno and Mendelzon, 1991 ] recently suggested that revision is not the only way in which new information can be incorpor...