We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
It is well accepted that diagrams play a crucial role in human reasoning. But in mathematics, diagrams are most often only used for visualizations, but it is doubted that diagrams ...
This paper presents new techniques for performing logical operations on type-2 fuzzy sets. These techniques make significant use of geometric methods to give, for the first time, ...