A value-passing version of normed context-free processes is considered, where process behaviours depend on a global state of data variables. The problem of characterizing bisimilarity of such processes is posed. A solution of the formulated problem is presented for a restricted class of processes and possibilities of extending the result are discussed. The presented solution exploits a tableau ...

A theory of counting nonintersecting lattice paths by the major index and generalizations of it is developed. We obtain determinantal expressions for the corresponding generating functions for families of nonintersecting lattice paths with given starting points and given nal points, where the starting points lie on a line parallel to x + y = 0. In some cases these determinants can be evaluated ...

Starting from suitable tableaux over finite dimensional Lie algebras, we provide a scheme for producing involutive linear Pfaffian systems related to various classes of submanifolds in homogeneous spaces which constitute integrable systems. These include isothermic surfaces, Willmore surfaces, projective minimal surfaces, and other classical soliton surfaces. Completely integrable equations suc...

Description Logics (DLs) are formalisms for representing and reasoning about conceptual knowledge. There exist several extensions of DLs for an appropriate integration of temporal knowledge [4]. This paper investigates the relation between the two DLs T L-ALCF [2, 3] and ALCF(D) [10, 8]. T L-ALCF is an interval-based, temporal DL for reasoning about objects whose properties vary over time. ALCF...

In this paper, we discuss a novel perspective on ontologybased context modelling that makes it easy to combine context models and contextual reasoning mechanisms. On the context modelling side, we outline our idea of a user-centric context model based on the six fundamental context parameters of who, when, where, what, how, and why (5W1H); on the contextual reasoning side, we introduce syntax a...

Lauren Williams (joint work with Einar Steingrímsson) We introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the " Le-diagrams " of Alex Postnikov. The structure of these tableaux is in some ways more transparent than the structure of permutations; therefore we believe tha...

Mason and Remmel introduced a basis for quasisymmetric functions known as the row-strict quasisymmetric Schur functions. This basis is generated combinatorially by fillings of composition diagrams that are analogous to the row-strict tableaux that generate Schur functions. We introduce a modification known as Young row-strict quasisymmetric Schur functions, which are generated by row-strict You...

This paper examines a new technique based on tableau, that allows one to introduce composition of roles from the right hand side of complex role inclusion axioms (RIAs). Our motivation comes from modeling product models in manufacturing systems. The series of papers, so far, have studied the extension of tableau algorithm for Description Logics (DLs) to capture complex RIAs. However, such RIAs ...

In this paper we compare two proof systems for minimal entailment: a tableau system OTAB and a sequent calculus MLK , both developed by Olivetti (1992). Our main result shows that OTAB-proofs can be efficiently translated into MLK -proofs, i.e.,MLK psimulates OTAB . The simulation is technically very involved and answers an open question posed by Olivetti (1992) on the relation between the two ...

Abstract. We derive new combinatorial identities which may be viewed as multivariate analogs of summation formulas for hypergeometric series. As in the previous paper [Re], we start with probability distributions on the space of the infinite Young tableaux. Then we calculate the probability that the entry of a random tableau at a given box equals n = 1, 2, . . . . Summing these probabilities ov...