PP-2005-02: On the complexity of hybrid logics with binders

PP-2005-02: ten Cate, Balder and Franceschet, Massimo (2005) On the complexity of hybrid logics with binders. [Report]

[img]
Preview
Text (Full Text)
PP-2005-02.text.pdf

Download (223kB) | Preview
[img] Text (Abstract)
PP-2005-02.abstract.txt

Download (810B)

Abstract

Hybrid logic refers to a group of logics lying between modal and first-order logic in which one can refer to individual states of the Kripke structure. In particular, the hybrid logic HL(@,!) is an appealing extension of modal logic that allows one to refer to a state by means of nominals and to dynamically create names for states. Unfortunately, as for the richer first-order logic, satisfiability for HL(@,!) is undecidable and model checking for HL(@,!) is PSPACE-complete. We carefully analyze these negative results and establish restrictions (both syntactic and semantic) that make the logic decidable again and that lower the complexity of the model checking problem.

Item Type: Report
Report Nr: PP-2005-02
Series Name: Prepublication (PP) Series
Year: 2005
Uncontrolled Keywords: Hybrid Logic; Complexity
Date Deposited: 12 Oct 2016 14:36
Last Modified: 12 Oct 2016 14:36
URI: https://eprints.illc.uva.nl/id/eprint/147

Actions (login required)

View Item View Item