A main feature of many logics used in computer science is a means to express quantification. Usually, syntactical devices like variables and quantifiers are used for this purpose. In contrast to that, in conceptual graphs, a single syntactical item, the generic marker ‘∗’ is used. Nonetheless, sometimes conceptual graphs with variables have to be considered. If the generic marker is replaced by...

EMPATHICA is a computer program under development to facilitate cognitive-affective mapping using visual representations. A cognitive-affective map is a concept graph that includes information about the positive and negative emotional values of what is represented. Potential applications include conflict resolution, literary analysis, cross-cultural understanding, ethical assessment, authoring ...

When middle school students learn science content with graphs, the graphing and science knowledge may be mutually reinforcing: understanding the science content may help students interpret a related graph, and information from a graph may illustrate a scientific concept. We examine this relationship between graphing and science by studying how students learn from interactive computer models wit...

1. Introduction This paper discusses the integration of constraint actors to the Conceptual Programming (CP) environment (Hartley 1988) developed at CRL. The CP system is an implementation of Conceptual Graphs (Sowa 1984) with an added layer called procedural overlays. These overlays allow the system to represent temporal and causal information using a temporal calculus and related time maps (s...

Gross and Hopkins have proved that in chromatic stable homotopy, Spanier-Whitehead duality nearly coincides with Brown-Comenetz duality. We give a conceptual interpretation of this phenomenon in terms of a Gorenstein condition [8] for maps of ring spectra.

Piecewise linear maps over triangulations are used extensively in geometric modelling and computer graphics. This short note surveys recent progress on the important question of when such maps are one-to-one, central to which are convex combination maps.