We improve existing techniques for graphical representation of relational expressions and for exploitation of this representation in the translation of (hybrid) dyadic first-order sentences into equalities between relational expressions. The enhanced technique can cope with the relational complement construct and the negation connective. Complementation is handled by adopting a Smullyan-like uniform notation to classify and decompose map expressions, whereas negation is treated by generalizing the notion of graph for a formula in L+ and by introducing a series of graph-transformation rules which reflect the meaning of the connectives and quantifiers occurring in the formula.
A graphical representation of relational formulae with complementation
FORMISANO, Andrea;
2010
Abstract
We improve existing techniques for graphical representation of relational expressions and for exploitation of this representation in the translation of (hybrid) dyadic first-order sentences into equalities between relational expressions. The enhanced technique can cope with the relational complement construct and the negation connective. Complementation is handled by adopting a Smullyan-like uniform notation to classify and decompose map expressions, whereas negation is treated by generalizing the notion of graph for a formula in L+ and by introducing a series of graph-transformation rules which reflect the meaning of the connectives and quantifiers occurring in the formula.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
