Author:
Korovin Konstantin,Voronkov Andrei
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
2. Bachmair, L.: Associative-commutative reduction orderings. Information Processing Letters 43(1), 21–27 (1992)
3. Lecture Notes in Computer Science;L. Bachmair,1985
4. Cherifa, A.B., Lescanne, P.: Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming 9(2), 137–159 (1987)
5. Dershowitz, N., Hsiang, J., Josephson, A., Plaisted, D.: Associative-commutative rewriting. In: Proc. International Joint Conference on Artificial Intelligence (IJCAI), pp. 940–944 (1983)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. ALASCA: Reasoning in Quantified Linear Arithmetic;Tools and Algorithms for the Construction and Analysis of Systems;2023
2. AC-KBO revisited;Theory and Practice of Logic Programming;2015-06-08
3. AC-KBO Revisited;Functional and Logic Programming;2014
4. Building Theorem Provers;Automated Deduction – CADE-22;2009
5. Chapter 1 Knowledge Representation and Classical Logic;Handbook of Knowledge Representation;2008