Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption
DOI10.4230/LIPICS.ICALP.2017.120zbMATH Open1442.68103OpenAlexW2740128568MaRDI QIDQ5111452FDOQ5111452
Authors: Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala 
Publication date: 27 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.120
Recommendations
- Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption
- Verifying preferential equivalence and subsumption via model checking
- Publication:4860652
- scientific article; zbMATH DE number 1523044
- Publication:4893144
- Satisfiability, Lattices, Temporal Logic and Constraint Logic Programming on Intervals
- The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
- On first-order expressibility of satisfiability in submodels
- The finite model property for semilinear substructural logics
- Model checking and validity in propositional and modal inclusion logics
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Computational aspects of satisfiability (68R07)
Cited In (12)
- On a Temporal Logic of Prefixes and Infixes.
- Complexity analysis of a unifying algorithm for model checking interval temporal logic
- The addition of temporal neighborhood makes the logic of prefixes and sub-intervals \textsc{ExpSpace-complete}
- Adding the relation \textit{Meets} to the temporal logic of prefixes and infixes makes it EXPSPACE-complete
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
- Interval vs. point temporal logic model checking. An expressiveness comparison
- Extracting interval temporal logic rules: a first approach
- Unary and two-variable interval logics
- \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes
- Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes
- Satisfiability problem in interval FP-logic
- Interval Temporal Logic for Visibly Pushdown Systems
This page was built for publication: Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111452)
