A survey on temporal reasoning in artificial intelligence
AI Communications
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
Maintaining knowledge about temporal intervals
Communications of the ACM
A survey of temporal extensions of description logics
Annals of Mathematics and Artificial Intelligence
Temporal Query Languages: A Survey
ICTL '94 Proceedings of the First International Conference on Temporal Logic
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
IEEE Transactions on Knowledge and Data Engineering
The Description Logic Handbook
The Description Logic Handbook
Proceedings of the 17th international conference on World Wide Web
Knowledge Engineering in a Temporal Semantic Web Context
ICWE '08 Proceedings of the 2008 Eighth International Conference on Web Engineering
Applied Temporal RDF: Efficient Temporal Querying of RDF Data with SPARQL
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
Reasoning with temporal constraints in RDF
PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
Using provenance to debug changing ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Hi-index | 0.00 |
RDF(S) and OWL 2 currently support only static ontologies. In practice, however, the truth of statements often changes with time, and Semantic Web applications often need to represent such changes and reason about them. In this paper we present a logic-based approach for representing validity time in RDF and OWL. Unlike the existing proposals, our approach is applicable to entailment relations that are not deterministic, such as the Direct Semantics or the RDF-Based Semantics of OWL 2.We also extend SPARQL to temporal RDF graphs and present a query evaluation algorithm. Finally, we present an optimization of our algorithm that is applicable to entailment relations characterized by a set of deterministic rules, such RDF(S) and OWL 2 RL/RDF entailment.