Title: A resolution-based approach to graph transformation

Abstract: The use of graphs and of rule-based graph transformations for the specification and analysis of software systems has a long tradition in computer science. Its focus is on those systems whose states can be formalized as graph-like structures, and whose evolution can be presented by means of discrete graph reconfigurations. In this talk, we revisit several algebraic approaches to graph transformation from the vantage point of the theory of institutions, and we show how graph-transformation frameworks can be described in the context of substitution systems. This sets the foundation for conducting research into a graph-transformation variant of logic programming that would uniformly accommodate, for the first time, both the traditional, well-established operational semantics of graph transformation and the more recent denotational semantics of the paradigm, which is still in its very early stages of development.