Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
All I know: a study in autoepistemic logic
Artificial Intelligence
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Term rewriting and all that
The logic of knowledge bases
Advanced topics in term rewriting
Advanced topics in term rewriting
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
Semantics for multi-agent only knowing: extended abstract
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
Towards an axiom system for default logic
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Only-knowing: taking it beyond autoepistemic reasoning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Default reasoning with preference within only knowing logic
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Hi-index | 0.00 |
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.