Relational constructions on semiconcept graphs
Silke Pollandt · 2001
The aim of the paper is to develop a logic of relations on semiconcept graphs corresponding to the Contextual Logic of Relations on power context families. Semiconcept graphs allow the representation of negations. The operations from Peircean Algebraic Logic (i.e., the operations of relation algebras of power context families) are used to generate compound semiconcepts (or relations, resp.). For an arbitrary (semi-)concept graph, most specific semiconcept graphs are constructed where a compound semiconcept is assigned to each of the edges, i.e. compound semiconcepts are constructed directly on semiconcept graphs independent of the corresponding power context family. Contents 1.