Octavian Udrea
Abstract
Real-world use of RDF requires the ability to transparently represent and explain metadata associated with RDF triples. For example, when RDF triples are extracted automatically by information extraction programs, there is a need to represent where the triples came from, what their temporal validity is, and how certain we are that the triple is correct. Today, there is no theoretically clean and practically scalable mechanism that spans these different needs - reification is the only solution propose to date, and its implementations have been ugly. In this paper, we present Annotated RDF (or aRDF for short) in which RDF triples are annotated by members of a partially ordered set (with bottom element) that can be selected in any way desired by the user. We present a formal declarative semantics (model theory) for annotated RDF and develop algorithms to check consistency of aRDF theories and to answer queries to aRDF theories. We show that annotated RDF supports users who need to think about the uncertainty, temporal aspects, and provenance of the RDF triples in an RDF database. We develop a prototype aRDF implementation and show that our algorithms work efficiently even on real world data sets containing over 10 million triples.
- Albanese, M. and Subrahmanian, V. 2007. T-REX: A System for Automated Cultural Information Extraction. In Proceedings of the International Conference on Computational Cultural Dynamics. AAAI Press, 2--8.Google Scholar
- Antoniou, G. and van Harmelen, F. 2004. Web ontology language: Owl. In Handbook on Ontologies. Springer-Verlag, 67--92.Google Scholar
- Bonatti, P. A., Sapino, M. L., and Subrahmanian, V. S. 1996. Merging heterogeneous security orderings. In Proceedings of the 4th European Symposium on Research in Computer Security (ESORICS'96). Springer-Verlag, 183--197. Google ScholarDigital Library
- Calì, A. and Lukasiewicz, T. 2007. Tightly integrated probabilistic description logic programs for the semantic web. In Proceedings of the International Conference on Logic Programming. Springer-Verlag, 428--429. Google ScholarDigital Library
- Carroll, J. J., Bizer, C., Hayes, P., and Stickler, P. 2005. Named graphs, provenance and trust. In Proceedings of the 14th International Conference on World Wide Web (WWW'05). ACM Press, New York, NY, 613--622. Google ScholarDigital Library
- Cordella, L. P., Foggia, P., Sansone, C., and Vento, M. 2004. A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intel. 26, 10, 1367--1372. Google ScholarDigital Library
- Cortesi, A., Dovier, A., Quintarelli, E., and Tanca, L. 2002. Operational and abstract semantics of the query language g-log. Theor. Comput. Sci. 275, 1-2, 521--560. Google ScholarDigital Library
- Costantini, S. and Lanzarone, G. 1994. A metalogic programming approach: language, semantics and applications. J. Exper. Theor. Artif. Intell. 6, 3, 239--287.Google ScholarCross Ref
- Dubois, D., Mengin, J., and Prade, H. 2006. Possibilistic uncertainty and fuzzy features in description logic. a preliminary discussion. In Fuzzy Logic and the Semantic Web, E. Sanchez, Ed. Elsevier, 101--113.Google Scholar
- Fayzullin, M., Subrahmanian, V. S., Albanese, M., Cesarano, C., and Picariello, A. 2007. Story creation from heterogeneous data sources. Multimedia Tools Appl. 33, 3, 351--377. Google ScholarDigital Library
- Fitting, M. 1991. Bilattices and the semantics of logic programming. J. Log. Program. 11, 2, 91--116. Google ScholarDigital Library
- Floyd, R. 1962. Algorithm 97: Shortest path. Comm. ACM 5, 6, 345. Google ScholarDigital Library
- Gergatsoulis, M. and Lilis, P. 2005. Multidimensional rdf. In Proceedings of the International Conference on Ontologies, Databases, and Semantics (ODBASE). Vol. 3761. Springer, 1188--1205. Google ScholarDigital Library
- Guha, R. and McCool, R. 2003. Tap: A semantic web test-bed. Web Semantics: Science, Services Agents World Wide Web 1, 1, 81--87.Google ScholarCross Ref
- Gupta, A. and Mumick, I. 1999. Materialized Views: Techniques, Implementations, and Applications. MIT Press. Google ScholarCross Ref
- Gutiérrez, C., Hurtado, C. A., and Vaisman, A. A. 2005. Temporal rdf. In Proceedings of the European Semantic Web Conference. 93--107. Google ScholarDigital Library
- Halaschek-Wiener, C., Golbeck, J., Schain, A., Grove, M., Parsia, B., and Hendler, J. 2006. Annotation and provenance tracking in semantic web photo libraries. In Proceedings of the International Provenance and Annotation Workshop. 82--89. Google ScholarDigital Library
- Hlaoui, A. and Wang, S. 2002. A new algorithm for inexact graph matching. In Proceedings of the International Conference on Pattern Recognition. 180--183. Google ScholarDigital Library
- Hung, E., Deng, Y., and Subrahmanian, V. S. 2005. Rdf aggregate queries and views. 717--728. Google ScholarDigital Library
- Kahan, J. and Koivunen, M.-R. 2001. Annotea: an open rdf infrastructure for shared web annotations. In Proceedings of the 10th International Conference on World Wide Web (WWW'01). ACM Press, New York, NY. 623--632. Google ScholarDigital Library
- Karvounarakis, G., Alexaki, S., Christophides, V., Plexousakis, D., and Scholl, M. 2002. Rql: a declarative query language for rdf. In Proceedings of the 11th International Conference on World Wide Web (WWW'02). ACM Press, New York, NY, 592--603. Google ScholarDigital Library
- Kifer, M. and Subrahmanian, V. S. 1992. Theory of generalized annotated logic programming and its applications. J. Log. Program. 12, 4, 335--367. Google ScholarDigital Library
- Kolaitis, P. and Vardi, M. 2000. Conjunctive-query containment and constraint satisfaction. J. Comput. Sys. Sci. 61, 2, 302--332. Google ScholarDigital Library
- Krajci, S., Lencses, R., and Vojtas, P. 2004. A comparison of fuzzy and annotated logic programming. Fuzzy Sets Syst. 144, 1, 173--192.Google ScholarCross Ref
- Krishnaprasad, T. and Kifer, M. 1993. A theory of nonmonotonic inheritance based on annotated logic. Artif. Intell. 60, 1, 23--50. Google ScholarDigital Library
- Leach, S. M. and Lu, J. J. 1996. Query processing in annotated logic programming: Theory and implementation. J. Intell. Inform. Syst. 6, 1, 33--58.Google ScholarCross Ref
- Lu, J. J., Murray, N. V., Radjavi, H., Rosenthal, E., and Rosenthal, P. 2002. Inference for annotated logics over distributive lattices. In Proceedings of the International Symposium on Methodologies for Intelligent Systems. 285--293. Google ScholarDigital Library
- Lukasiewicz, T. and Straccia, U. 2007. Tightly integrated fuzzy description logic programs under the answer set semantics for the semantic web. In Proceedings of the International Conference on Web Reasoning and Rule Systems (RR). 289--298. Google ScholarDigital Library
- Maduko, A., Anyanwu, K., Sheth, A., and Schliekelman, P. 2007. Estimating the cardinality of rdf graph patterns. In Proceedings of the 16th International Conference on World Wide Web (WWW'07). ACM Press, New York, NY, 1233--1234. Google ScholarDigital Library
- Magkanaraki, A., Tannen, V., Christophides, V., Plexousakis, D., Scholl, M., and Tolle, R. 2003. Viewing the semantic web with rvl lenses. In Proceedings of the International Semantic Web Conference.Google Scholar
- Martelli, A. and Montanari, U. 1982. An efficient unification algorithm. ACM Trans. Progr. Lang. Syst. 4, 2, 258--282. Google ScholarDigital Library
- Mazzieri, M. and Dragoni, A. F. 2005. A fuzzy semantics for semantic web languages. In Proceedings of the International Workshop on Uncertainty Reasoning for the Semantic Web. 12--22.Google Scholar
- Ramakrishnan, C., Kochut, K., and Sheth, A. 2006. A framework for schema-driven relationship discovery from unstructured text a framework for schema-driven relationship discovery from unstructured text. In Proceedings of the International Semantic Web Conference. 583--596. Google ScholarDigital Library
- Straccia, U. 2005. Towards a fuzzy description logic for the semantic web. In Proceedings of the Workshop on Fuzzy Logic and the Semantic Web ed. E. Sanchez. 3--3. Google ScholarDigital Library
- Udrea, O., Recupero, D. R., and Subrahmanian, V. S. 2006. Annotated rdf. In Proceedings of the European Semantic Web Conference. 487--501. Google ScholarDigital Library
- Ullman, J. 2000. Information integration using logical views. Theor. Comput. Sci. 239, 2, 189--210. Google ScholarDigital Library
- Volz, R., Oberle, D., and Studer, R. 2002. Towards views in the semantic web. In Proceedings of the 2nd International Workshop on Databases, Documents, and Information Fusion.Google Scholar
Index Terms
- Annotated RDF
Recommendations
Towards distributed processing of RDF path queries
A technical infrastructure for storing, querying and managing RDF data is a key element in the current semantic web development. Systems like Jena, Sesame or the ICS-FORTH RDF Suite are widely used for building semantic web applications. Currently, none ...
Annotated RDF
ESWC'06: Proceedings of the 3rd European conference on The Semantic Web: research and applicationsThere are numerous extensions of RDF that support temporal reasoning, reasoning about pedigree, reasoning about uncertainty, and so on. In this paper, we present Annotated RDF (or aRDF for short) in which RDF triples are annotated by members of a ...
Extended RDF: Computability and complexity issues
ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics. Based ...
Comments