The Community for Technology Leaders
Green Image
Issue No. 01 - January/February (2006 vol. 21)
ISSN: 1541-1672
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

R. Dieng-Kuntz, C. Faron-Zucker, F. Gandon and O. Corby, "Searching the Semantic Web: Approximate Query Processing Based on Ontologies," in IEEE Intelligent Systems, vol. 21, no. , pp. 20-27, 2006.
86 ms
(Ver 3.3 (11022016))