Harnessing first order termination provers using higher order dependency pairs (Q3172889)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5954767
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Harnessing first order termination provers using higher order dependency pairs |
scientific article; zbMATH DE number 5954767 |
Statements
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (English)
0 references
7 October 2011
0 references
higher-order rewriting
0 references
termination
0 references
dependency pairs
0 references
modularity
0 references
0 references
0.8353524208068848
0 references
0.7810624837875366
0 references
0.7784767150878906
0 references
0.7758451104164124
0 references
0.7681320309638977
0 references
