Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Buchberger's algorithmConfluence (abstract rewriting)Knuth–Bendix completion algorithmOverlap (term rewriting)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Dynamic constraint satisfaction problems over models
In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis… 
2010
2010
Modifying Faug\`ere's F5 Algorithm to ensure termination
The structure of the F5 algorithm to compute Gr\"obner bases makes it very efficient. However, while it is believed to terminate… 
2007
2007
Algebraic High-Level Nets as Weak Adhesive HLR Categories
Adhesive high-level replacement (HLR) systems have been recently introduced as a new categorical framework for double pushout… 
2007
2007
Factor-SAGBI Bases : a Tool for Computations inSubalgebras of Factor AlgebrasPatrik
We introduce canonical bases for subalgebras of quotients of the commutative and non-commutative polynomial ring. A more complete… 
1999
1999
The application of goal-oriented heuristics for prooving equational theorems via the unfailing Knuth-Bendix completion procedure A case study: lattice ordered groups
In this report we present a case study of employing goal-oriented heuristics whenproving equational theorems with the (unfailing… 
1996
1996
Optimal robot localization in trees
The problem of localization, that is, of a robot finding its position on a map, is an important task for autonomous mobile robots… 
1994
1994
Extending Bachmair's Method for Proof by Consistency to the Final Algebra
1989
1989
A method for enumerating cosets of a group presented by a canonical system
The application of rewriting techniques to enumerate cosets of subgroups in groups is investigated. Given a class of groups… 
1988
1988
Positive/Negative Conditional Rewriting
This paper introduces positive/negative conditional term rewriting systems, with rules of the generic form: $$u = v \Lambda u… 
1987
1987
Rule-based geometric modelling
The central task of an interactive Computer Aided Design (CAD) system is the design of geometric objects with a computer… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)