Affiliations: [a] University of Bologna, V.le Risorgimento 2, 40136 Bologna, Italy. [email protected] | [b] University of Ferrara, Via Saragat 1, 44122 Ferrara, Italy. [email protected] | [c] University of Ferrara, Via Saragat 1, 44122 Ferrara, Italy. [email protected] | [d] University of Bologna, V.le Risorgimento 2, 40136 Bologna, Italy. [email protected] | [e] Free Universty of Bozen-Bolzano, Piazza Domenicani 3, I-39100 Bolzano, Italy. [email protected]
Correspondence:
[*]
Address for correspondence: University of Bologna, V.le Risorgimento 2, 40136 Bologna, Italy
Abstract: The compliance verification task amounts to establishing if the execution of a system, given in terms of observed happened events, does respect a given property. In the past both the frameworks of Temporal Logics and Logic Programming have been extensively exploited to assess compliance in different domains, such as normative multi-agent systems, business process management and service oriented computing. In this work we review the LTL and SCIFF frameworks in the light of compliance evaluation, and formally investigate the relationship between the two approaches. We define a notion of compliance within each approach, and then we show that an arbitrary LTL formula can be expressed in SCIFF, by providing a translation procedure from LTL to SCIFF which preserves compliance.
Keywords: Linear Temporal Logic, Abductive Logic Programming, Compliance Verification
