478 search results - page 10 / 96 » Context-Sensitive Dependency Pairs |
104
click to vote
CADE
2009
Springer
16 years 10 days ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
AGP
1998
IEEE
15 years 4 months ago
1998
IEEE
The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitabl...
CADE
2001
Springer
15 years 4 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
VLDB
2007
ACM
15 years 5 months ago
2007
ACM
Real-world datasets exhibit a complex dependency structure among the data attributes. Learning this structure is a key task in automatic statistics configuration for query optimi...
ENTCS
2007
14 years 11 months ago
2007
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...