Model correspondence as a basis for schema domination

  • Authors:
  • Guy Davies;Love Ekenberg

  • Affiliations:
  • Department of Computer and Systems Sciences, Stockholm University, Forum 100, SE-164 40 Kista, Sweden;Department of Computer and Systems Sciences, Stockholm University, Forum 100, SE-164 40 Kista, Sweden

  • Venue:
  • Knowledge-Based Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Conceptual schemata each representing some component of a system in the making, can be integrated in a variety of ways. Herein, we explore some fundamental notions of this. In particular, we examine some ways in which integration using correspondence assertions affects the interrelationship of two component schemata. Our analysis of the logic leads us to reject the commonly asserted requirement of constraining correspondence assertions to single predicates from a source schema. Much previous work has focussed on dominance with regard to preservation of information capacity as a primary integration criterion. However, even though it is desirable that the information capacity of a combined schema dominate one or both of its constituent schemata, we here discuss some aspects of why domination based on information capacity alone is insufficient for the integration to be semantically satisfactory, and we provide a framework for detecting mappings that prevent schema domination.