We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
We present a calculus of mobile processes without prefix or summation, and using two different encodings we show that it can express both action prefix and guarded summation. O...
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
While much recent research has focussed on extending databases beyond the traditional relational model, relatively little has been done to develop database tools for querying data...
Abstract. The Spectrum project concentrates on the process of developing well-structured, precise system speci cations. Spectrum is a speci cation language, with a deduction calcul...