An extension of the Knuth-Bendix ordering with LPO-like properties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4790 LNAI, Issue , 2007, Pages 348-362

  Ludwig, Michel ^a   Waldmann, Uwe ^b  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MOTION PLANNING; NATURAL LANGUAGE PROCESSING SYSTEMS; PROBLEM SOLVING;

HIERARCHIC SUPERPOSITION CALCULI; KNUTH-BENDIX ORDERING;

HIERARCHICAL SYSTEMS;

EID: 38149004264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75560-9_26     Document Type: Conference Paper

References (17)

1. Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, New York (1998)
2. Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation 4(3), 217-247 (1994)
3. Bachmair, L., Ganzinger, H., Waldmann, U.: Refutational theorem proving for hierarchic first-order theories. Applicable Algebra in Engineering, Communication and Computing (AAECC) 5(3/4), 193-212 (1994)
4. Dick, J., Kalmus, J., Martin, U.: Automating the Knuth-Bendix ordering. Acta Informatica 28(2), 95-119 (1990)
5. Fernández, M.-L., Godoy, G., Rubio, A.: Recursive path orderings can also be incremental. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 230-245, Springer, Heidelberg (2005)
6. Ganzinger, H., Sofronie-Stokkermans, V., Waldmann, U.: Modular proof systems for partial functions with Evans equality. Information and Computation 204, 1453-1492 (2006)
7. Hessenberg, G.: Grundbegriffe der Mengenlehre. Vandenhoeck & Ruprecht, Göttingen (1906)
8. Hillenbrand, T., Weidenbach, C.: Superposition for finite domains. Research Report MPI-I-2007-RG1-002, Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany (April 2007)
9. Just, W., Weese, M.: Discovering modern set theory. I: The Basics, Graduate Studies in Mathematics, vol. 8. American Mathematical Society (1996)
10. Kamin, S., Lévy, J.-J.: Attempts for generalising the recursive path orderings. Manuscript Department of Computer Science, University of Illinois, Urbana-Champaign (1980), available at http://perso.ens-lyon.fr/pierre. lescanne/not-accessible.html
11. Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263-297. Pergamon Press, Oxford (1970)
12. Löchner, B.: Things to know when implementing KBO. Journal of Automated Reasoning 36, 289-310 (2006)
13. Ludwig, M.: Extensions of the Knuth-Bendix ordering with LPO-like properties. Diploma thesis, Universität des Saarlandes, Saarbrücken, Germany (July 2006)
14. McCune, W.: Otter 3.3 Reference Manual. Argonne National Laboratory, Argonne, IL, USA, Technical Memorandum No. 263 (August 2003)
15. Prevosto, V., Waldmann, U.: SPASS+T. In: Sutcliffe, G., Schmidt, R., Schulz, S. (eds.) ESCoR: FLoC 2006 Workshop on Empirically Successful Computerized Reasoning, Seattle, WA, USA. CEUR Workshop Proceedings, vol. 192, pp. 18-33 (August 2006)
16. Riazanov, A., Voronkov, A.: The design and implementation of Vampire. AI Communications 15, 91-110 (2002)
17. Weidenbach, C., Brahm, U., Hillenbrand, T., Keen, E., Theobalt, C., Topić, D.: SPASS version 2.0. In: Voronkov, A. (ed.) CADE-18. LNCS (LNAI), vol. 2392, pp. 275-279. Springer, Heidelberg (2002)