On transfinite knuth-bendix orders

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

Volumn 6803 LNAI, Issue , 2011, Pages 384-399

  Kovács, Laura ^a   Moser, Georg ^b   Voronkov, Andrei ^c  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF INNSBRUCK   (Austria)

^c UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE SEQUENCE; FINITE SIGNATURES; FIRST-ORDER; KNUTH-BENDIX ORDER; NATURAL NUMBER; THEOREM PROVERS; UPPER BOUND;

AUTOMATION;

EID: 80051686687     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22438-6_29     Document Type: Conference Paper

References (22)

1. Akbarpour, B., Paulson, L.C.: MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions. J. of Automated Reasoning 44(3), 175-205 (2010)
2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
3. Dershowitz, N., Jouannaud, J.P.: Rewrite Systems, pp. 245-319 (1990)
4. Gaillourdet, J.-M., Hillenbrand, T., Löchner, B., Spies, H.: The New Waldmeister Loop at Work. In: Proc. of CADE, pp. 317-321 (2003) (Pubitemid 36940720)
5. Jech, T.: Set Theory. Springer, Heidelberg (2002)
6. Kirby, L., Paris, J.: Accessible Independence Results for Peano Arithmetic. Bulletin London Mathematical Society 4, 285-293 (1982)
7. Korovin, K., Voronkov, A.: Orienting Equalities with the Knuth-Bendix Order. In: Proc. of LICS, pp. 75-84 (2003)
8. Kovacs, L., Voronkov, A.: Finding Loop Invariants for Programs over Arrays Using a Theorem Prover. In: Chechik, M., Wirsing, M. (eds.) FASE 2009. LNCS, vol. 5503, Springer, Heidelberg (2009)
9. Kovács, L., Voronkov, A.: Interpolation and symbol elimination. In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol. 5663, pp. 199-213. Springer, Heidelberg (2009)
10. Löchner, B.: Things to Know when Implementing KBO. J. of Automated Reasoning 36(4), 289-310 (2006) (Pubitemid 46046673)
11. Ludwig, M., Waldmann, U.: An extension of the knuth-bendix ordering with LPOlike properties. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 348-362. Springer, Heidelberg (2007)
12. McCune, B.: Private Communication (September 2004)
13. McCune,W.W.: OTTER 3.0 Reference Manual and Guide. Technical Report ANL-94/6, Argonne National Laboratory (January 1994)
14. Moser, G.: The Hydra Battle and Cichon's Principle. AAECC 20(2), 133-158 (2009)
15. Riazanov, A., Voronkov, A.: The Design and Implementation of Vampire. AI Communications 15(2-3), 91-110 (2002) (Pubitemid 34838658)
16. Schulz, S.: System Description: E 0.81. In: Proc. of IJCAR, pp. 223-228 (2004) (Pubitemid 38939973)
17. Sutcliffe, G.: The CADE-16 ATP System Competition. J. of Automated Reasoning 24(3), 371-396 (2000)
18. Sutcliffe, G.: The TPTP Problem Library and Associated Infrastructure. The FOF and CNF Parts, v3.5.0. J. of Automated Reasoning 43(4), 337-362 (2009)
19. Vampire's homepage, http://www.vprover.org/
20. Weidenbach, C., Schmidt, R.A., Hillenbrand, T., Rusev, R., Topic, D.: System description: spass version 3.0. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 514-520. Springer, Heidelberg (2007) (Pubitemid 47545134)
21. Wos, L.: Milestones for Automated Reasoning with Otter. Int. J. on Artificial Intelligence Tools 15(1), 3-20 (2006) (Pubitemid 43238842)
22. Zankl, H., Hirokawa, N., Middeldorp, A.: KBO orientability. JAR 43(2), 173-201 (2009)