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

Podrobná bibliografia

Vydané v:	Cybernetics and systems analysis Ročník 37; číslo 6; s. 795 - 799
Hlavný autor:	Volkov, V. A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer Nature B.V 01.11.2001
Predmet:	Algebra Algorithms Computer programming Cybernetics Logic programming Mathematical models Studies
ISSN:	1060-0396, 1573-8337
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!