Bilattices and the semantics of logic programming
Journal of Logic Programming
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
Annotea: an open RDF infrastructure for shared Web annotations
Proceedings of the 10th international conference on World Wide Web
RQL: a declarative query language for RDF
Proceedings of the 11th international conference on World Wide Web
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Named graphs, provenance and trust
WWW '05 Proceedings of the 14th international conference on World Wide Web
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, COA, and ODBASE - Volume Part II
CARA: A Cultural-Reasoning Architecture
IEEE Intelligent Systems
ACM Transactions on Computational Logic (TOCL)
A Minimal Deductive System for General Fuzzy RDF
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
AnQL: SPARQLing up annotated RDFS
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Fuzzy Reasoning over RDF Data Using OWL Vocabulary
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
A general framework for representing, reasoning and querying with annotated Semantic Web data
Web Semantics: Science, Services and Agents on the World Wide Web
Hi-index | 0.00 |
There 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 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 captures versions of all the forms of reasoning mentioned above within a single unified framework. We develop a prototype aRDF implementation and show that our algorithms work very fast indeed – in fact, in just a matter of seconds for theories with over 100,000 nodes.