Syntax and semantics for business rules

Authors:
Xiaofan Liu;Natasha Alechina;Brian Logan
Affiliations:
School of Computer Science, University of Nottingham, Nottingham, UK and School of Computer and Communication, Hunan University, Hunan, P.R. China;School of Computer Science, University of Nottingham, Nottingham, UK;School of Computer Science, University of Nottingham, Nottingham, UK
Venue:
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part IV
Year:
2010

Citing 2
Cited 0

Model-checking in dense real-time

Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Efficient timed model checking for discrete-time systems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Business processes are increasingly being expressed in declarative terms, as business rules which express obligations concerning conduct, action, practice or procedure regarding a particular business activity or sphere of operation. However, the leading standard for business rules, Semantics for Business Vocabulary and Business Rules (SBVR), leaves certain decisions concerning the precise syntax and semantics of business rules unspecified, for example, the scope and nesting of modalities and first order quantifiers, and the precise semantics of alethic and deontic modalities. In this paper, we propose a precise syntax and semantics for SBVR and present some complexity results for business rules with the proposed syntax and semantics.