Replies: 5 comments 21 replies
-
|
A slightly belated response, but I'm looking forward to the introduction of probabilistic categories into the termination competition!
All in all, I propose the following scoring: MAYBE < AST < PAST < SAST < POLY < O(n^Nat) < O(1) where POLY, O(n^Nat), and O(1) is as in the complexity category and denotes the expected derivational complexity. |
Beta Was this translation helpful? Give feedback.
-
|
Some comments on the questions discussed above:
|
Beta Was this translation helpful? Give feedback.
-
|
Okay, so the original proposal, but without points for YES, seems to be okay for everybody, and we should try to keep surely terminating PTRSs out of the TPDB. Closed. |
Beta Was this translation helpful? Give feedback.
-
|
I'm currently looking at the code that computes the scoring.
As far as I can tell, that's not the scoring that has been used in the past. That can also easily be seen from the fact that the scores weren't integral (see, e.g., here at the bottom of the page). Instead, the following scoring scheme has been used:
Presumably, all complexity categories are going to be demo categories anyway, and we'll have to re-implement everything next year as StarExec gets discontinued, so I'm not going to change that. However, that means that the score of one solver is currently independent of the scores of all others, and changing that would require major changes of the StarExec presenter. Hence, I'd like to propose a different scoring scheme: AST: Or, alternatively: AST: for some positive constant |
Beta Was this translation helpful? Give feedback.
-
|
The current format for PTRSs is slightly different from the proposal above. The reason is that @J-C-Kassing and I agreed that specifying the probabilities with
corresponds to passing an argument called so that we'd have |
Beta Was this translation helpful? Give feedback.
Uh oh!
There was an error while loading. Please reload this page.
-
We plan to introduce new categories for termination of probabilistic term rewriting. Please let us know what you think about the following proposal by the termCOMP SC.
Rewrite Strategy
The idea is to have two categories, one for innermost and one for full rewriting.
Valid Results
The tools can give the following answers:
This reflects the current state of the art, since no tool can currently disprove (P/S)AST. We can allow other results in the future, if needed.
The reason for distinguishing PAST and SAST is that there are examples that are PAST and not SAST, and probably there will be techniques by next summer which prove PAST without proving SAST.
Scoring
The scoring should be as in the complexity categories: If
ktools participate, then the tool with the best result getskpoints, the tool with the second best result getsk-1points, etc. Here, the order is:MAYBE < AST < PAST < SAST < YES
Tools with the result MAYBE do not get any points.
Format
The format should be a variant of the ARI format (which should also be used for the other TRS categories in the future):
Here is an example:
Beta Was this translation helpful? Give feedback.
All reactions