DeepAI
Log In Sign Up

Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption

06/08/2020
by   Laura Bozzelli, et al.
0

The expressive power of interval temporal logics (ITLs) makes them really fascinating, and one of the most natural choices as specification and planning language. However, for a long time, due to their high computational complexity, they were considered not suitable for practical purposes. The recent discovery of several computationally well-behaved ITLs has finally changed the scenario. In this paper, we investigate the finite satisfiability and model checking problems for the ITL D featuring the sub-interval relation, under the homogeneity assumption (that constrains a proposition letter to hold over an interval if and only if it holds over all its points). First we prove that the satisfiability problem for D, over finite linear orders, is PSPACE-complete; then we show that its model checking problem, over finite Kripke structures, is PSPACE-complete as well. The paper enrich the set of tractable interval temporal logics with a meaningful representative.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/03/2022

Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability

We study the computational complexity of model checking and satisfiabili...
11/22/2017

Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison

In the last years, model checking with interval temporal logics is emerg...
09/06/2017

Model Checking for Fragments of Halpern and Shoham's Interval Temporal Logic Based on Track Representatives

Model checking allows one to automatically verify a specification of the...
06/08/2010

Begin, After, and Later: a Maximal Decidable Interval Temporal Logic

Interval temporal logics (ITLs) are logics for reasoning about temporal ...
12/22/2020

Model checking and model synthesisfrom partial models: a logic-based perspective

I consider the following generic scenario: an abstract model M of some '...
02/16/2022

The addition of temporal neighborhood makes the logic of prefixes and sub-intervals EXPSPACE-complete

A classic result by Stockmeyer gives a non-elementary lower bound to the...