Abstract
This paper explores how to reason locally about global properties of graph transformations, in particular properties involving transitive closure of the edge relations of the graph. We show under which conditions we can soundly reduce reasoning about all nodes in the graph to reasoning about a finite set of nodes. We then give an effective procedure to turn this reduced problem into a Boolean satisfiability problem. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Strecker, M. (2012). Locality in reasoning about graph transformations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7233 LNCS, pp. 169–181). https://doi.org/10.1007/978-3-642-34176-2_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
