The complexity of propositional linear temporal logics in simple cases (Q1854521): Difference between revisions

@@ Property / author @@
-Stéphane P. Demri
@@ Property / author: Stéphane P. Demri / rank @@
-Normal rank
@@ Property / author @@
+Stéphane P. Demri
@@ Property / author: Stéphane P. Demri / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SPIN
@@ Property / describes a project that uses: SPIN / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2026379532
@@ Property / OpenAlex ID: W2026379532 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing finite Kripke structures in propositional temporal logic
+Normal rank
@@ Property / cites work @@
+An algebraic study of Diodorean modal systems
@@ Property / cites work: An algebraic study of Diodorean modal systems / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
+Normal rank
@@ Property / cites work @@
+Q2753678
@@ Property / cites work: Q2753678 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Flat fragments of CTL and CTL: separating the expressive and distinguishing powers
+Normal rank
@@ Property / cites work @@
+Q4381382
@@ Property / cites work: Q4381382 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945225
@@ Property / cites work: Q4945225 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952323
@@ Property / cites work: Q4952323 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of concept languages
@@ Property / cites work: The complexity of concept languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385542
@@ Property / cites work: Q4385542 / rank @@
+Normal rank
@@ Property / cites work @@
+Modalities for model checking: Branching time logic strikes back
+Normal rank
@@ Property / cites work @@
+Cut-free sequent and tableau systems for propositional Diodorean modal logics
+Normal rank
@@ Property / cites work @@
+The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
+Normal rank
@@ Property / cites work @@
+The propositional dynamic logic of deterministic, well-structured programs
+Normal rank
@@ Property / cites work @@
+Recurring Dominoes: Making the Highly Undecidable Highly Understandable
+Normal rank
@@ Property / cites work @@
+Space-bounded reducibility among combinatorial problems
+Normal rank
@@ Property / cites work @@
+Q2771058
@@ Property / cites work: Q2771058 / rank @@
+Normal rank
@@ Property / cites work @@
+Specification in CTL + past for verification in CTL.
+Normal rank
@@ Property / cites work @@
+Log Space Recognition and Translation of Parenthesis Languages
+Normal rank
@@ Property / cites work @@
+Q4002642
@@ Property / cites work: Q4002642 / rank @@
+Normal rank
@@ Property / cites work @@
+Hierarchical verification of asynchronous circuits using temporal logic
+Normal rank
@@ Property / cites work @@
+On the size of refutation Kripke models for some linear modal and tense logics
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+The logic of ``initially'' and ``next'': complete axiomatization and complexity
+Normal rank
@@ Property / cites work @@
+Q4068699
@@ Property / cites work: Q4068699 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of propositional linear temporal logics
+Normal rank
@@ Property / cites work @@
+Q4833777
@@ Property / cites work: Q4833777 / rank @@
+Normal rank
@@ Property / cites work @@
+Temporal logic can be more expressive
@@ Property / cites work: Temporal logic can be more expressive / rank @@
+Normal rank