A graph H is computable if there is a graph G = (V,E)isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case is called a computable copy of H. The reachability problem for H in G is, given u,w ∈ V, to decide whether there is a path from u to w. If the reachability problem for is decidable in all computable copies of H then the problem is intrinsically decidable. This paper provides syntactic-logical characterizations of certain classes of graphs with intrinsically decidable reachability relations. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Csima, B. F., & Khoussainov, B. (2008). When is reachability intrinsically decidable? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5257 LNCS, pp. 216–227). https://doi.org/10.1007/978-3-540-85780-8_17
Mendeley helps you to discover research relevant for your work.