Declarative representation of algorithms of completion by critical pairs

DOI10.1023/A:1014569528986MaRDI QIDQ1407319zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 3952003
• Critical pair criteria for completion
• scientific article; zbMATH DE number 778200
• A categorical formulation for critical-pair/completion procedures
• scientific article; zbMATH DE number 3928345

Cited in

(4)

• Analysis of Dehn's algorithm by critical pairs
• A categorical formulation for critical-pair/completion procedures
• scientific article; zbMATH DE number 778200 (Why is no real title available?)
• scientific article; zbMATH DE number 3952003 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407319)