Controlled natural languages (CNL) and computational semantics in general do not address word sense disambiguation, i.e., they tend to interpret only some functional words that are...
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show t...
The theory of the point and double groups has been widely used in quantum physics to understand the structure and dynamical properties of molecules and solids. In order to constru...
The aim of this article is to link Schubert varieties in the flag manifold with hyperplane arrangements. For a permutation, we construct a certain graphical hyperplane arrangement....
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...