Lukasiewicz T., Straccia U.
Description Logic Top k Logic Programs
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.
Source: First International Conference on Scalable Uncertainty Management., pp. 16–30, Washington, USA, Ottobre 2007
@inproceedings{oai:it.cnr:prodotti:44024, title = {Top-K retrieval in description logic programs under vagueness for the semantic Web}, author = {Lukasiewicz T. and Straccia U.}, doi = {10.1007/978-3-540-75410-7_2}, booktitle = {First International Conference on Scalable Uncertainty Management., pp. 16–30, Washington, USA, Ottobre 2007}, year = {2007} }