A Categorical Critical-pair Completion Algorithm

  title={A Categorical Critical-pair Completion Algorithm},
  author={Karel Stokkermans},
  journal={J. Symb. Comput.},
We introduce a general critical-pair/completion algorithm, formulated in the language of category theory. It encompasses the Knuth?Bendix procedure for term rewriting systems (also modulo equivalence relations), the Grobner basis algorithm for polynomial ideal theory, and the resolution procedure for automated theorem proving. We show how these three procedures fit in the general algorithm, and how our approach relates to other categorical modeling approaches to these algorithms, especially… 
1 Citations

Automated Deduction for Many-Valued Logics



Simulation Buchberger's Algorithm by Knuth-Bendix Completion

We present a canonical term rewriting system whose initial model is isomorphic to GF(q)[x1,...,x n ]. Using this set of rewrite rules and additional ground equations specifying an ideal we can

A Categorical Formulation for Critical-Pair/Completion Procedures

A novel representation of so-called critical-pair/completion procedures is introduced, by the means of category theory, that serves to give a treatment procedures at as general a level as possible.

History and Basic Features of the Critical-Pair/Completion Procedure

Normalized Rewriting: A Unified View of Knuth-Bendix Completion and Gröbner Bases Computation

Buchberger’s algorithm and Knuth-Bendix completion are two fundamental algorithms used respectively in computer algebra and in equational logic. It has been remarked since 1981 that these two

Towards a Categorical Calculus for Critical-Pair/Completion

The ultimate aim of the research reported here is to provide a general framework for algorithms that show the following two characteristics: critical pairs and completion. Here completion means

A Two-Category Approach to Critical Pair Completion

In mathematics on the metalevel only product types have been used so far, but, in recently used higher order formalisms the function type came additionally into use.

The Church-Rosser property in computer algebra and special theorem proving: an investigation of critical-pair/completion algorithms (Ph.D. thesis)

A very general completion algorithm is described which contains all these various algorithms as special cases and a complexity bound for the Buchberger algorithm for trivariate polynomial equations is derived.

A critical-pair/completion algorithm for finitely generated ideals in rings

In this paper, it is shown how the critical-pair/completion approach can be extended to general rings and a set of reduction axioms is given, under which the correctness of the algorithm can be proven and which are preserved when passing from a ring R to the polynomial ring R[x1,...,,xn].

Monads and Modular Term Rewriting

This paper provides further support for monadic semantics of rewriting by giving a categorical proof of the most general theorem concerning the modularity of strong normalisation.