Dershowitz–Manna ordering is a concept from the field of computer science, particularly in the area of term rewriting systems and automated theorem proving. It is a specific way of defining a lexicographic ordering on terms that can be used to analyze and compare the complexity of problems in rewriting systems. In more detail, Dershowitz–Manna ordering is an extension of the standard lexicographic ordering to a setting where terms may consist of variables and function symbols.
Articles by others on the same topic
There are currently no matching articles.