We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
Abstract. In this paper we study the performance of linguisticallymotivated conflation techniques for Information Retrieval in Spanish. In particular, we have studied the applicat...
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
We consider control systems of the type ˙x = Ax+α(t)bu, where u ∈ R, (A, b) is a controllable pair and α is an unknown time-varying signal with values in [0, 1] satisfying a ...