Expressing and Verifying Business Contracts with Abductive Logic Programming

  • Authors:
  • Marco Alberti;Federico Chesani;Marco Gavanelli;Evelina Lamma;Paola Mello;Marco Montali;Paolo Torroni

  • Affiliations:
  • Department of Engineering, University of Ferrara;Department of Electronics, Informatics, and Systems, University of Bologna;Department of Engineering, Ferrara University;Faculty of Engineering, University of Ferrara;Faculty of Engineering, teaching artificial intelligence and foundations of computer science, University of Bologna;Engineering Faculty, University of Bologna;Department of Electronic Engineering, University of Bologna's

  • Venue:
  • International Journal of Electronic Commerce
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

SCIFF is a declarative language, based on abductive logic programming, that accommodates forward rules, predicate definitions, and constraints over finite domain variables. Its abductive declarative semantics can be related to that of deontic operators; its operational specification is the sound and complete SCIFF proof procedure, defined as a set of transition rules implemented and integrated into a reasoning and verification tool. A variation of the SCIFF proof procedure (g-SCIFF) can be used for static verification of contract properties. The use of SCIFF for business contract specification and verification is demonstrated in a concrete scenario. Encoding of SCIFF contract rules in RuleML accommodates integration of SCIFF with architectures for business contracts.