Conference item
Top−k Retrieval in Description Logic Programs Under Vagueness for the Semantic Web
- Abstract:
-
Description logics (DLs) and logic programs (LPs) are important representation languages for the Semantic Web. In this paper, we address an emerging problem in such languages, namely, the problem of evaluating ranked top-k queries. Specifically, we show how to compute the top-k answers in a data-complexity tractable combination of DLs and LPs under vagueness.
Actions
Authors
Bibliographic Details
- Publisher:
- Springer
- Volume:
- 4772
- Host title:
- Proceedings of the 1st International Conference on Scalable Uncertainty Management‚ SUM 2007‚ Washington‚ DC‚ USA‚ October 10−12‚ 2007
- Publication date:
- 2007-01-01
- ISBN:
- 9783540754077
Item Description
- UUID:
-
uuid:ff518288-5d69-41c4-ab1a-6bb7cb651ee0
- Local pid:
- cs:6673
- Deposit date:
- 2015-03-31
Terms of use
- Copyright date:
- 2007
If you are the owner of this record, you can report an update to it here: Report update to this record