3970 search results - page 524 / 794 » A Logic For Causal Reasoning |
158
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
193
Voted
CADE
2009
Springer
16 years 7 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
202
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
163
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...
157
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. This paper describes the translation of proofs in the Thousands of Solutions from Theorem Provers (TSTP) solution library to the Proof Markup Language (PML), and the subs...