Horn fragments of the Halpern-Shoham Interval Temporal Logic

Bresolin, D. and Kurucz, A. and Muñoz-Velasco, E. and Ryzhikov, Vladislav and Sciavicco, G. and Zakharyaschev, Michael (2017) Horn fragments of the Halpern-Shoham Interval Temporal Logic. ACM Transactions on Computational Logic 18 (3), pp. 1-39. ISSN 1529-3785.

Abstract

We investigate the satisfiability problem for Horn fragments of the Halpern-Shoham interval temporal logic depending on the type (box or diamond) of the interval modal operators, the type of the underlying linear order (discrete or dense), and the type of semantics for the interval relations (reflexive or irreflexive). For example, we show that satisfiability of Horn formulas with diamonds is undecidable for any type of linear orders and semantics. On the contrary, satisfiability of Horn formulas with boxes is tractable over both discrete and dense orders under the reflexive semantics and over dense orders under the irreflexive semantics but becomes undecidable over discrete orders under the irreflexive semantics. Satisfiability of binary Horn formulas with both boxes and diamonds is always undecidable under the irreflexive semantics.

Metadata

Statistics

DownloadsShow export options

Export as XMLJSONCSV

Activity Overview

6 month trend

357Downloads

6 month trend

216Hits

Additional statistics are available via IRStats2.

Archive Staff Only (login required)

Edit/View Item