68 search results - page 9 / 14 » Automating Termination Proofs for CHR |
84
Voted
LICS
2010
IEEE
14 years 8 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
78
Voted
LICS
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
108
click to vote
ESSLLI
2009
Springer
14 years 8 months ago
2009
Springer
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...
106
Voted
JAR
2010
14 years 5 months ago
2010
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...