| Title |
Relative Termination via Dependency Pairs
|
|---|---|
| Published in |
Journal of Automated Reasoning, April 2016
|
| DOI | 10.1007/s10817-016-9373-5 |
| Pubmed ID | |
| Authors |
José Iborra, Naoki Nishida, Germán Vidal, Akihisa Yamada |
| Abstract |
A term rewrite system is terminating when no infinite reduction sequences are possible. Relative termination generalizes termination by permitting infinite reductions as long as some distinguished rules are not applied infinitely many times. Relative termination is thus a fundamental notion that has been used in a number of different contexts, like analyzing the confluence of rewrite systems or the termination of narrowing. In this work, we introduce a novel technique to prove relative termination by reducing it to dependency pair problems. To the best of our knowledge, this is the first significant contribution to Problem #106 of the RTA List of Open Problems. We first present a general approach that is then instantiated to provide a concrete technique for proving relative termination. The practical significance of our method is illustrated by means of an experimental evaluation. |
X Demographics
The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Unknown | 1 | 100% |
Demographic breakdown
| Type | Count | As % |
|---|---|---|
| Members of the public | 1 | 100% |
Mendeley readers
The data shown below were compiled from readership statistics for 7 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Unknown | 7 | 100% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Professor | 2 | 29% |
| Other | 1 | 14% |
| Student > Doctoral Student | 1 | 14% |
| Student > Ph. D. Student | 1 | 14% |
| Student > Master | 1 | 14% |
| Other | 1 | 14% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 4 | 57% |
| Mathematics | 1 | 14% |
| Engineering | 1 | 14% |
| Unknown | 1 | 14% |
Attention Score in Context
This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 05 May 2016.
All research outputs
#20,950,527
of 25,732,188 outputs
Outputs from Journal of Automated Reasoning
#125
of 161 outputs
Outputs of similar age
#233,523
of 313,013 outputs
Outputs of similar age from Journal of Automated Reasoning
#2
of 3 outputs
Altmetric has tracked 25,732,188 research outputs across all sources so far. This one is in the 10th percentile – i.e., 10% of other outputs scored the same or lower than it.
So far Altmetric has tracked 161 research outputs from this source. They receive a mean Attention Score of 2.6. This one is in the 9th percentile – i.e., 9% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 313,013 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 13th percentile – i.e., 13% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 3 others from the same source and published within six weeks on either side of this one.