34 search results - page 3 / 7 » Dependency Pairs and Polynomial Path Orders |
CORR
2006
Springer
13 years 7 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...
FOSSACS
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
ISAAC
2009
Springer
14 years 1 days ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
DM
2008
13 years 7 months ago
2008
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...