Admissible models for quantified modal logic have a restriction on which sets of worlds are admissible as propositions. They give an actualist interpretation of quantifiers that leads to very general completeness results: for any propositional modal logic S there is a quantificational proof system QS that is complete for validity in models whose algebra of admissible propositions validates S. I...

Let G be a semi-simple Lie group with finite center and S ⊂ G a semigroup with intS 6= Ø . A closed subgroup L ⊂ G is said to be S -admissible if S is transitive in G/L . In [10] it was proved that a necessary condition for L to be S -admissible is that its action in B (S) is minimal and contractive where B (S) is the flag manifold associated with S , as in [9]. It is proved here, under an addi...

We investigate the combinatorial structure of linear programs on simple d-polytopes with d + 2 facets. These can be encoded by admissible grid orientations. Admissible grid orientations are also obtained through orientation properties of a planar point configuration or by the dual line arrangement. The point configuration and the polytope corresponding to the same grid are related through an ex...

Let X|μ ∼ Np(μ,vxI ) and Y |μ ∼ Np(μ,vyI ) be independent pdimensional multivariate normal vectors with common unknown mean μ. Based on observing X = x, we consider the problem of estimating the true predictive density p(y|μ) of Y under expected Kullback–Leibler loss. Our focus here is the characterization of admissible procedures for this problem. We show that the class of all generalized Baye...

Recently there is a resurgent interest in example based texture analysis and synthesis in both computer vision and computer graphics. While study in computer vision is concerned with learning accurate texture models, research in graphics is aimed at effective algorithms for texture synthesis without necessarily obtaining explicit texture model. This paper makes three contributions to this recen...

We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in general whereas it is confluent in the case of weakly orthogonal term rewriting systems. We show, however, that the considered relation is always confluent, as well as confluent modulo bisimilarity, for a large class of g...