In this paper we present new time and size bounds for satissability in modal K. This is done by means of a simpliied SAT based procedure. Then, as a direct consequence, we provide theoretical support to the claim of superior eeciency for the SAT based decision procedures, with respect to the \classic" tableau based procedures.

We study quantized dual graded graphs, which are graphs equipped with linear operators satisfying the relation DU − qUD = rI. We construct examples based upon: the Fibonacci differential poset, permutations, standard Young tableau, and plane binary trees.

We present an approach for studying logical properties of problemsolving methods (PSMs) for knowledge-intensive tasks. It is based on semantic tableaux (a deduction-style theorem-proving technique). We show how tableaux can be manipulated in a methodical way to formalize non-deductive style PSMs.

The paper presents a novel expressive logic-based formalism intended for reasoning about numerical distances. We investigate its computational properties (in particular, show that it is EXPTIMEcomplete) and devise a tableau-based satisfiabilitychecking algorithm. To be able to express knowledge about implicit or unknown distances, we then extend the language with variables ranging over distance...

In this paper, explicit formulae for the expectation and the variance of descent functions on random standard Young tableaux are presented. Using these, it is shown that the normalized variance, V/E2, is bounded if and only if a certain inequality relating tableau shape to the descent function holds.

This paper develops and compares two tableaux-style proof systems for Peirce algebras. One is a tableau refutation proof system, the other is a proof system in the style of Rasiowa-Sikorski.

An k-noncrossing RNA structure can be identified with an k-noncrossing diagram over [n], which in turn corresponds to a vacillating tableaux having at most (k − 1) rows. In this paper we derive the limit distribution of irreducible substructures via studying their corresponding vacillating tableaux. Our main result proves, that the limit distribution of the numbers of irreducible substructures ...

Gauge fields of mixed symmetry, corresponding to arbitrary representations of the local Lorentz group of the background spacetime, arise as massive modes in compactifications of superstring theories. We describe bosonic gauge field theories on constant curvature spaces whose fields are in irreducible representations of the general linear group corresponding to Young tableaux with two columns. T...

Services now play a remarkably prominent role in modern economies. Not surprisingly, economists and marketing researchers have begun to turn their attention to the analysis of activities in the so-called tertiary sector. In this chapter we attempt to contribute to the effort of systematizing the analysis of service institutions by integrating perspectives from the economic analysis of instituti...

Smullyan wrote his famous book of puzzles before the boom in automated theorem proving. Hence it is interesting, that all the puzzles can be solved with one method or not. The paper shows how this can be done with analytic tableaux.