In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
Building on a simple modal logic of context, the paper presents a dynamic logic characterizing operations of contraction and expansion on theories. We investigate the mathematical...
Guillaume Aucher, Davide Grossi, Andreas Herzig, E...
— Privacy, lineage, uncertainty, and security are important to many information integration efforts, and these “PLUS” properties interact in a number of complex ways. This pa...
Barbara T. Blaustein, Len Seligman, Michael Morse,...
— Recent studies on wireless sensor networks (WSN) have shown that the duration of contacts and inter-contacts are power law distributed. While this is a strong property of these...
We present an axiomatisation for an extension of a temporal epistemic logic with an epistemic “reset” operator defined on the intersection between epistemic and temporal rela...