The Community for Technology Leaders
RSS Icon
Issue No.01 - January/February (2006 vol.21)
pp: 20-27
Catherine Faron-Zucker , I3S, UMR CNRS
In the context of the Semantic Web, many possible executing queries wouldn't retrieve any resources. This is because the viewpoints of ontology designers, annotation designers, and users performing a Web search don't always match, leading to missed answers. Approximate query processing is thus of prime importance for efficiently searching the Semantic Web. The Corese ontology-based search engine handles RDF Schema, part of and OWL Lite and RDF metadata, and can process approximate queries. <p>This article is part of a special issue on AI, Agents, and the Web.</p>
Semantic Web, Web search, approximate queries, RDF Schema, RDF, conceptual graphs
Olivier Corby, Rose Dieng-Kuntz, Catherine Faron-Zucker, Fabien Gandon, "Searching the Semantic Web: Approximate Query Processing Based on Ontologies", IEEE Intelligent Systems, vol.21, no. 1, pp. 20-27, January/February 2006, doi:10.1109/MIS.2006.16
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool