The aim of this paper is to show how to simply define paraconsistent tableaus by liberalization of construction of complete tableaus. The presented notions allow us to list all tableau inconsistencies that appear in a complete tableau. Then we can easily choose these inconsistencies that are effects of interactions between premises and a conclusion, simultaneously excluding other inconsistencie...

In this paper we apply the methodology of Labelled Deductive Systems to the tableau method in order to obtain a deductive framework for substructural logics which incorporates the facility of model generation. For this special purpose, we propose new labelled tableau calculi TL and TLe for two substructural logics L (essentially the Lambek calculus) and Le (the multiplicative fragment of intuit...

Workflow management systems (WfMSs) are useful tools for supporting enterprise information systems. Such systems must ensure compliance with guidelines and regulations. While formal verification techniques can be used in the development stages to help ensure behavioral properties of many systems, these techniques are generally not available in workflow tools. We present a framework which models...

Let us consider a sequence of formulas providing partial information about an initial situation, about a set of events occurring sequentially in this situation, and about the resulting situation after the occurrence of each event. From this whole sequence, we want to infer more information, either about the initial situation, or about one of the events, or about the resulting situation after on...

Let T ∗ be a standard Young tableau of k cells. We show that the probability that a Young tableau of n cells contains T ∗ as a subtableau is, in the limit n → ∞, equal to ν(π(T ∗))/k!, where π(T ∗) is the shape (= Ferrers diagram) of T ∗ and ν(π) is the number of all tableaux of shape π. In other words, the probability that a large tableau contains T ∗ is equal to the number of tableaux whose s...

Let μ be a partition of k, and T a standard Young tableau of shape μ. McKay, Morse, and Wilf show that the probability a randomly chosen Young tableau of N cells contains T as a subtableau is asymptotic to fμ/k! as N goes to infinity, where fμ is the number of all tableaux of shape μ. We use a random-walk argument to show that the analogous asymptotic probability for randomly chosen Young table...

I present an analytic tableau system for a small fragment of natural language called RC. RC is an extension of the classical Aristotelian syllogisms (“All computer-scientists are mathematicians”) to include relations in the form of transitive verbs (“All who hate all logic programmers know some who hate all proof theoreticians”) and to permit the negation of nouns (“Some non-linguists love all ...

Let T be a standard Young tableau of shape λ ` k. We show that the probability that a randomly chosen Young tableau of n cells contains T as a subtableau is, in the limit n → ∞, equal to f/k!, where f is the number of all tableaux of shape λ. In other words, the probability that a large tableau contains T is equal to the number of tableaux whose shape is that of T , divided by k!. We give sever...

Let X, Y be finite sets and T a set of functions from X → Y which we will call “tableaux”. We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such tableau complexes have many nice properties, and are frequently homeomorphic to balls, which we prove using vertex decompositions [BP79]. In our motivating example, the facets are labeled by semistan...

In this paper, we briefly present three different approaches at examining the relation between tableaus and automata, and possibly combining their advantages in the context of testing satisfiability of description logic concepts. The first approach tries to transfer the efficiency of tableaus to automata by performing the automata emptiness test with a tableau algorithm. The second one examines...