. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Abstract— Our main goal in this paper is to set the foundations of a general continuous-domain framework for designing steerable, reversible signal transformations (a.k.a. frames...
We introduce the Open-source Fixed-point Model Checker OFMC for symbolic security protocol analysis, which extends the Onthe-fly Model Checker (the previous OFMC). The native inpu...
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...