Queries on ontologies with temporal dependences on Allen’s extended interval logic
- Авторы: Min Vu N.1, Plesnevich G.1
-
Учреждения:
- National Research University MPEI
- Выпуск: Том 55, № 6 (2016)
- Страницы: 912-923
- Раздел: Computer Methods
- URL: https://journals.rcsi.science/1064-2307/article/view/219756
- DOI: https://doi.org/10.1134/S1064230716060101
- ID: 219756
Цитировать
Аннотация
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.
Об авторах
Nguen Min Vu
National Research University MPEI
Автор, ответственный за переписку.
Email: minhvu.357@gmail.com
Россия, Moscow
G. Plesnevich
National Research University MPEI
Email: minhvu.357@gmail.com
Россия, Moscow
![](/img/style/loading.gif)