195
click to vote
RTA
16 years 1 days ago
2004 Springer 
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
193
click to vote
RTA
16 years 1 days ago
2004 Springer 
Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
192
Voted
RTA
16 years 1 days ago
2004 Springer 
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
185
click to vote
RTA
16 years 1 days ago
2004 Springer 
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of su...
178
click to vote
RTA
16 years 1 days ago
2004 Springer 
We describe the system AProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient al...
|
Theoretical Computer Science