On Disallowing Punctual Intervals in Reflexive Semantics of Halpern-Shoham Logic

16 pages•Published: November 18, 2018

Abstract

Halpern-Shoham logic (HS) is a very expressive and elegant formalism for interval temporal reasoning in which the satisfiability problem is undecidable. One of the methods to obtain HS-fragments of lower computational complexity is to adopt the softened (reflexive) seman- tics of the accessibility relations. In the paper we consider disallowing punctual intervals in reflexive semantics. We show that in this case we gain additional expressive power, which over discrete orders of time points results in PSpace-hardness of the Horn fragment of HS without diamond modal operators is and in undecidability of the core fragment of HS.

Keyphrases: computational complexity, halpern shoham logic, interval logic, sub propositional fragments

In: Gilles Barthe, Konstantin Korovin, Stephan Schulz, Martin Suda, Geoff Sutcliffe and Margus Veanes (editors). LPAR-22 Workshop and Short Paper Proceedings, vol 9, pages 91-106.

Links:	https://easychair.org/publications/paper/BHg5
	https://doi.org/10.29007/fl6v

BibTeX entry

@inproceedings{LPAR-IWIL2018:Disallowing_Punctual_Intervals_Reflexive,
  author    = {Przemysław Andrzej Wałęga},
  title     = {On Disallowing Punctual Intervals in Reflexive Semantics of Halpern-Shoham Logic},
  booktitle = {LPAR-22 Workshop and Short Paper Proceedings},
  editor    = {Gilles Barthe and Konstantin Korovin and Stephan Schulz and Martin Suda and Geoff Sutcliffe and Margus Veanes},
  series    = {Kalpa Publications in Computing},
  volume    = {9},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {/publications/paper/BHg5},
  doi       = {10.29007/fl6v},
  pages     = {91-106},
  year      = {2018}}

Download PDF Open PDF in browser