Dershowitz–Manna ordering

Known as: Dershowitz-Manna ordering, Multiset ordering, Multiset orderings 
In mathematics, the Dershowitz–Manna ordering is a well-founded ordering on multisets named after Nachum Dershowitz and Zohar Manna. It is often used… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1975-2016
02419752016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
We present ataxonomic revision of the ‘manna lichens’ based on morphological, chemical, ecological and molecular data. A large… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2012
2012
Multiset orderings are a key ingredient in certain termination techniques like the recursive path ordering and a variant of size… (More)
Is this relevant?
2011
2011
Background: Despite recent progress, therapy for metastatic clear cell renal cell carcinoma (CCRCC) is still inadequate… (More)
  • figure 1
  • table 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Wireless sensor networks (WSNs) are bewming an increasingly important technology that will be used in a variety of applications… (More)
  • figure 2
  • figure 5
Is this relevant?
2003
2003
We identify a new and important global (or non-binary) constraint. This constraint ensures that the values taken by two vectors… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2002
2002
We propose extending constraint solvers with multiset variables. That is, variables whose values are multisets. Such an extension… (More)
Is this relevant?
1996
1996
  • Alfons Geser
  • Applicable Algebra in Engineering, Communication…
  • 1996
We define a strong and versatile termination order for term rewriting systems, called theImproved General Path Order, which… (More)
  • table 2
  • table 3
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We establish some fundamental facts for infinitary orthogonal term rewriting systems (OTRSs): for strongly convergent reductions… (More)
Is this relevant?
1982
1982
 
Is this relevant?
Highly Cited
1979
Highly Cited
1979
A common tool for proving the termination of programs is the <italic>well-founded set</italic>, a set ordered in such a way as to… (More)
Is this relevant?