In a context where graph transformation is used to explore a space of possible solutions to a given problem, it is almost always necessary to inspect candidate solutions for relevant properties. This means that there is a need for a flexible mechanism to query not only graphs but also their evolution. In this paper we show how to use Prolog queries to analyse graph exploration. Queries can operate both on the level of individual graphs and on the level of the transformation steps, enabling a very powerful and flexible analysis method. This has been implemented in the graph-based verification tool groove. As an application of this approach, we show how it gives rise to a competitive analysis technique in the domain of feature modelling. © 2012 Springer-Verlag.
CITATION STYLE
Galvão, I., Zambon, E., Rensink, A., Wevers, L., & Aksit, M. (2012). Knowledge-based graph exploration analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7233 LNCS, pp. 105–120). https://doi.org/10.1007/978-3-642-34176-2_11
Mendeley helps you to discover research relevant for your work.