Complexity and succinctness issues for linear-time hybrid logics (Q1044839): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2009.08.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2055646400
@@ Property / OpenAlex ID: W2055646400 / rank @@
+Normal rank
@@ Property / cites work @@
+Hybrid logics: characterization, interpolation and complexity
+Normal rank
@@ Property / cites work @@
+Q4215593
@@ Property / cites work: Q4215593 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5525343
@@ Property / cites work: Q5525343 / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Science Logic
@@ Property / cites work: Computer Science Logic / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of propositional linear temporal logics in simple cases
+Normal rank
@@ Property / cites work @@
+Model checking hybrid logics (with an application to semistructured data)
+Normal rank
@@ Property / cites work @@
+Hierarchies of modal and temporal logics with reference pointers
+Normal rank
@@ Property / cites work @@
+Succinct representation of regular languages by Boolean automata
+Normal rank
@@ Property / cites work @@
+Alternating finite automata on \(\omega\)-words
@@ Property / cites work: Alternating finite automata on \(\omega\)-words / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of propositional linear temporal logics
+Normal rank
@@ Property / cites work @@
+Bounded-Variable Fragments of Hybrid Logics
@@ Property / cites work: Bounded-Variable Fragments of Hybrid Logics / rank @@
+Normal rank
@@ Property / cites work @@
+Reasoning about infinite computations
@@ Property / cites work: Reasoning about infinite computations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4547769
@@ Property / cites work: Q4547769 / rank @@
+Normal rank