Fact calculus: using ORM and lisa-d to reason about domains

  • Authors:

  • S. J. B. A. Hoppenbrouwers;H. A. (Erik) Proper;Th. P. van der Weide

  • Affiliations:

  • Institute for Computing and Information Sciences, Radboud University, Nijmegen, The Netherlands, EU;Institute for Computing and Information Sciences, Radboud University, Nijmegen, The Netherlands, EU;Institute for Computing and Information Sciences, Radboud University, Nijmegen, The Netherlands, EU

  • Venue:
  • OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
  • Year:
  • 2005

  • A Role Calculus for ORM

    OTM '09 Proceedings of the Confederated International Workshops and Posters on On the Move to Meaningful Internet Systems: ADI, CAMS, EI2N, ISDE, IWSSA, MONET, OnToContent, ODIS, ORM, OTM Academy, SWWS, SEMELS, Beyond SAWSDL, and COMBEK 2009

  • Predicate Reference and Navigation in ORM

    OTM '09 Proceedings of the Confederated International Workshops and Posters on On the Move to Meaningful Internet Systems: ADI, CAMS, EI2N, ISDE, IWSSA, MONET, OnToContent, ODIS, ORM, OTM Academy, SWWS, SEMELS, Beyond SAWSDL, and COMBEK 2009

  • Giving meaning to enterprise architectures: architecture principles with ORM and ORC

    OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose to use ORM and Lisa-D as means to formally reason about domains. Conceptual rule languages such as Lisa-D, RIDL and ConQuer allow for the specification of rules in a semi-natural language format that can more easily be understood by domain experts than languages such as predicate calculus, Z or OCL. If one would indeed be able to reason about properties of domains in terms of Lisa-D expressions, then this reasoning would be likely to be better accessible to people without a background in formal mathematics, such as “the average” domain expert. A potential application domain for such reasoning would be the field of business rules. If we can reason about business rules formulated in a semi-natural language format, the formal equivalence of (sets of) business rules (i.e. various paraphrasings) can be discussed with domain experts in a language and a fashion that is familiar to them.