We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed within the hyper tableau framework. This combination generalizes well-known tableaux techniques like complement splitting and foldingup/down. We argue that this combination allows for efficiency improvements over previou...

In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We illustrate this approach with applications to moments of orthogonal polynomials, permutations, signed permutations, and tableaux. To Dennis Stanton with admir...

In this work we suggest the use of a set-theoretical interpretation of semantic tableaux for teaching propositional logic. If the student has previous notions of basic set theory, this approach to semantical tableaux can clarify her the way semantic trees operate, linking the syntactical and semantical sides of the process. Also, it may be useful for the introduction of more advanced topics in ...

We present the first tableau method with an ExpTime (optimal) complexity for checking satisfiability of a knowledge base in the description logic SHOQ, which extends ALC with transitive roles, hierarchies of roles, nominals and quantified number restrictions. The complexity is measured using binary representation for numbers. Our procedure is based on global caching and integer linear feasibili...

Résumé. Nous avons conçu un outil de classification de données original que nous détaillons dans le présent article. Cet outil comporte un module de création de résumés et un module d’affichage. Le module de création de résumés prend en charge les données mixtes (qualitatives et quantitatives) ainsi que les grands volumes de données en utilisant une méthode de classification incrémentale et agg...

We give a solution to a problem posed by Corteel and Nadeau concerning permutation tableaux of length n and the number of occurrences of the dashed pattern 32–1 in permutations on [n]. We introduce the inversion number of a permutation tableau. For a permutation tableau T and the permutation π obtained from T by the bijection of Corteel and Nadeau, we show that the inversion number of T equals ...

In previous work we showed that two apparently unrelated formulas for the Hall-Littlewood polynomials of type A are, in fact, closely related. The first is the tableau formula obtained by specializing q = 0 in the HaglundHaiman-Loehr formula for Macdonald polynomials. The second is the type A instance of Schwer’s formula (rephrased and rederived by Ram) for HallLittlewood polynomials of arbitra...

We find a general expression for the free energy of G(φ) = φ2k generalized 2D YangMills theories in the strong (A > Ac) region at large N . We also show that in this region, the density function of Young tableau of these models is a three-cut problem. In the specific φ6 model, we show that the theory has a third order phase transition, like φ2 (YM2) and φ 4 models. We have some comments for k ≥...

In this paper, we develop the Robinson-Schensted correspondence for the signed Brauer algebra. The Robinson-Schensted correspondence gives the bijection between the set of signed Brauer diagrams d and the pairs of standard bi-domino tableaux of shape λ = (λ1, λ2) with λ1 = (2 2f ), λ2 ∈ Γf,r where Γf,r = {λ|λ ` 2(n − 2f) + |δr| whose 2−core is δr, δr = (r, r − 1, . . . , 1, 0)}, for fixed r ≥ 0...