Queries on ontologies with temporal dependences on Allen’s extended interval logic
- Authors: Min Vu N.T.1, Plesnevich G.S.1
-
Affiliations:
- National Research University MPEI
- Issue: Vol 55, No 6 (2016)
- Pages: 912-923
- Section: Computer Methods
- URL: https://journals.rcsi.science/1064-2307/article/view/219756
- DOI: https://doi.org/10.1134/S1064230716060101
- ID: 219756
Cite item
Abstract
This paper introduces Allen’s extended interval logic whose sentences are Boolean combinations of sentences of Allen’s interval logic with metric constraints on time points. For this extended logic, a deduction method based on analytic tableaux is defined. This method is used for answering queries on ontologies specified in Allen’s extended interval logic. An example illustrating the applicability of this extended logic to the problem of workflow specification is presented.
About the authors
Nguen Tkhi Min Vu
National Research University MPEI
Author for correspondence.
Email: minhvu.357@gmail.com
Russian Federation, Moscow
G. S. Plesnevich
National Research University MPEI
Email: minhvu.357@gmail.com
Russian Federation, Moscow