Proc. of the first international conference on Rewriting techniques and applications
Equational methods in first order predicate calculus
Journal of Symbolic Computation
Journal of Symbolic Computation
Termination orderings for associative-commutative rewriting systems
Journal of Symbolic Computation
An algebraic approach to unification under associativity and commutativity
Journal of Symbolic Computation
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Tree-Manipulating Systems and Church-Rosser Theorems
Journal of the ACM (JACM)
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Journal of the ACM (JACM)
Testing for the Church-Rosser Property
Journal of the ACM (JACM)
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
A Unification Algorithm for Associative-Commutative Functions
Journal of the ACM (JACM)
Confluent and Other Types of Thue Systems
Journal of the ACM (JACM)
Proving termination with multiset orderings
Communications of the ACM
On proving inductive properties of abstract data types
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Groebner Bases for Non-Commutative Polynomial Rings
AAECC-3 Proceedings of the 3rd International Conference on Algebraic Algorithms and Error-Correcting Codes
Incremental Construction of Unification Algorithms in Equational Theories
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Rewrite Methods for Clausal and Non-Clausal Theorem Proving
Proceedings of the 10th Colloquium on Automata, Languages and Programming
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
A criterion for detecting unnecessary reductions in the construction of Groebner bases
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
A Primer: 11 Keys to New Scratchpad
EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
Upper and Lower Bounds for the Degree of Groebner Bases
EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
On the Complexity of the Groebner-Bases Algorithm over K[x, y, z]
EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
Some Effectivity Problems in Polynomial Ideal Theory
EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
Rewrite Rule Theory and Abstract Data Type Analysis
EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
An Algorithm to Compute the Equations of Tangent Cones
EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
The Construction of Multivariate Polynomials with Preassigned Zeros
EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
A Theorem-Proving Approach to the Knuth-Bendix Completion Algorithm
EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
Commutative Algebra and Computer Algebra
EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
An algorithm for constructing detaching bases in the ring of polynominals over a field
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
The computation of the Hilbert function
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
A note on the complexity of constructing Gröbner-Bases
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
Constructions: A Higher Order Proof System for Mechanizing Mathematics
EUROCAL '85 Invited Lectures from the European Conference on Computer Algebra-Volume I - Volume I
Term Reduction Systems and Algebraic Algorithms
GWAI '81 Proceedings of the German Workshop on Artificial Intelligence
A critical-pair/completion algorithm for finitely generated ideals in rings
Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
Equivalence relations, invariants, and normal forms
Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
How to Prove Algebraic Inductive Hypotheses Without Induction
Proceedings of the 5th Conference on Automated Deduction
The Power of the Church-Rosser Property for String Rewriting Systems
Proceedings of the 6th Conference on Automated Deduction
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Complete Sets of Unifiers and Matchers in Equational Theories
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Termination of a Set of Rules Modulo a Set of Equations
Proceedings of the 7th International Conference on Automated Deduction
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Canonical representatives for residue classes of a polynomial ideal
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
A short survey on the state of the art in matching and unification problems
ACM SIGSAM Bulletin
A simplified proof of the characterization theorem for Gröbner-bases
ACM SIGSAM Bulletin
Abstract Data Type Specification in the Affirm System
IEEE Transactions on Software Engineering
Orderings for term-rewriting systems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Decomposition ordering at a tool to prove the termination of rewriting systems
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
A complete unification algorithm for associative-commutative functions
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Journal of Symbolic Computation
On equational theories, unification, and (Un)decidability
Journal of Symbolic Computation
Automated proof of ring commutativity problems by algebraic methods
Journal of Symbolic Computation
Dominance range-query: the one-reporting case
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Z-module reasoning: an equality-oriented proving method with built-in ring axioms
Journal of the ACM (JACM)
Automated Software Engineering
Declarative Representation of Algorithms of Completion by Critical Pairs
Cybernetics and Systems Analysis
Abstract canonical presentations
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Gröbner-Shirshov bases for the non-symmetric operads of dendriform algebras and quadri-algebras
Journal of Symbolic Computation
| Hi-index | 0.00 |
A synopsis of the critical-pair/completion approach for solving algorithmic problems in theorem proving, finitely generated algebras and rewrite systems is given. The emphasis is on tracing the main intuition behind the approach, which consists in considering ''critical pairs''. These are the ''first possible'' situations where ''superpositions'' may occur. Extensive references to the original literature are provided. Some directions for future research are outlined. The presentation is biased towards the development of the approach in algorithmic polynomial ideal theory.