Simple LPO constraint solving methods
Information Processing Letters
Journal of Automated Reasoning
Solved Forms for Path Ordering Constraints
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Ordered Rewriting and Confluence
Proceedings of the 10th International Conference on Automated Deduction
System Description: Waldmeister - Improvements in Performance and Ease of Use
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Decision Problems in Ordered Rewriting
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
AI Communications - CASC
| Hi-index | 0.00 |
Redundancy elimination is a key feature for the efficiency of saturation based theorem provers. Ground joinability is a good candidate for a redundancy criterion but is rarely used in practice since the available algorithms are not believed to have a good cost-benefit ratio. In order to have a framework for the evaluation and the design of new methods for testing ground joinability we developed the system CCE.