Skip to main content

Common Subsumbers in RDF

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8249))

Abstract

Since their definition in 1992, Least Common Subsumers (LCSs) have been identified as services supporting learning by examples. Nowadays, the Web of Data offers a hypothetically unlimited dataset of interlinked and machine-understandable examples modeled as RDF resources. Such an open and continuously evolving information source is then really worth investigation to learn significant facts. In order to support such a process, in this paper we give up to the subsumption minimality requirement of LCSs to meet the peculiarities of the dataset at hand and define Common Subsumers (CSs). We also propose an anytime algorithm to find CSs of pairs of RDF resources, according to a selection of such resources, which ensures computability.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baader, F., Calvanese, D., Mc Guinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook, 2nd edn. Cambridge University Press (2007)

    Google Scholar 

  2. Baader, F., Sertkaya, B., Turhan, A.Y.: Computing the least common subsumer w.r.t. a background terminology. J. Applied Logic 5(3), 392–420 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Beckett, D., Berners-Lee, T.: Turtle - Terse RDF Triple Language, W3C Team Submission (2011), http://www.w3.org/TeamSubmission/turtle/

  4. Berners-Lee, T., Hendler, J., Lassila, O.: The semantic web. Scientific American 248(4), 34–43 (2001)

    Article  Google Scholar 

  5. Cohen, W., Borgida, A., Hirsh, H.: Computing least common subsumers in description logics. In: Rosenbloom, P., Szolovits, P. (eds.) Proc. of AAAI 1992, pp. 754–761. AAAI Press (1992)

    Google Scholar 

  6. Cohen, W.W., Hirsh, H.: The learnability of description logics with equality constraints. Machine Learning 17(2-3), 169–199 (1994)

    Article  MATH  Google Scholar 

  7. Cohen, W.W., Hirsh, H.: Learning the CLASSIC description logics: Theoretical and experimental results. In: Doyle, J., Sandewall, E., Torasso, P. (eds.) Proc. of KR 1994, pp. 121–133 (1994)

    Google Scholar 

  8. Colucci, S., Di Noia, T., Di Sciascio, E., Donini, F., Piscitelli, G., Coppi, S.: Knowledge Based Approach to Semantic Composition of Teams in an Organization. In: Proc. of SAC 2005, pp. 1314–1319. ACM (2005)

    Google Scholar 

  9. Colucci, S., Di Sciascio, E., Donini, F.M., Tinelli, E.: Finding informative commonalities in concept collections. In: Proc. of CIKM 2008, pp. 807–817. ACM (2008)

    Google Scholar 

  10. d’Amato, C., Fanizzi, N., Ławrynowicz, A.: Categorize by: Deductive aggregation of semantic web query results. In: Aroyo, L., Antoniou, G., Hyvönen, E., ten Teije, A., Stuckenschmidt, H., Cabral, L., Tudorache, T. (eds.) ESWC 2010, Part I. LNCS, vol. 6088, pp. 91–105. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  11. De Giacomo, G., Lenzerini, M., Rosati, R.: Higher-order description logics for domain metamodeling. In: Proc. of AAAI 2011 (2011)

    Google Scholar 

  12. Delteil, A., Faron-Zucker, C., Dieng, R.: Learning ontologies from RDF annotations. In: Proc. of the Second Workshop on Ontology Learning (2001)

    Google Scholar 

  13. Fanizzi, N., d’Amato, C., Esposito, F.: Metric-based stochastic conceptual clustering for ontologies. Information Systems 34(8), 792–806 (2009)

    Article  Google Scholar 

  14. Frazier, M., Pitt, L.: Classic learning. In: Proc. of the 7th Annual ACM Conference on Computational Learning Theory, pp. 23–34. ACM (1994)

    Google Scholar 

  15. Garcia-Plaza, A., Fresno, V., Martinez, R.: Web page clustering using a fuzzy logic based representation and self-organizing maps. In: Proc. of WI-IAT 2008, vol. 1, pp. 851–854. ACM (2008)

    Google Scholar 

  16. Grimnes, G.A., Edwards, P., Preece, A.: Instance based clustering of semantic web resources. In: Bechhofer, S., Hauswirth, M., Hoffmann, J., Koubarakis, M. (eds.) ESWC 2008. LNCS, vol. 5021, pp. 303–317. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  17. Hayes, P.: RDF semantics, W3C recommendation (2004), http://www.w3.org/TR/2004/REC-rdf-mt-20040210/

  18. Ławrynowicz, A.: Grouping results of queries to ontological knowledge bases by conceptual clustering. In: Nguyen, N.T., Kowalczyk, R., Chen, S.-M. (eds.) ICCCI 2009. LNCS, vol. 5796, pp. 504–515. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  19. Madhavan, J., Cohen, S., Dong, X.L., Halevy, A.Y., Jeffery, S.R., Ko, D., Yu, C.: Web-scale data integration: You can afford to pay as you go. In: Proc. of CIDR 2007, pp. 342–350 (2007)

    Google Scholar 

  20. Mahmoud, H.A., Aboulnaga, A.: Schema clustering and retrieval for multi-domain pay-as-you-go data integration systems. In: Proc. of SIGMOD 2010, pp. 411–422. ACM (2010)

    Google Scholar 

  21. Pan, J.Z., Horrocks, I.: RDFS(FA): Connecting RDF(S) and OWL DL. IEEE Trans. on Knowl. and Data Eng. 19(2), 192–206 (2007)

    Article  Google Scholar 

  22. Shadbolt, N., Hall, W., Berners-Lee, T.: The semantic web revisited. IEEE Intelligent Systems 21(3), 96–101 (2006)

    Article  Google Scholar 

  23. ter Horst, H.J.: Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary. Journal of Web Semantics 3(2-3), 79–115 (2005)

    Article  MathSciNet  Google Scholar 

  24. Zeng, H.J., He, Q.C., Chen, Z., Ma, W.Y., Ma, J.: Learning to cluster web search results. In: Proc. of SIGIR 2004, pp. 210–217. ACM (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Colucci, S., Donini, F.M., Di Sciascio, E. (2013). Common Subsumbers in RDF. In: Baldoni, M., Baroglio, C., Boella, G., Micalizio, R. (eds) AI*IA 2013: Advances in Artificial Intelligence. AI*IA 2013. Lecture Notes in Computer Science(), vol 8249. Springer, Cham. https://doi.org/10.1007/978-3-319-03524-6_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03524-6_30

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03523-9

  • Online ISBN: 978-3-319-03524-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics