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 条
  • [41] Learning to verify branching time properties
    Vardhan, Abhay
    Viswanathan, Mahesh
    FORMAL METHODS IN SYSTEM DESIGN, 2007, 31 (01) : 35 - 61
  • [42] Reasoning about sequential and branching behaviours of message sequence graphs
    Madhusudan, P
    AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 809 - 820
  • [43] Learning to verify branching time properties
    Abhay Vardhan
    Mahesh Viswanathan
    Formal Methods in System Design, 2007, 31 : 35 - 61
  • [44] Encapsulating deontic and branching time specifications
    Castro, Pablo F.
    Maibaum, Thomas S. E.
    THEORETICAL COMPUTER SCIENCE, 2012, 455 : 98 - 122
  • [45] Memoryful branching-time logic
    Kupferman, Orna
    Vardi, Moshe Y.
    21ST ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2006, : 265 - +
  • [46] A compositional theory of refinement for branching time
    Manolios, P
    CORRECT HARDWARE DESIGN AND VERIFICATION METHODS, PROCEEDINGS, 2003, 2860 : 304 - 318
  • [47] Compositional Branching-Time Measurements
    Grosu, Radu
    Peled, Doron
    Ramakrishnan, C. R.
    Smolka, Scott A.
    Stoller, Scott D.
    Yang, Junxing
    FROM PROGRAMS TO SYSTEMS: THE SYSTEMS PERSPECTIVE IN COMPUTING, 2014, 8415 : 118 - +
  • [48] Controlled branching processes with continuous time
    Gonzalez, Miguel
    Molina, Manuel
    del Puerto, Ines
    Yanev, Nikolay M.
    Yanev, George P.
    JOURNAL OF APPLIED PROBABILITY, 2021, 58 (03) : 830 - 848
  • [49] THE DECISION PROBLEM FOR BRANCHING TIME LOGIC
    GUREVICH, Y
    SHELAH, S
    JOURNAL OF SYMBOLIC LOGIC, 1985, 50 (03) : 668 - 681
  • [50] DECIDING FULL BRANCHING TIME LOGIC
    EMERSON, EA
    SISTLA, AP
    INFORMATION AND CONTROL, 1984, 61 (03): : 175 - 201