background: as part of the process of developing a decision aid for carpal tunnel syndrome (cts) according to the ottawa decision support framework, we were interested in the level of ‘decisional conflict’ of hand surgeons and patients with cts. this study addresses the null hypothesis that there is no difference between surgeon and patient decisional conflict with respect to test and treatment...

We study the combination of the following already known ideas for showing confluence of unconditional or conditional term rewriting systems into practically more useful confluence criteria for conditional systems: Our syntactic separation into constructor and non-constructor symbols, Huet’s introduction and Toyama’s generalization of parallel closedness for non-terminating unconditional systems...

Abstract Convergent rewriting systems on algebraic structures give methods to solve decision problems, prove coherence results, and compute homological invariants. These are based higher-dimensional extensions of the critical branching lemma that proves local confluence from branchings. The analysis structures, such as groups or linear algebras, is complicated because underlying axioms. This ar...

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 suffic...

Confluence is an important property for any kind of rewrite system including CHR, which is a general-purpose declarative committedchoice language consisting of multi-headed guarded rules. CHR can yield a confluence problem, because of non-determinism in the choice of rules using the abstract semantics. Confluence in CHR is an ongoing research topic, because it provides numerous benefits for imp...

Previous results on confluence for Constraint Handling Rules, CHR, are generalized to take into account user-defined state equivalence relations. This allows a much larger class of programs to enjoy the advantages of confluence, which include various optimization techniques and simplified correctness proofs. A new operational semantics for CHR is introduced that reduces notational overhead sign...