KBO orientability

Journal of Automated Reasoning

Volumn 43, Issue 2, 2009, Pages 173-201

  Zankl, Harald ^a   Hirokawa, Nao ^b   Middeldorp, Aart ^a  

^a UNIVERSITY OF INNSBRUCK   (Austria)

^b JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Knuth Bendix order; Term rewriting; Termination

Indexed keywords

DEPENDENCY PAIRS; ENCODINGS; KNUTH-BENDIX ORDER; LINEAR ARITHMETIC; NEW APPROACHES; ORIENTABILITY; PROPOSITIONAL LOGIC; REWRITE SYSTEMS; SATISFIABILITY; SATISFYING ASSIGNMENTS; TERM REWRITING; UPPER BOUND; WEIGHT FUNCTIONS;

FUNCTION EVALUATION;

EID: 72449200655     PISSN: 01687433     EISSN: 15730670     Source Type: Journal    
DOI: 10.1007/s10817-009-9131-z     Document Type: Article

References (43)

1. T Arts J Giesl 2000 Termination of term rewriting using dependency pairs Theor. Comput. Sci. 236 1-2 133 178 0938.68051 10.1016/S0304-3975(99)00207-8 1759734
2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
3. Codish, M., Lagoon, V., Stuckey, P.: Solving partial order constraints for LPO termination. In: Proc. 17th International Conference on Rewriting Techniques and Applications. LNCS, vol. 4098, pp. 4-18 (2006)
4. Codish, M., Schneider-Kamp, P., Lagoon, V., Thiemann, R., Giesl, J.: SAT solving for argument filterings. In: Proc. 13th International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LNAI, vol. 4246, pp. 30-44 (2006)
5. Danzig, G.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)
6. Dershowitz, N.: Termination by abstraction. In: Proc. 20th International Conference on Logic Programming. LNCS, vol. 3132, pp. 1-18 (2004)
7. J Dick J Kalmus U Martin 1990 Automating the Knuth-Bendix ordering Acta Inform. 28 95 119 0715.68044 10.1007/BF01237233 1089685
8. Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Proc. 18th International Conference on Computer Aided Verification. LNCS, vol. 4144, pp. 81-94 (2006)
9. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Proc. 6th International Conference on Theory and Applications of Satisfiability Testing. LNCS, vol. 2919, pp. 502-518 (2004)
10. N Eén N Sörensson 2006 Translating pseudo-boolean constraints into SAT J. Satisfiab Boolean Model Comput. 2 1 26 1116.68083
11. J Endrullis J Waldmann H Zantema 2008 Matrix interpretations for proving termination of term rewriting J. Autom. Reason. 40 2-3 195 220 1139.68049 10.1007/s10817-007-9087-9 2418646
12. Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: SAT solving for termination analysis with polynomial interpretations. In: Proc. 10th International Conference on Theory and Applications of Satisfiability Testing. LNCS, vol. 4501, pp. 340-354 (2007)
13. Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: Maximal termination. In: Proc. 19th International Conference on Rewriting Techniques and Applications. LNCS, vol. 5117, pp. 110-125 (2008)
14. Fuhs, C., Navarro-Marset, R., Otto, C., Giesl, J., Lucas, S., Schneider-Kamp, P.: Search techniques for rational polynomial orders. In: Proc. 9th International Conference on Artificial Intelligence and Symbolic Computation. LNAI, vol. 5144, pp. 109-124 (2008)
15. Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: Automatic termination proofs in the dependency pair framework. In: Proc. 3rd International Joint Conference on Automated Reasoning. LNAI, vol. 4130, pp. 281-286 (2006)
16. Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: combining techniques for automated termination proofs. In: Proc. 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning. LNAI, vol. 3452, pp. 301-331 (2005)
17. Giesl, J., Thiemann, R., Schneider-Kamp, P.: Proving and disproving termination of higher-order functions. In: Proc. 5th International Workshop on Frontiers of Combining Systems. LNAI, vol. 3717, pp. 216-231 (2005)
18. J Giesl R Thiemann P Schneider-Kamp S Falke 2006 Mechanizing and improving dependency pairs J. Autom. Reason. 37 3 155 203 1113.68088 10.1007/s10817-006-9057-7 2295127 (Pubitemid 46181594)
19. N Hirokawa A Middeldorp 2005 Automating the dependency pair method Inf. Comput. 199 1-2 172 199 1081.68038 10.1016/j.ic.2004.10.004 2146429 (Pubitemid 40773678)
20. N Hirokawa A Middeldorp 2007 Tyrolean termination tool: techniques and features Inf. Comput. 205 4 474 511 1111.68048 10.1016/j.ic.2006.08.010 2311937 (Pubitemid 46386379)
21. Hofbauer, D., Lautemann, C.: Termination proofs and the length of derivations (preliminary version). In: Proc. 3rd International Conference on Rewriting Techniques and Applications. LNCS, vol. 355, pp. 167-177 (1989)
22. N Karmarkar 1984 A new polynomial-time algorithm for linear programming Combinatorica 4 373 395 0557.90065 10.1007/BF02579150 779900
23. L Khachiyan 1979 A polynomial algorithm in linear programming Dokl. Akad. Nauk SSSR 244 1093 1096 0414.90086 522052
24. Knuth, D., Bendix, P.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263-297. Pergamon, Oxford (1970)
25. Koprowski, A., Middeldorp, A.: Predictive labeling with dependency pairs using SAT. In: Proc. 21st International Conference on Automated Deduction. LNAI, vol. 4603, pp. 410-425 (2004)
26. Koprowski, A., Waldmann, J.: Arctic termination. below zero. In: Proc. 19th International Conference on Rewriting Techniques and Applications. LNCS, vol. 5117, pp. 202-216 (2008)
27. K Korovin A Voronkov 2003 Orienting rewrite rules with the Knuth-Bendix order Inf. Comput. 183 165 186 1054.68079 10.1016/S0890-5401(03)00021-X 1995043
28. Kurihara, M., Kondo, H.: Efficient BDD encodings for partial order constraints with application to expert systems in software verification. In: Proc. 17th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems. LNAI, vol. 3029, pp. 827-837 (2004)
29. Lankford, D.: On proving term rewrite systems are noetherian. Tech. Rep. MTP-3, Louisiana Technical University, Ruston, LA, USA (1979)
30. I Lepper 2001 Derivation lengths and order types of Knuth-Bendix orders Theor. Comput. Sci. 269 1-2 433 450 0983.68087 10.1016/S0304-3975(01)00015-9 1862419 (Pubitemid 32975765)
31. Marché, C.: Termination problems data base (TPDB), version 4.0. http://www.lri.fr/~marche/tpdb (2007)
32. Moser, G.: Derivational complexity of Knuth-Bendix orders revisited. In: Proc. 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning. LNAI, vol. 4246, pp. 75-89 (2006)
33. D Plaisted S Greenbaum 1986 A structure-preserving clause form translation J. Symb. Comput. 2 3 293 304 0636.68119 10.1016/S0747-7171(86)80028- 1 860540
34. H Sato M Kurihara 2006 Implementation and performance evaluation of multi-completion procedures for term rewriting systems with recursive path orderings with status IEICE Trans. Inf. Syst. J89-D 4 624 631 in Japanese
35. Schneider-Kamp, P., Thiemann, R., Annov, E., Codish, M., Giesl, J.: Proving termination using recursive path orders and SAT solving. In: Proc. 6th International Symposium on Frontiers of Combining Systems. LNAI, vol. 4720, pp. 267-282 (2007)
36. Steinbach, J.: Extensions and comparison of simplification orders. In: Proc. 3rd International Conference on Rewriting Techniques and Applications. LNCS, vol. 355, pp. 434-448 (1989)
37. Tseitin, G.: On the complexity of derivation in propositional calculus. In: Studies in Constructive Mathematics and Mathematical Logic, Part 2, pp. 115-125 (1968)
38. A Weiermann 1995 Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths Theor. Comput. Sci. 139 1-2 355 362 0874.68156 10.1016/0304-3975(94)00135-6 1320245
39. Zankl, H.: BDD and SAT techniques for precedence based orders. Master's thesis, University of Innsbruck (2006)
40. Zankl, H., Hirokawa, N., Middeldorp, A.: Constraints for argument filterings. In: Proc. 33rd International Conference on Current Trends in Theory and Practice of Computer Science. LNCS, vol. 4362, pp. 579-590 (2007)
41. Zankl, H., Middeldorp, A.: Satisfying KBO constraints. In: Proc. 18th International Conference on Rewriting Techniques and Applications. LNCS, vol. 4533, pp. 389-403 (2007)
42. Zankl, H., Middeldorp, A.: Increasing interpretations. In: Proc. 9th International Conference on Artificial Intelligence and Symbolic Computation. LNAI, vol. 5144, pp. 191-205 (2008)
43. Zantema, H., Waldmann, J.: Termination by quasi-periodic interpretations. In: Proc. 18th International Conference on Rewriting Techniques and Applications. LNCS, vol. 4533, pp. 404-418 (2007)