Ordering constraints on trees

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

Volumn 787 LNCS, Issue , 1994, Pages 1-14

  Comon, Hubert ^a   Treinen, Ralf ^b  

^a CNRS   (France)

^b GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

LEXICOGRAPHIC PATH ORDERING; NEW RESULTS; ORDERING CONSTRAINTS; RECURSIVE PATH ORDERING; UNDECIDABILITY;

FORESTRY;

EID: 85010952507     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0017470     Document Type: Conference Paper

References (26)

1. L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic paramodulation and superposition. In D. Kapur, editor, Proc. 11th Int. Conf. on Automated Deduction, Saratoga Springs, NY, Lecture Notes in Computer Science, vol. 607, pages 462-476. Springer-Verlag, June 1992.
2. A. Boudet and H. Comon. About the theory of tree embedding. In M. C. Gaudel and J.-P. Jouannaud, editors, Proc. Int. Joint Conf. on Theory and Practice of Software Development, Lecture Notes in Computer Science, vol. 668, pages 376390, Orsay, France, Apr. 1993. Springer-Verlag.
3. A.-C. Caron, J.-L. Coquidé, and M. Dauchet. Encompassment properties and automata with constraints. In C. Kirchner, editor, Proc. 5th. Int. Conf. on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 690, pages 328-342, Montreal, Canada, 1993. Springer-Verlag.
4. H. Comon. Equational formulas in order-sorted algebras. In Proc. 17th Int. Coll. on Automata, Languages and Programming, Warwick, Lecture Notes in Computer Science, vol. 443, pages 674-688, Warwick, July 1990. Springer-Verlag.
5. H. Comon. Solving symbolic ordering constraints. International Journal of Foundations of Computer Science, 1(4):387-411, 1990.
6. H. Comon. Disunification: a survey. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, pages 322-359. MIT Press, 1991.
7. H. Comon. Constraints in term algebras (short survey). In T. R. M. Nivat, C. Rattray and G. Scollo, editors, Proc. Conf. on Algebraic Methodology and Software Technology, Univ. of Twente, 1993. Springer Verlag, series Workshop in Computing. Invited talk.
8. H. Comon and R. Treinen. The first-order theory of lexicographic path orderings is undecidable. Research Report RR-93-42, Deutsches Forschungszentrum für Künstliche Intelligenz, Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, Sept. 1993. Anonymous ftp from duck.dfki.uni-sb.de:/pub/ccl/diki-saarbruecken.
9. N. Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17(3):279—301, Mar. 1982.
10. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243-309. North-Holland, 1990.
11. J. Hsiang and M. Rusinowitch. On word problems in equational theories. In Proc. in 14th ICALP Karlsruhe, July 1987.
12. J.-P. Jouannaud and C. Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, pages 257-321. MIT-Press, 1991.
13. J.-P. Jouannaud and M. Okada. Satisfiability of systems of ordinal notations with the subterm property is decidable. In Proc. 18th Int. Coll. on Automata, Languages and Programming, Madrid, Lecture Notes in Computer Science, vol. 510, pages 455-468, 1991. Springer-Verlag.
14. S. Kamin and J.-J. Levy. Two generalizations of the recursive path ordering. Available as a report of the department of computer science, University of Illinois at Urbana-Champaign, 1980.
15. C. Kirchner, H. Kirchner, and M. Rusinowitch. Deduction with symbolic constraints. Revue Française d’Intelligenc.e Artificielle, 4(3):9-52, 1990. Special issue on automatic deduction.
16. D. E. Knuth and P. B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263-297. Pergamon Press, 1970.
17. P. Narendran and M. Rusinowitch. Any ground associative-commutative theory has a finite canonical system. In R. V. Book, editor, Proc. 4th Rewriting Techniques and Applications, Como, Lecture Notes in Computer Science, vol. 488, pages 423434. Springer-Verlag, Apr. 1991.
18. R. Nieuwenhuis. Simple LPO constraint solving methods. Inf. Process. Lett., 47:65-69, Aug. 1993.
19. R. Nieuwenhuis and A. Rubio. Basic superposition is complete. In B. Krieg-Bruckner, editor, Proc. European Symp. on Programming, Lecture Notes in Computer-Science, vol. 582, pages 371-389, Rennes, 1992. Springer-Verlag.
20. R. Nieuwenhuis and A. Rubio. Theorem proving with ordering constrained clauses. In D. Kapur, editor, Proc. 11th Int. Conf. on Automated Deduction, Saratoga Springs, NY, Lecture Notes in Computer Science, vol. 607, pages 477-491. Springer-Verlatg, June 1992.
21. R. Nieuwenhuis and A. Rubio. A precedence-based total AC-compatible ordering. In C. Kirchner, editor, Proc. 5th Rewriting Techniques and Applications, Montreal, Lecture Notes in Computer Science, vol. 690, pages 374-388. Springer-Verlag, June 1993.
22. D. Plaisted. Semantic confluence tests and completion methods. Information and Control, 65:182-215, 1985.
23. W. V. Quine. Concatenation as a basis for arithmetic. Journal of Symbolic Logic, 11(4), 1946.
24. R. Treinen. A new method for undecidability proofs of first order theories. Journal of Symbolic Computation, 14(5):437-458, Nov. 1992.
25. S. Tulipani. Decidability of the existential theory of infinite terms with subterm relation. To appear in Information and Computation, 1994.
26. K. N. Venkataraman. Decidability of the purely existential fragment of the theory of term algebras. J. ACM, 34(2):492-510, 1987.