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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
O’Connor, M. J., Hernandez, G., & Das, A. (2011). A rule-based method for specifying and querying temporal abstractions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6747 LNAI, pp. 255–259). https://doi.org/10.1007/978-3-642-22218-4_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
