An approach for semantic web query approximation based on domain knowledge and user preferences

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

One of the most important services in the Semantic Web is the Reasoning Service. According to the Semantic Web requirements, reasoning under time pressure or other restrictions is needed; and, reasoning which is not 'perfect' but instead 'good enough' for given tasks is acceptable. One of the approaches for the improvement of reasoning performance is approximation; of course, there is an effort for raising more precise approximations. One of the fields in which approximation seems to be useful is query. So far, all of the approximation strategies introduced for conjunctive queries just consider the query's structure. In this paper, a semantic approach for conjunctive query approximation utilizing domain knowledge and user preferences is proposed. Like other applications, it is expected that the usage of the suggested approach, either singular or in combination with other syntactic methods, results in a substantial improvement in the final approximation. © 2008 Springer-Verlag.

Cite

CITATION STYLE

APA

Iranmanesh, Z., Piri, R., & Abolhassani, H. (2008). An approach for semantic web query approximation based on domain knowledge and user preferences. In Communications in Computer and Information Science (Vol. 6 CCIS, pp. 443–452). https://doi.org/10.1007/978-3-540-89985-3_55

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free