@phdthesis{Lukichev2010, author = {Lukichev, Sergey}, title = {Towards rule interchange and rule verification}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus-20772}, school = {BTU Cottbus - Senftenberg}, year = {2010}, abstract = {Rules are a critical technology component for the early adoption and applications of knowledge-based techniques in e-business, especially enterprize integration and B2B ecommerce. They also play an important role in information systems engineering, especially in the specification of functional requirements where business rules are the foundation for capturing and modeling business application logic. When using rules, companies may encounter obstacles with two issues: The problem of rule interoperability, which is caused by a variety of rule languages and rule systems, and the problem of rule quality as a consequence of a large amount of business rules created and used in an organization. A particular solution to the rule interoperability problem is a standardized way of performing rule interchange between different rule languages and tools. The thesis addresses the problem by considering a rule interchange mapping from the Object Constraint Language (OCL) into the Semantic Web Rule Language (SWRL). This mapping is useful for various communities. For instance, software developers, who actively use UML/OCL, may employ the mapping in order to translate their rules to SWRL and use them in a Semantic Web application. On the other hand, the research on rule interchange is interesting for Semantic Web practitioners, who work in the area of formal semantics of rule languages and have interest in the rule interchange standardization. The main contribution of the thesis concerning rule interchange is the proof of correctness of the mapping from the semantical point of view. The problem of semantic correctness of rule interchange mapping is formulated for two rule languages and solved for OCL and SWRL. The approach can be applied to other rule languages with formal semantics. The quality of rules is high if they are expressed in the right way and express what business people want to express. However, due to various reasons, for instance communication problems between business people and rule modelers, rules may become inconsistent, incomplete or redundant. Therefore, organizations need rule quality measurement and technologies to improve the quality. A particular way to control and to improve the rule quality is by means of rule verification. In this respect, the main contribution of the thesis is the declarative rule verification approach, which can be used for detection of different problems in rule bases. The verification approach is implemented for Jena rules, which makes it more applicable for the quality control of upcoming Semantic Web rule-based applications.}, subject = {Semantic Web; Auszeichnungssprache; Regelaustausch; Semantic Web; Mathematische Logik; Gesch{\"a}ftsmodelle; Verifikation; Rule interchange; Semantics; Formal logic; Business rules; Verification}, language = {en} }