175 research outputs found
Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption
In this paper, we investigate the finite satisfiability and model checking problems for the logic D of 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
An Approach to Fuzzy Modal Logic of Time Intervals
Temporal reasoning based on intervals is nowadays ubiquitous in artificial intelligence, and the most representative interval temporal logic, called HS, was introduced by Halpern and Shoham in the eighties. There has been a great effort in the past in studying the expressive power and computational properties of the satisfiability problem for HS and its fragments, but only recently HS has been proposed as a suitable formalism for artificial intelligence applications. Such applications highlighted some of the intrinsic limits of HS: Sometimes, when dealing with real-life data one is not able to express temporal relations and propositional labels in a definite, crisp way. In this paper, following the seminal ideas of Fitting and Zadeh, among others, we present a fuzzy generalization of HS that partially solves such problems of expressive power, and we prove that, as in the crisp case, its satisfiability problem is generally undecidable
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption
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.Comment: arXiv admin note: text overlap with arXiv:1901.0388
Temporal Logic of Minkowski Spacetime
We present the proof that the temporal logic of two-dimensional Minkowski
spacetime is decidable, PSPACE-complete. The proof is based on a type of
two-dimensional mosaic. Then we present the modification of the proof so as to
work for slower-than-light signals. Finally, a subframe of the
slower-than-light Minkowski frame is used to prove the new result that the
temporal logic of real intervals with during as the accessibility relation is
also PSPACE-complete
On Expressiveness of Halpern-Shoham Logic and its Horn Fragments
Abstract: Halpern and Shoham\u27s modal logic of time intervals (HS in short) is an elegant and highly influential propositional interval-based logic. Its Horn fragments and their hybrid extensions have been recently intensively studied and successfully applied in real-world use cases. Detailed investigation of their decidability and computational complexity has been conducted, however, there has been significantly less research on their expressive power. In this paper we make a step towards filling this gap. We (1) show what time structures are definable in the language of HS, and (2) determine which HS fragments are capable of expressing: hybrid machinery, i.e., nominals and satisfaction operators, and somewhere, difference, and everywhere modal operators. These results enable us to classify HS Horn fragments according to their expressive power and to gain insight in the interplay between their decidability/computational complexity and expressiveness
Horn fragments of the Halpern-Shoham Interval Temporal Logic
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
- …