Abstract

The A G M paradigm is a formal approach to ideal and rational i n f o r m a t i o n change From a practical perspective it suffers f r om two shortcomings, the first involves difficulties with respect to the finite representation of information, and the second involves the lack of support for the iteration of change operators In this paper we show that these practical problems can be solved in theoretically satisfying ways wholely w i t h i n the A G M paradigm We introduce a partial entrenchment ranking which serves as a canonical representation for a theory base and a well-ranked episterruc entrenchment, and we provide a computational model for adjusti ng p a r t i a l entrenchment rankings when they receive new information using a procedure based on the principle of minimal change The connectioni between the standard AGM theory change operators and the theory base change operators developed herein suggest that the proposed computational model for iterated theory base change exhibits desirable behaviour.

Links and resources

Tags

community

  • @fraktalek
  • @ramaz
  • @dblp
@fraktalek's tags highlighted