Previous research has identified several challenges that programmers face in answering questions about a code base. To explore ways to overcome those challenges, we have develope...
Curtis Fraser, Chris Luce, Jamie Starke, Jonathan ...
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
This paper introduces the controlled natural language PENG Light together with a language processor that is based on a bidirectional grammar. The language processor has the followi...
Providing route directions is a complicated interaction. Utterances are combined with gestures and pronounced with appropriate timing. This study proposes a model for a robot that...
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
Mathias Weller, Christian Komusiewicz, Rolf Nieder...