Abstract
In this paper we exploit a computational logic-based framework, called SCIFF, for the formalization of DecSerFlow. DecSerFlow is a graphical, extendible high-level language for the declarative specification of service flows, and is grounded on LTL. SCIFF was originally developed in the context of the SOCS european project, where we addressed the issue of providing a formal language to define and verify interaction protocols in open environments. More specifically, in this work we show that SCIFF is concretely able to formalize the DecSerFlow core template formulae, tackling two complementary issues: on one hand, it is possible to specify SCIFF rules by using an intuitive and user-friendly graphical language; on the other hand, a DecSerFlow model may be grounded not only on LTL but also on an abductive framework, acquiring some new advantages and features. Finally, we propose to extend DecSerFlow by exploiting some useful features of the SCIFF framework, like for example the explicit notion of time, which could be used to specify temporal constraints and deadlines.