In many applications, agents must reason about what other agents know, whether to coordinate with them or to come out on top in a competitive situation. However in general, reasoning in a multiagent epistemic logic such as Kn has high complexity. In this paper, we look at a restricted class of knowledge bases that are sets of modal literals. We call these proper epistemic knowledge bases (PEKBs...

G-Frames in Hilbert spaces are a redundant set of operators which yield a representation for each vector in the space. In this paper we investigate the connection between g-frames, g-orthonormal bases and g-Riesz bases. We show that a family of bounded operators is a g-Bessel sequences if and only if the Gram matrix associated to its denes a bounded operator.

The concept of comprehensive Grobner bases was introduced by Weispfenning. Montes has proposed an efficient algorithm for computing these bases. But he has not explicitly used Buchberger's criteria in his algorithm. In this paper we prove that we can apply these criteria on Montes algorithm. We propose a modified version of Montes algorithm and evaluate its performance via some examples.

the concept of comprehensive grobner bases was introduced by weispfenning. montes has proposed an efficient algorithm for computing these bases. but he has not explicitly used buchberger's criteria in his algorithm. in this paper we prove that we can apply these criteria on montes algorithm. we propose a modified version of montes algorithm and evaluate its performance via some examples.

Abstract In nonlinear greedy approximation theory, bidemocratic bases have traditionally played the role of dualizing democratic, greedy, quasi-greedy, or almost bases. this article we shift viewpoint and study them for their own sake, just as would with any other kind greedy-type particular show that need not be despite fact they retain a strong unconditionality flavor which brings very close ...

We address a general representation problem for belief change, and describe two interrelated representations for iterative nonprioritized change: a logical representation in terms of persistent epistemic states, and a constructive representation in terms of flocks of bases.

........................................................................................................................................................................ 124 Introduction ..................................................................................................................................................................... 124 The historical burden of essentialism ......