Declarative representation of algorithms of completion by critical pairs

DOI10.1023/A:1014569528986zbMath1030.68110OpenAlexW1498201377MaRDI QIDQ1407319

V. A. Volkov

Publication date: 16 September 2003

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1014569528986

zbMATH Keywords

computer algebraKnuth-Bendix algorithmBuchberger algorithmalgebraic programmingAPS algebraic systemcompletion algorithmsdeclarative representation of critical pairslogical programmingproperties of termination and correction

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

This page was built for publication: Declarative representation of algorithms of completion by critical pairs