Expressiveness and complexity of graph logic (Q870359): Difference between revisions

@@ Property / DOI @@
-.1016/j.ic.2006.10.006
@@ Property / DOI: 10.1016/j.ic.2006.10.006 / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q58215601
@@ Property / Wikidata QID: Q58215601 / rank @@
+Normal rank
@@ 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.ic.2006.10.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2029632316
@@ Property / OpenAlex ID: W2029632316 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4673420
@@ Property / cites work: Q4673420 / rank @@
+Normal rank
@@ Property / cites work @@
+Weak Second‐Order Arithmetic and Finite Automata
+Normal rank
@@ Property / cites work @@
+Q4474211
@@ Property / cites work: Q4474211 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding validity in a spatial logic for trees
@@ Property / cites work: Deciding validity in a spatial logic for trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737192
@@ Property / cites work: Q4737192 / rank @@
+Normal rank
@@ Property / cites work @@
+TQL: a query language for semistructured data based on the ambient logic
+Normal rank
@@ Property / cites work @@
+Anytime, anywhere
@@ Property / cites work: Anytime, anywhere / rank @@
+Normal rank
@@ Property / cites work @@
+Model checking mobile ambients
@@ Property / cites work: Model checking mobile ambients / rank @@
+Normal rank
@@ Property / cites work @@
+Foundations of Software Science and Computation Structures
+Normal rank
@@ Property / cites work @@
+A logic you can count on
@@ Property / cites work: A logic you can count on / rank @@
+Normal rank
@@ Property / cites work @@
+FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
+Normal rank
@@ Property / cites work @@
+Expressiveness and complexity of graph logic
@@ Property / cites work: Expressiveness and complexity of graph logic / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255575
@@ Property / cites work: Q4255575 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q2847405
@@ Property / cites work: Q2847405 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5641083
@@ Property / cites work: Q5641083 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4783297
@@ Property / cites work: Q4783297 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4531380
@@ Property / cites work: Q4531380 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating finite automata and star-free languages
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+A note on model checking the modal \(\nu\)-calculus
+Normal rank
@@ Property / DOI @@
+.1016/J.IC.2006.10.006
@@ Property / DOI: 10.1016/J.IC.2006.10.006 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:870359