Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic

Conference paper

DOI: 10.1007/978-3-662-54069-5_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10119)
Cite this paper as:
Wałęga P.A. (2017) Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic. In: Ghosh S., Prasad S. (eds) Logic and Its Applications. ICLA 2017. Lecture Notes in Computer Science, vol 10119. Springer, Berlin, Heidelberg

Abstract

We propose hybridization of sub-propositional fragments of Halpern-Shoham logic as a way of obtaining expressive and decidable referential interval temporal logics. In the paper, we hybridize a Horn fragment of Halpern-Shoham logic whose language is restricted in its modal part to necessity modalities, and prove that satisfiability problem in this fragment is \(\textsc {NP}\)-complete over reflexive or an irreflexive and dense underlying structure of time.

Keywords

Interval logic Hybrid logic Computational complexity 

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  1. 1.Institute of PhilosophyUniversity of WarsawWarsawPoland

Personalised recommendations