RTA 2015 International Conference on Rewriting Techniques and Applications
 |  |
Wall of Fame | Most Viewed RTA-2015 Paper
RTA
2015
Springer
8 years 9 days ago
2015
Springer
Recently it has been observed that the set of all sound linear inference rules in propositional logic is already coNP-complete, i.e. that every boolean tautology can be written as...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 40 | ||
| 2 | | 31 | ||
| 3 | | 25 | ||
| 4 | | 25 | ||
| 5 | | 23 | ||
| 6 | | 23 | ||
| 7 | | 22 | ||
| 8 | | 20 | ||
| 9 | | 18 | ||
| 10 | | 15 | ||
| 11 | | 13 | ||
| 12 | | 11 |