TY - CHAP
T1 - How much are your geraniums? Taking graph conditions beyond first Order
AU - Rensink, Arend
PY - 2017
Y1 - 2017
N2 - Previous work has shown how first-order logic can equivalently be expressed through nested graph conditions, also called condition trees, with surprisingly few ingredients. In this paper, we extend condition trees by adding set-based operators such as sums and products, calculated over operands that are themselves characterised by first-order logic formulas. This provides a greatly improved way to specify computations such as: given that the price of a geranium plant equals 2 per flower petal, return the average price of all geraniums with at least one flower. We claim the same level of expressive equivalence as before between (extended) condition trees and a certain class of logic formulas; we show that the latter go beyond what can be expressed in first-order logic. On the practical side, we evaluate the performance and usability of set-based operators by specifying and comparing the example geranium property, with and without set-based operators, in the graph transformation tool GROOVE.
AB - Previous work has shown how first-order logic can equivalently be expressed through nested graph conditions, also called condition trees, with surprisingly few ingredients. In this paper, we extend condition trees by adding set-based operators such as sums and products, calculated over operands that are themselves characterised by first-order logic formulas. This provides a greatly improved way to specify computations such as: given that the price of a geranium plant equals 2 per flower petal, return the average price of all geraniums with at least one flower. We claim the same level of expressive equivalence as before between (extended) condition trees and a certain class of logic formulas; we show that the latter go beyond what can be expressed in first-order logic. On the practical side, we evaluate the performance and usability of set-based operators by specifying and comparing the example geranium property, with and without set-based operators, in the graph transformation tool GROOVE.
UR - http://www.scopus.com/inward/record.url?scp=85032689383&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-68270-9_10
DO - 10.1007/978-3-319-68270-9_10
M3 - Chapter
AN - SCOPUS:85032689383
SN - 9783319682693
VL - 10500 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 191
EP - 213
BT - ModelEd, TestEd, TrustEd
A2 - Katoen, Joost-Pieter
A2 - Langerak, Rom
A2 - Rensink, Arend
PB - Springer
T2 - Symposium on Model-Ed, Test-Ed, Trust-Ed in honour of Ed Brinksma on the occasion of his 60th birthday, 2017
Y2 - 18 October 2017 through 18 October 2017
ER -