A rule-based method for specifying and querying temporal abstractions

  • Authors:
  • Martin J. O'Connor;Genaro Hernandez;Amar Das

  • Affiliations:
  • Stanford Center for Biomedical Informatics Research, Stanford, CA;Stanford Center for Biomedical Informatics Research, Stanford, CA;Stanford Center for Biomedical Informatics Research, Stanford, CA

  • Venue:
  • AIME'11 Proceedings of the 13th conference on Artificial intelligence in medicine
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Knowledge-Based Temporal Abstraction (KBTA) method is a well-established mechanism for representing and reasoning with temporal information. Implementations to date have been somewhat heavyweight, however, and custom tools are typically required to build abstraction knowledge and query the resulting abstractions. To address this shortcoming, we created a lightweight method that allows users to rapidly specify KBTA-based temporal knowledge and to immediately construct complex temporal queries with it. The approach is built on the Web Ontology Language (OWL), and its associated rule and query languages, SWRL and SQWRL. The method is reusable and can serve as the basis of a KBTA implementation in any OWL-based system.