Email this article Deduction Algorithms for Some Extensions of Allen’s Interval Logic
- Authors: Plesniewicz G.S.1, Nguyen Thi Minh Vu 1
-
Affiliations:
- National Research University Moscow Power Engineering Institute (MPEI)
- Issue: Vol 44, No 5 (2017)
- Pages: 345-356
- Section: Article
- URL: https://journals.rcsi.science/0147-6882/article/view/175283
- DOI: https://doi.org/10.3103/S0147688217050100
- ID: 175283
Cite item
Open Access
Access granted
Subscription Access
Abstract
This paper considers Allen’s interval logic language and the languages whose statements are Boolean combinations of Allen’s logic statements, possibly, with metric information. Some deduction algorithms for the languages are presented. The algorithms are based on the analytic tableaux method.
About the authors
G. S. Plesniewicz
National Research University Moscow Power Engineering Institute (MPEI)
Author for correspondence.
Email: salve777@mail.ru
Russian Federation, Moscow, 111250
Nguyen Thi Minh Vu
National Research University Moscow Power Engineering Institute (MPEI)
Email: salve777@mail.ru
Russian Federation, Moscow, 111250
Supplementary files
