Things to know when implementing KBO

Journal of Automated Reasoning

Volumn 36, Issue 4, 2006, Pages 289-310

  Löchner, Bernd ^a  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

Knuth Bendix ordering; Program transformation

Indexed keywords

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; LINEAR SYSTEMS; OPTIMAL CONTROL SYSTEMS; QUADRATIC PROGRAMMING;

KNUTH-BENDIX ORDERING; PROGRAM TRANSFORMATION; WORST-CASE BEHAVIOR;

COMPUTER PROGRAMMING;

EID: 33846022311     PISSN: 01687433     EISSN: 15730670     Source Type: Journal    
DOI: 10.1007/s10817-006-9031-4     Document Type: Conference Paper

References (15)

1. Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. Journal of the ACM 24(1), 44-67 (1977)
2. Buch, A., Hillenbrand, T.: WALDMEISTER: Development of a High Performance Completion-Based Theorem Prover. SEKI-Report 96-01, Universität Kaiserslautern (1996)
3. Dershowitz, N., Plaisted, D.A.: Rewriting. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, ch. 9. Elsevier (2001)
4. Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Algebra, pp. 263-297. Pergamon (1970)
5. Löchner, B., Hillenbrand, T.: A phytography of WALDMEISTER. AI Commun. 15(2-3), 127-133 (2002). See http://www.waldmeister.org
6. Löchner, B.: Things to know when implementing LPO. Int. J. Artif. Intell. Tools 15(1), 53-79 (2006). A preliminary version appeared. In: Sutcliffe, G., Schulz, S., Tammet, T. (eds.) Proc. 1st Workshop on Empirically Successful First Order Reasoning (ESFOR '04) (2004)
7. Nieuwenhuis, R., Hillenbrand, T., Riazanov, A., Voronkov, A.: On the evaluation of indexing techniques for theorem proving. In: Goré, R., Leitsch, A., Nipkow, T. (eds.) Proc. 1st International Joint Conference on Automated Reasoning, Lecture Notes in Comput. Sci. 2083, pp. 257-271. Springer, Berlin Heidelberg New York (2001)
8. Pettorossi, A., Proietti, M.: Rules and strategies for program transformation. In: Möller, B., Partsch, H., Schuman, S. (eds.) Formal Program Development, vol. 755 of Lecture Notes in Comput. Sci., pp. 263-304. Springer, Berlin Heidelberg New York (1993)
9. Riazanov, A., Voronkov, A.: The design and implementation of VAMPIRE. AI Commun. 15, 91-110 (2002). See http://www.vampire.fm
10. Riazanov, A., Voronkov, A.: Efficient checking of term ordering constraints. In: Basin, D., Rusinowitch, M. (eds.) Proc. 2nd International Joint Conference on Automated Reasoning, LNCS 3097, pp. 60-74. Springer, Berlin Heidelberg New York (2004)
11. Schulz, S.: E - A brainiac theorem prover. AI Commun. 15, 111-126 (2002). See http://www. eprover.org
12. Sutcliffe, G., Suttner, C.B.: The TPTP problem library: CNF release v1.2.1. J. Autom. Reason. 21(2), 177-203 (1998). See http://www.tptp.org
13. Steinbach, J.: Termination of Rewriting. Ph.D. thesis, Universität Kaiserslautern, 1994. See http://www-madlener.informatik.uni-kl.de/seki/1994/ Steinbach.PhDThesis.ps.Z
14. Wadler, P.: Comprehending monads. Math. Struct. Comput. Sci. 2, 461-493 (1992)
15. Weidenbach, C.: Combining superposition, sorts and splitting. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. II, ch. 27. Elsevier (2001)