Critical pair (logic)

Known as: Critical pair, Critical pair (term rewriting), Critical pair lemma 
In mathematical logic, a critical pair arises in term rewriting systems where rewrite rules overlap to yield two different terms. For example, in the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A mechanical proof of the Knuth–Bendix Critical Pair Theorem in the higher-order language of the theorem prover PVS is described… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
A simple and accurate reverse phase liquid chromatographic method was developed for the determination of related substance and… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Software product lines (SPL) are an established technology for developing families of systems. In particular, they focus on… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Considerations of weight factors and far-end faults in the directional overcurrent relay coordination problem formulation do not… (More)
  • figure 1
  • figure 2
  • table I
  • table V
  • table VI
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper introduces a new efficient algorithm for computin g Gröbner bases. We replace the Buchberger criteria by an optimal… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper introduces a new efficient algorithm for computing Gröbner bases. We replace the Buchberger criteria by an optimal… (More)
Is this relevant?
2000
2000
A good introduction to string rewriting is [2], and a recent introduction to noncommutative Gröbner basis theory is [12… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class… (More)
  • figure 1
Is this relevant?
1996
1996
We present a new criterion for connuence of (possibly) non-terminating left-linear term rewriting systems. The criterion is based… (More)
Is this relevant?
1995
1995
The class of orthogonal rewriting systems (rewriting systems where rewrite steps cannot depend on one another) is the main class… (More)
Is this relevant?