Towards a general theory of action and time
Artificial Intelligence
Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Exact and approximate reasoning about temporal relations
Computational Intelligence
Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
Maintaining knowledge about temporal intervals
Communications of the ACM
Building and using temporal knowledge in archaeological documentation
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
Interval algebra of Allen [4] propose a set of relations which is particularly interesting on historical annotating tasks [1]. However, finding the feasible relations and consistent scenario has been shown to be NP-complete tasks for interval algebra networks [11,10]. For point algebra networks and a restricted class of interval algebra networks, some works propose efficient algorithms to resolve it. Nevertheless, these sets of relations (made of basic relation disjunctions) are not intuitive for describing historical scenarios. In this paper we propose a set of concrete relations for the annotator, and we formalize it in terms of temporal algebras. We then describe how our model can be matched with other ones to merge calculation efficiency and information suitability.