Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption

DOI10.4230/LIPICS.ICALP.2017.120MaRDI QIDQ5111452zbMATHOpenAlexFDO

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

zbMATH Keywords

computational complexitymodel checkingdecidabilityinterval temporal logicsatisfiability

Mathematics Subject Classification ID

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)

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

Cited in

(12)

• Adding the relation \textit{Meets} to the temporal logic of prefixes and infixes makes it EXPSPACE-complete
• Satisfiability problem in interval FP-logic
• Interval Temporal Logic for Visibly Pushdown Systems
• Complexity analysis of a unifying algorithm for model checking interval temporal logic
• Unary and two-variable interval logics
• On a Temporal Logic of Prefixes and Infixes.
• Interval vs. point temporal logic model checking. An expressiveness comparison
• Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
• The addition of temporal neighborhood makes the logic of prefixes and sub-intervals \textsc{ExpSpace-complete}
• \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes
• Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes
• Extracting interval temporal logic rules: a first approach

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)