Conference item icon

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


Publisher:
Springer
Volume:
4772
Publication date:
2007-01-01
URN:
uuid:ff518288-5d69-41c4-ab1a-6bb7cb651ee0
Local pid:
cs:6673
ISBN:
978-3-540-75407-7

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP