Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...
We formulate a novel problem of summarising entities with limited presentation budget on entity-relationship knowledge graphs and propose an efficient algorithm for solving this pr...
Marcin Sydow, Mariusz Pikula, Ralf Schenkel, Adam ...
In practice, it is quite difficult to write correct multithreaded programs due to the potential for unintended and nondeterministic interference between parallel threads. A funda...
ons for this project. Most recent ones are listed at the end of this abstract. In the future, feature selection will be integrated in the multi-class EM algorithm to improve the pe...
Possibilistic logic provides a convenient tool for dealing with inconsistency and handling uncertainty. In this paper, we propose possibilistic description logics (DLs) as an exten...