Knowledge-based Graph Exploration Analysis

Ismênia Galvao; Eduardo Zambon; Arend Rensink; Lesley Wevers; Mehmet Aksit

doi:10.1007/978-3-642-34176-2_11

Knowledge-based Graph Exploration Analysis

Ismênia Galvao, Eduardo Zambon, Arend Rensink, Lesley Wevers, Mehmet Aksit

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

3 Citations (Scopus)

40 Downloads (Pure)

Abstract

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.

Original language	English
Title of host publication	AGTIVE 2011
Subtitle of host publication	Applications of Graph Transformations with Industrial Relevance
Editors	Andy Schürr, Dániel Varró, Gergely Varró
Place of Publication	Berlin, Heidelberg
Publisher	Springer
Pages	105-120
Number of pages	16
ISBN (Electronic)	978-3-642-34176-2
ISBN (Print)	978-3-642-34175-5
DOIs	https://doi.org/10.1007/978-3-642-34176-2_11
Publication status	Published - Oct 2011
Event	4th International Symposium on Applications of Graph Transformations with Industrial Relevance, AGTIVE 2011 - Budapest, Hungary Duration: 4 Oct 2011 → 7 Oct 2011 Conference number: 4

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	7233
ISSN (Print)	0302-9743

Conference

Conference	4th International Symposium on Applications of Graph Transformations with Industrial Relevance, AGTIVE 2011
Abbreviated title	AGTIVE
Country	Hungary
City	Budapest
Period	4/10/11 → 7/10/11

Keywords

METIS-285240
IR-79590
Graph Exploration Analysis
EWI-21401
Prolog
Feature Modelling
GROOVE

Access to Document

10.1007/978-3-642-34176-2_11

Galvao2011knowledge
open
Proof, 494 KB

Cite this

Galvao, I., Zambon, E., Rensink, A., Wevers, L., & Aksit, M. (2011). Knowledge-based Graph Exploration Analysis. In A. Schürr, D. Varró, & G. Varró (Eds.), AGTIVE 2011: Applications of Graph Transformations with Industrial Relevance (pp. 105-120). (Lecture Notes in Computer Science; Vol. 7233). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-34176-2_11

@inproceedings{9c6f7d86159e4dda9accd6090216dd10,

title = "Knowledge-based Graph Exploration Analysis",

abstract = "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.",

keywords = "METIS-285240, IR-79590, Graph Exploration Analysis, EWI-21401, Prolog, Feature Modelling, GROOVE",

author = "Ism{\^e}nia Galvao and Eduardo Zambon and Arend Rensink and Lesley Wevers and Mehmet Aksit",

year = "2011",

month = "10",

doi = "10.1007/978-3-642-34176-2_11",

language = "English",

isbn = "978-3-642-34175-5",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "105--120",

editor = "Andy Sch{\"u}rr and D{\'a}niel Varr{\'o} and Gergely Varr{\'o}",

booktitle = "AGTIVE 2011",

}

Galvao, I, Zambon, E, Rensink, A, Wevers, L & Aksit, M 2011, Knowledge-based Graph Exploration Analysis. in A Schürr, D Varró & G Varró (eds), AGTIVE 2011: Applications of Graph Transformations with Industrial Relevance. Lecture Notes in Computer Science, vol. 7233, Springer, Berlin, Heidelberg, pp. 105-120, 4th International Symposium on Applications of Graph Transformations with Industrial Relevance, AGTIVE 2011, Budapest, Hungary, 4/10/11. https://doi.org/10.1007/978-3-642-34176-2_11

Knowledge-based Graph Exploration Analysis. / Galvao, Ismênia; Zambon, Eduardo; Rensink, Arend; Wevers, Lesley; Aksit, Mehmet.

AGTIVE 2011: Applications of Graph Transformations with Industrial Relevance. ed. / Andy Schürr; Dániel Varró; Gergely Varró. Berlin, Heidelberg : Springer, 2011. p. 105-120 (Lecture Notes in Computer Science; Vol. 7233).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Knowledge-based Graph Exploration Analysis

AU - Galvao, Ismênia

AU - Zambon, Eduardo

AU - Rensink, Arend

AU - Wevers, Lesley

AU - Aksit, Mehmet

PY - 2011/10

Y1 - 2011/10

N2 - 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.

AB - 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.

KW - METIS-285240

KW - IR-79590

KW - Graph Exploration Analysis

KW - EWI-21401

KW - Prolog

KW - Feature Modelling

KW - GROOVE

U2 - 10.1007/978-3-642-34176-2_11

DO - 10.1007/978-3-642-34176-2_11

M3 - Conference contribution

SN - 978-3-642-34175-5

T3 - Lecture Notes in Computer Science

SP - 105

EP - 120

BT - AGTIVE 2011

A2 - Schürr, Andy

A2 - Varró, Dániel

A2 - Varró, Gergely

PB - Springer

CY - Berlin, Heidelberg

ER -