Declarative representation of algorithms of completion by critical pairs (Q1407319)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Declarative representation of algorithms of completion by critical pairs |
scientific article; zbMATH DE number 1981963
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Declarative representation of algorithms of completion by critical pairs |
scientific article; zbMATH DE number 1981963 |
Statements
Declarative representation of algorithms of completion by critical pairs (English)
0 references
16 September 2003
0 references
computer algebra
0 references
logical programming
0 references
algebraic programming
0 references
completion algorithms
0 references
Knuth-Bendix algorithm
0 references
Buchberger algorithm
0 references
declarative representation of critical pairs
0 references
properties of termination and correction
0 references
APS algebraic system
0 references
