scientific article; zbMATH DE number 1456949

MaRDI QIDQ4954438zbMATH OpenFDO

Authors Hubert Comon, Ralf Treinen

Publication date 7 June 2000

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1696827
• The first-order theory of lexicographic path orderings is undecidable
• Practical algorithms for deciding path ordering constraint satisfaction.
• SOLVING SYMBOLIC ORDERING CONSTRAINTS

Cited in

(14)

• Combining tree partitioning, precedence, and incomparability constraints
• Generating ordered trees
• Combination of constraint solvers for free and quasi-free structures
• Optimal binary trees with order constraints
• The first-order theory of lexicographic path orderings is undecidable
• Practical algorithms for deciding path ordering constraint satisfaction.
• Orienting rewrite rules with the Knuth-Bendix order.
• Ordered trees and the inorder traversal
• Efficient Chaining of Seeds in Ordered Trees
• Theories of orders on the set of words
• Defining recursive predicates in graph orders
• Combination of constraint solving techniques: An algebraic point of view
• Solving simplification ordering constraints
• Binary Trees and (Maximal) Order Types

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4954438)