Declarative Representation of Algorithms of Completion by Critical Pairs

Authors:
V. A. Volkov
Affiliations:
Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2001

Citing 4
Cited 0

History and basic features of the critical-pair/completion procedure

Journal of Symbolic Computation
Computations in APS

Informatika '91 Selected papers of the 5th Soviet-French symposium on Theoretical computer science, methods and tools for compilation, and program development
Equational inference, canonical proofs, and proof orderings

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A declarative representation of critical pairs for completion algorithms is described. The representation can be considered as a generic program that, after parametrization of some of its functions, realizes the Knuth-Bendix algorithm for solving the word problem in universal algebras or Buchberger algorithm for constructing Grobner bases of polynomial ideals. The properties of termination and correction are considered. A realization of the representation in the APS algebraic system is described.