The performance of triple stores is one of the major obstacles for the deployment of semantic technologies in many usage scenarios. In particular, Semantic Web applications, which use triple stores as persistence backends, trade performance for the advantage of flexibility with regard to information structuring. In order to get closer to the performance of relational database-backed Web applica...

Algebras that serve as models for concurrent studying of certain aspects of both the algebra of ordinary characters and the center of the group algebra have been considered by various authors. In this article we o¤er another such model. The main di¤erences between our model and the known ones are: 1. Our model includes Brauer characters and principal indecomposable characters as special cases. ...

In this paper we consider updates that are specified as rules and consider simple knowledge bases consisting of ground atoms. We present a translation of the rule based update specifications to extended logic programs using situation calculus notation so as to compute the updated knowledge base. We show that the updated knowledge base that we compute satisfies the update specifications and yet ...

Simple finite dimensional Kantor triple systems are classified in terms of Satake diagrams. We prove that every simple linearly compact Kantor triple system is finite dimensional and provide an explicit presentation of all the classical and exceptional systems.