The traditional mention-pair model for coreference resolution cannot capture information beyond mention pairs for both learning and testing. To deal with this problem, we present ...
Xiaofeng Yang, Jian Su, Jun Lang, Chew Lim Tan, Ti...
In companies a large amount of information is maintained that is accessible via network communication tools. This makes searching for a particular piece of information a di cult t...
Patrick Lambrix, Nahid Shahmehri, Niclas Wahll&oum...
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
In this paper we introduce the concept of valued tolerance as an extension of the usual concept of indiscernibility (which is a crisp equivalence relation) in rough sets theory. So...