Abstract
For a class of stochastic information systems a query language is defined and the completeness property proved. It is also shown that each term may be transformed into a canonical form, and in some special case into a normal additive form.
Keywords
Get full access to this article
View all access options for this article.