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)