Theory path orderings

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

Volumn 1631, Issue , 1999, Pages 148-162

  Stuber, Jürgen ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGEBRAIC THEORIES; ANTI-SYMMETRIC; FUNCTION SYMBOLS; PATH ORDERS; QUASI-ORDERING; REFUTATIONAL COMPLETENESS; SUPERPOSITION THEOREM;

BIOMINERALIZATION;

EID: 84957671518     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48685-2_12     Document Type: Conference Paper

References (14)

1. Baader, F. (1997). Combination of compatible reduction orderings that are total on ground terms. In 12th Ann. IEEE Symp. on Logic in Computer Science, Warsaw, pp. 2-13. IEEE Computer Society Press.
2. Baader, F. and Nipkow, T. (1998). Term rewriting and all that. Cambridge University Press, Cambridge, UK.
3. Bachmair, L. and Plaisted, D. (1985). Termination orderings for associativecommutative rewriting systems. Journal of Symbolic Computation 1: 329-349.
4. Bachmair, L., Ganzinger, H. and Stuber, J. (1995). Combining algebra and universal algebra in first-order theorem proving: The case of commutative rings. In Proc. 10thWorkshop on Specification of Abstract Data Types, Santa Margherita, Italy, LNCS 906, pp. 1-29. Springer.
5. Delor, C. and Puel, L. (1993). Extension of the associative path ordering to a chain of associative commutative symbols. In Proc. 5th Int. Conf. on Rewriting Techniques and Applications, Montreal, LNCS 690, pp. 389-404. Springer.
6. Dershowitz, N. and Hoot, C. (1995). Natural termination. Theoretical Computer Science 142: 179-207.
7. Dershowitz, N. and Jouannaud, J.-P. (1990). Rewrite systems. In J. van Leeuwen (ed.), Handbook of Theoretical Computer Science: Formal Models and Semantics, Vol. B, chapter 6, pp. 243-320. Elsevier/MIT Press.
8. Geser, A. (1996). An improved general path order. Applicable Algebra in Engineering, Communication and Computing 7: 469-511.
9. Kapur, D. and Sivakumar, G. (1997). A total ground path ordering for proving termination of AC-rewrite systems. In Proc. 8th Int. Conf. on Rewriting Techniques and Applications, Sitges, Spain, LNCS 1103, pp. 142-156. Springer.
10. Marché, C. (1996). Normalised rewriting: an alternative to rewriting modulo a set of equations. Journal of Symbolic Computation 21: 253-288.
11. Rubio, A. and Nieuwenhuis, R. (1995). A total AC-compatible ordering based on RPO. Theoretical Computer Science 142: 209-227.
12. Stuber, J. (1998a). Superposition theorem proving for abelian groups represented as integer modules. Theoretical Computer Science 208(1-2): 149-177.
13. Stuber, J. (1998b). Superposition theorem proving for commutative rings. InW. Bibel and P. H. Schmitt (eds), Automated Deduction - A Basis for Applications. Volume III. Applications, chapter 2, pp. 31-55. Kluwer, Dordrecht, The Netherlands.
14. Waldmann, U. (1998). Extending reduction orderings to ACU-compatible reduction orderings. Information Processing Letters 67(1): 43-49.