In this paper we take a generic approach to developing a theory of representation systems. Our approach involves giving an abstract formal characterization of a class of representation systems, and proving formal results based on this characterization. We illustrate this approach by defining and investigating two closely related classes of representations that we call Single Feature Indicator Systems (SFIS), with and without neutrality. Many common representations including tables, such as timetables and work schedules; connectivity graphs, including route maps and circuit diagrams; and statistical charts such as bar graphs, either are SFIS or contain one as a component. By describing SFIS abstractly, we are able to prove some properties of all of these representation systems by virtue of the fact that the properties can be proved on the basis of the abstract definition only. In particular we show that certain abstract inference rules are sound, and that each instance admits concrete inference rules obtained by instantiating the abstract counterparts.
展开▼
