Simple Semiconcept Graphs: A Boolean Logic Approach

The aim of this paper is to develop a logical theory of concept graphs with negation. For this purpose, we introduce semiconcept graphs as syntactical constructs and define their semantics based on power context families. Then a standard power context family is constructed which serves both as a characterization of the entailment relation and as a mechanism to translate knowledge given on the graph level to the context level. A standard graph is constructed which entails all semiconcept graphs valid in a given power context family. The possible use of semi-concept graphs in conceptual knowledge processing is illustrated by an example.