Maximal elements in the partial algebra of accepted structured paths of a semantic schema
The concept of semantic schema was introduced in the paper Semantic Schemas and Applications in Logical Representation of Knowledge as a structure for knowledge representation. This structure is based on graph theory and universal algebras. New computational aspects in such structures were discussed in the paper New computational aspects in master-slave systems of semantic schemas. The intuitive aspect of this computation in a semantic schema S is given by the set of accepted structured paths ASP(S) of S. For this reason in this paper we study this set. We organize the set ASP(S) as a partial algebra. We discuss the maximal elements of this partial algebra.