A minimal hybrid logic for intervals

被引:1
|
作者
Hussain, Altaf [1 ]
机构
[1] Univ London Imperial Coll Sci Technol & Med, Dept Comp, London SW7 2AZ, England
基金
英国工程与自然科学研究理事会;
关键词
tableau method; interval logics; hybrid logic; bulldozing;
D O I
10.1093/jigpal/jzk003
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Taking our inspiration from van Benthem's treatment of temporal interval structures, and Halpern and Shoham's work on intervals, we introduce an interval hybrid temporal logic with two binary relations, precedence and inclusion, for talking about interval temporal structures. This paper can be seen as an continuation of the work began in an earlier paper, in which we undertook a purely modal treatment of interval temporal structures. By introducing an interval hybrid temporal logic, we enrich the logic with nominals, and thereby increase the expressivity of the logic. We study the interval hybrid temporal logic in its full generality and identify two important classes of interval temporal structures: the class of minimal interval structures, and the class of van Benthem minimal interval structures. We present sound and complete tableau calculi for both classes of structures. We prove that the logic of minimal interval structures is decidable, by developing a novel bulldozing technique that handles both the presence of nominals and the interaction between the two relations. We go on to show that the satisfiability problem is EXPTIME-complete. We conclude the paper with the remark that the decidability (or otherwise) and complexity of the logic of van Benthem minimal interval structures remains an interesting open problem.
引用
收藏
页码:35 / 62
页数:28
相关论文
共 50 条
  • [41] TOWARDS AN EPISTEMIC TEMPORAL LOGIC BASED ON HYBRID LANGUAGES
    Herrera Gonzalez, Jose Rafael
    Vazquez Campos, Margarita
    ANALISIS FILOSOFICO, 2011, 31 (01): : 33 - 46
  • [42] A Two-Dimensional Hybrid Logic of Subset Spaces
    Wang, Yi N.
    LOGIC AND ITS APPLICATIONS, 2009, 5378 : 196 - 209
  • [43] Terminating tableau systems for hybrid logic with difference and converse
    Kaminski M.
    Smolka G.
    Journal of Logic, Language and Information, 2009, 18 (4) : 437 - 464
  • [44] Using Hybrid Logic for Coping with Functions in Subset Spaces
    Heinemann, Bernhard
    STUDIA LOGICA, 2010, 94 (01) : 23 - 45
  • [45] Low Power Pulse Generator Design Using Hybrid Logic
    Lin, Jin-Fa
    Hwang, Yin-Tsung
    Sheu, Ming-Hwa
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2010, E93A (06) : 1266 - 1268
  • [46] The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I
    Meier, Arne
    Mundhenk, Martin
    Schneider, Thomas
    Thomas, Michael
    Weber, Volker
    Weiss, Felix
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009, 2009, 5734 : 587 - +
  • [47] The complexity of satisfiability for fragments of hybrid logic-Part I
    Meier, Arne
    Mundhenk, Martin
    Schneider, Thomas
    Thomas, Michael
    Weber, Volker
    Weiss, Felix
    JOURNAL OF APPLIED LOGIC, 2010, 8 (04) : 409 - 421
  • [48] Games for hybrid logic from semantic games to analytic calculi
    Freiman, Robert
    JOURNAL OF LOGIC AND COMPUTATION, 2024,
  • [49] Higher-Order Syntax and Saturation Algorithms for Hybrid Logic
    Hardt, Moritz
    Smolka, Gert
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2007, 174 (06) : 15 - 27
  • [50] Hybrid fragments of Halpern-Shoham logic and their expressive power
    Walega, Przemyslaw Andrzej
    THEORETICAL COMPUTER SCIENCE, 2019, 797 : 102 - 128