When a belief set is contracted only some beliefs are eligible for removal. By introducing eligibility for removal as a new semantic primitive for contraction and combining it with epistemic entrenchment we get a contraction operator with a number of interesting properties. By placing some minimal constraint upon eligibility we get an explicit contraction recipe that exactly characterises the so called interpolation thesis, a thesis that states upper and lower bounds for the amount of information to be given up in contraction. As a result we drop the controversial property of recovery. By placing additional constraints on eligibility we get representation theorems for a number of contraction operators of varying strength. In addition it is shown that recovery contraction is a special case that we get if eligibility is explicitly constructed in terms of logical relevance.
Unable to display preview. Download preview PDF.
- Cantwell, J. Non-linear belief revision, Acta Universitatis Upsaliensis, Uppsala, Sweden, 2000.Google Scholar
- FariÑas Del Cerro, L. and A. Herzig, ‘Belief change and dependence’, in Y. Shoham (ed.), TARK'96, pp. 147–162, Morgan Kaufmann Publishers, 1996.Google Scholar
- GÄrdenfors, P., ‘Belief revision and irrelevance’, PSA, 2:349–356, 1990.Google Scholar
- GÄrdenfors, P. and D. Makinson, ‘Revisions of knowledge systems and epistemic entrenchment’, in M. Y. Vardi (ed.), Proceedings of the Second Conference on Theoretical Aspects of Reasoning about Knowledge, pp. 83–95, Morgan Kaufmann, Los Altos, 1988.Google Scholar
- Hansson, S. O., ‘Taking belief bases seriously’, in D. Prawitz and D. Westerstahl (eds), Logic and Philosophy of science in Uppsala, pp. 13–28, Kluwer Academic Publishers, The Netherlands, 1994.Google Scholar
- Hansson, S. O., A Textbook of Belief Dynamics, Kluwer, 1999.Google Scholar
- Shoham, Y., Reasoning about change — Time and causation from the standpoint of Artificial Intelligence. The MIT press, Cambridge, Massachusetts, 1988.Google Scholar