Declarative Representation of Algorithms of Completion by Critical Pairs

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Cybernetics and systems analysis Ročník 37; číslo 6; s. 795 - 799
Hlavní autor: Volkov, V. A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.11.2001
Témata:
Algebra
Algorithms
Computer programming
Cybernetics
Logic programming
Mathematical models
Studies
ISSN:1060-0396, 1573-8337
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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. [PUBLICATION ABSTRACT]
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1060-0396
1573-8337
DOI:10.1023/A:1014569528986