We present enhancements for UDDI / DAML-S registries allowing cooperative discovery and selection of Web services with a focus on personalization. To find the most useful service ...
We exploit the combinatorial structure of conceptual graphs in order to obtain faster execution time when computing projection, which is a core generalisation-specialisation relat...
The quality of the search experience has been an enduring problem for the World Wide Web. One of the well-known difficulties is the tendency of users to use short, under-specified...
Ahu Sieg, Bamshad Mobasher, Steven L. Lytinen, Rob...
This paper presents a new approach for exploiting Truth Maintenance Systems(TMSs) which makes them simpler to use without necessarily incurring a substantial performance penalty. ...
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...