In this paper we propose a complete chain for synthesizing controllers from high-level specifications. From real-time properties expressed in the logic MTL we generate, under boun...
Belief-logic deductions are used in the analysis of cryptographic protocols. We show a new method to decide such logics. In addition to the familiar BAN logic, it is also applicab...
Abstract. The paper refutes the general phenomenological argument that knowledge cannot be completely represented by symbols and, hence, symbolic AI does not work. Moreover, the vi...
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
Eric Allender, David A. Mix Barrington, Tanmoy Cha...
This paper presents a discussion of the theoretical complexity of plan recognition on the basis of an analysis of the number of explanations that any complete plan recognition alg...