A Temporal Extension of the Hayes and ter Horst Entailment Rules for RDFS and OWL

Temporal encoding schemes using RDF and OWL are often plagued by a massive proliferation of useless “container” ob- jects. Reasoning and querying with such representations is extremely complex, expensive, and error-prone. We present a temporal extension of the Hayes and ter Horst entailment rules for RDFS/OWL. The extension is realized by extend- ing RDF triples with further temporal arguments and requires only some lightweight forms of reasoning. The approach has been implemented in the forward chaining engine HFC.