Sciweavers

478 search results - page 26 / 96
» Context-Sensitive Dependency Pairs
Sort
View
CADE
2001
Springer
16 years 3 days ago
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
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...
Xavier Urbain
SOFSEM
2007
Springer
15 years 5 months ago
Constraints for Argument Filterings
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...
Harald Zankl, Nao Hirokawa, Aart Middeldorp
DEXA
2001
Springer
91views Database» more  DEXA 2001»
15 years 4 months ago
Towards the Development of Heuristics for Automatic Query Expansion
Abstract. In this paper we study the performance of linguisticallymotivated conflation techniques for Information Retrieval in Spanish. In particular, we have studied the applicat...
Jesús Vilares, Manuel Vilares Ferro, Miguel...
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
16 years 1 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
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...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...
SIAMCO
2010
92views more  SIAMCO 2010»
14 years 10 months ago
On the Stabilization of Persistently Excited Linear Systems
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 ...
Yacine Chitour, Mario Sigalotti