On the logic of theory base change.

*(English)*Zbl 0988.03512
MacNish, Craig (ed.) et al., Logics in artificial intelligence. European Workshop JELIA ’94, York, GB, September 5-8, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 838, 86-105 (1994).

Summary: Recently there has been considerable interest in change operators for theory bases, rather than entire theories. Especially since such operators could support computer-based implementations of revision systems. However, a perceived problem associated with theory base change operators is their sensitivity to the syntax of the theory base used. Although it has been argued that this sensitivity should reflect a higher level of commitment to formulae in the theory base than formulae derivable from the theory base. In this paper we develop a logic of theory base change, using constructions based on ensconcements. We show whenever two theory bases have equivalent ensconcements, the logical closure of their theory base revisions are identical. Moreover, we give explicit relationships associating theory base revision and theory base contraction, and provide explicit relationships between theory base change and theory change operations. We claim that these relationships show that our theory base revision and theory base contraction operators exhibit desirable behaviour.

For the entire collection see [Zbl 0849.00036].

For the entire collection see [Zbl 0849.00036].