The confluence of ground term rewrite systems is decidable in polynomial time

التفاصيل البيبلوغرافية
العنوان: The confluence of ground term rewrite systems is decidable in polynomial time
المؤلفون: Comon, H., Godoy, G., Nieuwenhuis, R.
المصدر: Proceedings 42nd IEEE Symposium on Foundations of Computer Science Cluster Computing, 2001. Proceedings. 2001 IEEE International Conference on. :298-307 2001
Relation: Proceedings 42nd IEEE Symposium on Foundations of Computer Science
قاعدة البيانات: IEEE Xplore Digital Library
الوصف
ردمك:0769513905
9780769513904
تدمد:15525244
DOI:10.1109/SFCS.2001.959904