Confluent Term Rewriting for Only-knowing Logics


Combining term rewriting and modal logics, this paper addresses confluence and termination of rewrite systems introduced for only-knowing logics. The rewrite systems contain a rule scheme that gives rise to an infinite number of critical pairs, hence we cannot check the joinability of every critical pair directly, in order to establish local confluence. We investigate conditions that are sufficient for confluence and identify a set of rewrite rules that satisfy these conditions; however, the general confluence result makes it easier to check confluence also of stronger systems should one want additional rules. The results provide a firm logical basis for implementation of procedures that compute autoepistemic expansions.

In Proc. STAIRS 2010. Frontiers in Artificial Intelligence and Applications 222. © IOS Press 2010.