Equational problems anddisunification
Journal of Symbolic Computation
Ground reducibility is EXPTIME-complete
Information and Computation
Constructors, sufficient completeness, and deadlock freedom of rewrite theories
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Hi-index | 0.00 |