An important precondition for the success of the Semantic Web is founded on the principle that the content of web pages will be semantically annotated. In this paper, we propose a ...
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
In this paper we present several efficient computational procedures for defeasible reasoning while the plausible and well-defined semantics, viz. preferred models and stable mode...
Computing the degree of semantic relatedness of words is a key functionality of many language applications such as search, clustering, and disambiguation. Previous approaches to c...
Kira Radinsky, Eugene Agichtein, Evgeniy Gabrilovi...
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...