In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
Class Hierarchies, Factories, and Stable Designs M uch of the debate about the general aptness of class hierarchies is rooted in the different objectives taxonomists and implemente...
Polysemy is one of the most difficult problems when dealing with natural language resources. Consequently, automated ontology learning from textual sources (such as web resources) ...
The interpretation of medical evidence is normally presented in terms of a controlled, but diversely expressed specialist vocabulary and natural language phrases. Such informally ...
Bo Hu, Srinandan Dasmahapatra, Paul H. Lewis, Nige...
Abstract. The focus of this paper is approaches to measuring similarity for application in content-based query evaluation. Rather than only comparing at the level of words, the iss...