• DocumentCode
    2967146
  • Title

    Verbalising R2ML Rules into SBVR

  • Author

    Nicolae, Oana ; Wagner, Gerd

  • Author_Institution
    Dept. of Internet Technol., Brandenburg Tech. Univ. at Cottbus, Brandenburg, Germany
  • fYear
    2008
  • fDate
    26-29 Sept. 2008
  • Firstpage
    265
  • Lastpage
    272
  • Abstract
    Nowadays, business rules receive a lot of attention from both industry and academia, as they are considered the ideal vehicle for capturing business logic. The purpose of our paper is to raise the level of business logic abstraction with the help of existing, mature enough, R2ML language, in order to obtain higher semantic representations of rules and their basic constructs i.e. SBVR. Our paper focuses on the informal translation from R2ML derivation and integrity rules, into SBVR structured English in order to provide means for business rules validation and authorization. SBVR semantic formulations of R2ML rule sand their basic atoms are also described and exemplified, as they are the unique construct of SBVR standard, that captures and structures the meaning of rules to enable further translations into executable rule languages/engines, following MDA abstract levels of rule modeling.
  • Keywords
    business data processing; programming language semantics; specification languages; MDA abstract levels; R2ML derivation; R2ML rules; Semantic of Business Vocabulary and Business Rules structured English; business logic abstraction; business rules authorization; business rules validation; integrity rules; rule modeling; semantic representations; Computer integrated manufacturing; Internet; Logic; Natural languages; OWL; Ontologies; Search engines; Semantic Web; Testing; Vocabulary; MDA; OMG; R2ML; SBVR; business rules; rules interchange; standardisation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Symbolic and Numeric Algorithms for Scientific Computing, 2008. SYNASC '08. 10th International Symposium on
  • Conference_Location
    Timisoara
  • Print_ISBN
    978-0-7695-3523-4
  • Type

    conf

  • DOI
    10.1109/SYNASC.2008.30
  • Filename
    5204822