2410 search results - page 41 / 482 » Multiset Ordering Constraints |
115
click to vote
ACL
1992
15 years 5 months ago
1992
Linear precedence (LP) rules are widely used for stating word order principles. They have been adopted as constraints by HPSG but no encoding in the formalism has been provided. S...
147
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
120
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present Minion, a new constraint solver. Empirical results on standard benchmarks show orders of magnitude performance gains over state-of-the-art constraint toolkits....
136
click to vote
SOFSEM
2007
Springer
15 years 10 months ago
2007
Springer
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...
137
click to vote
DAWAK
2009
Springer
15 years 9 months ago
2009
Springer
Frequent constraint violations on the data stored in a database may suggest that the semantics of the represented reality is changing. In this work we propose a methodology and a t...