This paper introduces the problem of matching people names to their corresponding social network identities such as their Twitter accounts. Existing tools for this purpose build u...
Gae-won You, Seung-won Hwang, Zaiqing Nie, Ji-Rong...
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
This work presents a visualization algorithm for defeasible logic rule bases as well as a software tool that applies this algorithm, according to which, a directed graph is produce...
Efstratios Kontopoulos, Nick Bassiliades, Grigoris...
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...