Abstract
When specifying graph languages via type graphs, cores are a convenient way to minimize the type graph without changing the graph language, i.e. the set of graphs typed over the type graph. However, given a type graph, the problem of finding its core is NP-hard. Using the Tool CoReS, we automatically encode all required properties into SAT- and SMT-formulas to iteratively compute cores by employing the corresponding solvers. We obtain runtime results to evaluate and compare the two encoding approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
CoReS: https://github.com/mnederkorn/CoReS. Accessed 22 Feb 2018
Limboole: http://fmv.jku.at/limboole/index.html. Accessed 19 Feb 2018
Barrett, C., Stump, A., Tinelli, C.: The SMT-LIB standard - Version 2.0. In: Proceedings of the 8th International Workshop on Satisfiability Modulo Theories (SMT 2010), Edinburgh, Scotland, July 2010
Corradini, A., König, B., Nolte, D.: Specifying graph languages with type graphs. In: de Lara, J., Plump, D. (eds.) ICGT 2017. LNCS, vol. 10373, pp. 73–89. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61470-0_5
Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae 26(3/4), 241–265 (1996)
de Moura, L., Bjørner, N.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78800-3_24
Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. Springer, Heidelberg (2006). https://doi.org/10.1007/3-540-31188-2
Erdős, P., Rényi, A.: On random graphs I. Publicationes Mathematicae (Debrecen) 6, 290–297 (1959)
Gilbert, E.N.: Random graphs. Ann. Math. Statist. 30(4), 1141–1144 (1959)
Nešetřil, J., Tardif, C.: Duality theorems for finite structures (characterising gaps and good characterisations). J. Comb. Theor. Ser. B 80, 80–97 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
König, B., Nederkorn, M., Nolte, D. (2018). CoReS: A Tool for Computing Core Graphs via SAT/SMT Solvers. In: Lambers, L., Weber, J. (eds) Graph Transformation. ICGT 2018. Lecture Notes in Computer Science(), vol 10887. Springer, Cham. https://doi.org/10.1007/978-3-319-92991-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-92991-0_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-92990-3
Online ISBN: 978-3-319-92991-0
eBook Packages: Computer ScienceComputer Science (R0)