We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every st...
Previous research has shown that hypertext links may be a useful source of evidence for document contents and relevance, but these evidence are rather difficult to represent and co...
Arbitrary public announcement logic (APAL) is an extension of multi-agent epistemic logic that allows agents' knowledge states to be updated by the public announcement of (pos...