Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
We dene a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. Levy's ordering 2 on reductions) innite reductions in Conditional Orthogonal ...
Abstract. Milner introduced action calculi as a framework for investigating models of interactive behaviour. We present a type-theoretic account of action calculi using the proposi...
Andrew Barber, Philippa Gardner, Masahito Hasegawa...
We present a complete axiomatization of test algebra ( 24, 18, 29]), the two-sorted algebraic variant of Propositional Dynamic Logic (PDL, 21, 7]). The axiomatization consists of ...
Given a number of Dempster-Shafer belief functions there are different architectures which allow to do a compilation of the given knowledge. These architectures are the Shenoy-Sha...