On the Complexity of Deciding Call-by-Need
On the complexity of finding narrow proofs
On the Complexity of Finding Second-Best Abductive Explanations
On the complexity of identifying Head Elementary Set Free programs
On the Complexity of the Numerically Definite Syllogistic and Related Fragments
On the computational complexity of cut-reduction
On the confluence of lambda-calculus with conditional rewriting
On the contribution of backward jumps to instruction sequence expressiveness
On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
On the decidability and complexity of Metric Temporal Logic over finite words
On the Decidability of (ground) Reachability Problems for Cryptographic Protocols (extended version)
On the Definition of Non-deterministic Mechanisms
On the distributed evaluation of recursive queries over graphs
On the existence of truly autonomic computing systems and the link with quantum computing
On the Expressive Power of 2-Stack Visibly Pushdown Automata
On the Expressive Power of Multiple Heads in CHR
On the Expressiveness and Complexity of ATL
On the Expressiveness of Markovian Process Calculi with Durational and Durationless Actions
On the Expressiveness of the Ambient Logic
On the freeze quantifier in Constraint LTL: decidability and complexity