Unsatisfiability reasoning in ORM conceptual schemes

8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

ORM (Object-Role Modeling) is a rich and well-known conceptual modeling method. As ORM has a formal semantics, reasoning tasks such as satisfiability checking of an ORM schema naturally arise. Satisfiability checking allows a developer to automatically detect contradicting constraints. However, no complete satisfiability checker is known for ORM. In this paper, we revisit existing patterns from literature that indicate unsatisfiability of ORM schemes i.e., schemes that cannot be populated, and we propose refinements as well as additions for them. Although this does not yield a complete procedure - there may be ORM schemes passing the pattern checks while containing unsatisfiable roles - it yields an efficient and easy to implement detection mechanism (specially in interactive modeling tools) for the most common conceptual modeling mistakes. © IFIP International Federation for Information Processing 2006.

Cite

CITATION STYLE

APA

Jarrar, M., & Heymans, S. (2006). Unsatisfiability reasoning in ORM conceptual schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4254 LNCS, pp. 517–534). Springer Verlag. https://doi.org/10.1007/11896548_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free