103 search results - page 21 / 21 » Polygraphs for termination of left-linear term rewriting sys... |
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
104
click to vote
PODS
2010
ACM
15 years 4 months ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
LDTA
2010
14 years 11 months ago
2010
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...