Branching Allen -: Reasoning with intervals in branching time

被引:0
|
作者
Ragni, M [1 ]
Wölfl, S [1 ]
机构
[1] Univ Freiburg, Inst Informat, D-79110 Freiburg, Germany
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Allen's interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restricted to domains that deal with linear flows of time. But how the fundamental ideas of Allen's calculus can be extended to other, weaker structures than linear orders has gained only little attention in the literature. In this paper we will investigate intervals in branching flows of time, which are of special interest for temporal reasoning, since they allow for representing indeterministic aspects of systems, scenarios, planning tasks, etc. As well, branching time models, i.e., treelike non-linear structures, do have interesting applications in the field of spatial reasoning, for example, for modeling traffic networks. In a first step we discuss interval relations for branching time, thereby comprising various sources from the literature. Then, in a second step, we present some new complexity results concerning constraint satisfaction problems of interval relations in branching time.
引用
收藏
页码:323 / 343
页数:21
相关论文
共 50 条
  • [31] MULTI-TYPE BRANCHING PROCESSES WITH TIME-DEPENDENT BRANCHING RATES
    Dolgopyat, D.
    Hebbar, P.
    Koralov, L.
    Perlman, M.
    JOURNAL OF APPLIED PROBABILITY, 2018, 55 (03) : 701 - 727
  • [32] Confidence intervals for nonhomogeneous branching processes and polymerase chain reactions
    Piau, D
    ANNALS OF PROBABILITY, 2005, 33 (02): : 674 - 702
  • [33] RELATION BETWEEN ONE-TIME-ONLY BRANCHING PROGRAMS AND REAL-TIME BRANCHING PROGRAMS
    BEBJAK, A
    STEFANEKOVA, I
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1988, 7 (02): : 107 - 111
  • [34] REASONING WITH MAXIMAL TIME INTERVALS
    RIBEIRO, C
    PORTO, A
    LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1991, 567 : 171 - 178
  • [35] Linear time datalog and branching time logic
    Gottlob, G
    Grädel, E
    Veith, H
    LOGIC-BASED ARTIFICIAL INTELLIGENCE, 2000, 597 : 443 - 467
  • [36] Branching time and orthogonal bisimulation equivalence
    Bergstra, JA
    Ponsea, A
    van der Zwaag, MB
    THEORETICAL COMPUTER SCIENCE, 2003, 309 (1-3) : 313 - 355
  • [37] Branching time and abstraction in bisimulation semantics
    Centrum voor Wiskunde en Informatica, Amsterdam, Netherlands
    J Assoc Comput Mach, 3 (555-600):
  • [38] TEMPORAL MODALITIES IN BRANCHING TIME STRUCTURES
    RESCHER, N
    URQUHART, AI
    JOURNAL OF SYMBOLIC LOGIC, 1970, 35 (01) : 185 - &
  • [39] Model checking branching time logics
    Schnoebelen, Ph.
    TIME 2007: 14th International Symposium on Temporal Representation and Reasoning, Proceedings, 2007, : 5 - 5
  • [40] Future Contingents, Branching time and Assertion
    Santelli, Alessio
    PHILOSOPHIA, 2021, 49 (02) : 777 - 799