Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Basic Results for Two Types of High-Level Replacement Systems

Autor: Ehrig, Hartmut, Habel, Annegret, Parisi-Presicce, F.

Publikováno v: In Electronic Notes in Theoretical Computer Science May 2002 51:127-138

Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings

Autor: Bruggink, H.J.S., König, B., Nolte, D., Zantema, H., Parisi-Presicce, F., Westfechtel, B.

Publikováno v: Parisi-Presicce, F.; Westfechtel, B. (ed.), Graph Transformation : 8th International Conference, ICGT 2015, Held as Part of STAF 2015, L'Aquila, Italy, July 21-23, 2015. Proceedings, pp. 52-68
Lecture Notes in Computer Science ; 9151, 52-68. Berlin : Springer International Publishing
STARTPAGE=52;ENDPAGE=68;TITLE=Lecture Notes in Computer Science ; 9151
Graph Transformation ISBN: 9783319211442
ICGT
Graph Transformation (8th International Conference, ICGT 2015, Held as Part of STAF 2015, L'Aquila, Italy, July 21-23, 2015. Proceedings), 52-68
STARTPAGE=52;ENDPAGE=68;TITLE=Graph Transformation (8th International Conference, ICGT 2015, Held as Part of STAF 2015, L'Aquila, Italy, July 21-23, 2015. Proceedings)

We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by generaliz

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::30bc4885e45122ce1f8ffd3667e08fd5
https://hdl.handle.net/2066/143766

MP35-11 METABOLIC ABNORMALITIES LINKED TO AN INCREASED CARDIOVASCULAR RISK ARE ASSOCIATED WITH HIGHER STORAGE LOWER URINARY TRACT SYMPTOMS

Autor: De Nunzio, Cosimo, Truscelli, G., Lombardo, R., Gacci, M., Presicce, F., Leonardo, C., Gaudio, C., Lopes Mendes, A. L., Tubaro, A.

Publikováno v: Journal of Urology. 195

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d9c1bf899ee282845fa03ee16db4abb9
https://doi.org/10.1016/j.juro.2016.02.1603

Representing First Order Logic Using Graphs

Autor: Rensink, Arend, Ehrig, H, Engels, G., Parisi-Presicce, F., Rozenberg, G.

Publikováno v: Graph Transformations: Second International Conference, ICGT 2004, Rome, Italy, September 28–October 1, 2004. Proceedings, 319-335
STARTPAGE=319;ENDPAGE=335;TITLE=Graph Transformations
Lecture Notes in Computer Science ISBN: 9783540232070
ICGT

We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds to the negation of a set of existentials. The model is a direct general

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b301658bed0af0772bc05940cb07aeb0
https://doi.org/10.1007/978-3-540-30203-2_23