scientific article; zbMATH DE number 7439733
From MaRDI portal
Publication:5015271
zbMath1478.03034arXiv1609.04091MaRDI QIDQ5015271
Emilio Muñoz-Velasco, Davide Bresolin, Guido Sciavicco
Publication date: 7 December 2021
Full work available at URL: https://arxiv.org/abs/1609.04091
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesis of Reactive(1) designs
- The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
- The Complexity of Clausal Fragments of LTL
- Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics
- Handbook of Spatial Logics
- A note on the complexity of the satisfiability of modal Horn clauses
- A propositional modal logic of time intervals
- Horn Fragments of the Halpern-Shoham Interval Temporal Logic
- Logical Foundations of Proof Complexity
- The decision problem for formulas in prenex conjunctive normal form with binary disjunctions
- On sentences which are true of direct unions of algebras
This page was built for publication: