In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Abstract. This paper presents a prototype implementation of an intelligent assistance architecture for data-driven simulation specialising in qualitative data in the social science...
Catriona Kennedy, Georgios K. Theodoropoulos, Volk...
The user profile is one of the main context-information in a wide range of pervasive computing applications. Modern handheld devices provided with localization capabilities could a...
Hierarchical classifications are used pervasively by humans as a means to organize their data and knowledge about the world. One of their main advantages is that natural language ...
Ilya Zaihrayeu, Lei Sun, Fausto Giunchiglia, Wei P...
In this paper we show how coalition logic can be reduced to the fusion of a normal modal STIT logic for agency and a standard normal temporal logic for discrete time, and how this...