12 search results - page 2 / 3 » Termination Analysis by Dependency Pairs and Inductive Theor... |
TPHOL
2008
IEEE
14 years 3 days ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
ITP
2010
13 years 9 months ago
2010
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...
LOPSTR
2009
Springer
14 years 8 days ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
JAR
2006
13 years 5 months ago
2006
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
CORR
2006
Springer
13 years 5 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...