L O ] 17 M ay 2 00 6 SAT Solving for Argument Filterings ?

@inproceedings{CodishLO,
  title={L O ] 17 M ay 2 00 6 SAT Solving for Argument Filterings ?},
  author={Michael Codish and Peter Schneider Kamp and Vitaly Lagoon and Eric Thiemann and Jir{\'i} Giesl}
}
This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for termination analysis of term rewrite systems based on the dependency pair method. We address two main inter-related issues and encode them as satis ability problems of propositional formulas… CONTINUE READING