Reducing the Complexity of the Knuth-Bendix Completion Algorithm: A "Unification" of Different Approaches.

Franz Winkler

doi:10.1007/3-540-15984-3_293

Reducing the Complexity of the Knuth-Bendix Completion Algorithm: A "Unification" of Different Approaches.

Research Institute for Symbolic Computation

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

Original language	English
Title of host publication	Proceedings European Confernce on Computer Algebra (EUROCAL'85)
Editors	Bob F. Caviness
Publisher	Springer Verlag
Pages	378-389
Number of pages	12
ISBN (Print)	9783540159841
DOIs	https://doi.org/10.1007/3-540-15984-3_293
Publication status	Published - 1985

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	204 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Fields of science

101 Mathematics
101001 Algebra
101005 Computer algebra
101009 Geometry
101012 Combinatorics
101013 Mathematical logic
101020 Technical mathematics

Access to Document

10.1007/3-540-15984-3_293

Cite this

Winkler, F. (1985). Reducing the Complexity of the Knuth-Bendix Completion Algorithm: A "Unification" of Different Approaches. In B. F. Caviness (Ed.), Proceedings European Confernce on Computer Algebra (EUROCAL'85) (pp. 378-389). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 204 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-15984-3_293

Winkler, Franz. / Reducing the Complexity of the Knuth-Bendix Completion Algorithm: A "Unification" of Different Approaches. Proceedings European Confernce on Computer Algebra (EUROCAL'85). editor / Bob F. Caviness. Springer Verlag, 1985. pp. 378-389 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{9060c0a8be4043aeba7fe40a9a403cc0,

title = "Reducing the Complexity of the Knuth-Bendix Completion Algorithm: A {"}Unification{"} of Different Approaches.",

author = "Franz Winkler",

year = "1985",

doi = "10.1007/3-540-15984-3\_293",

language = "English",

isbn = "9783540159841",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "378--389",

editor = "Caviness, \{Bob F.\}",

booktitle = "Proceedings European Confernce on Computer Algebra (EUROCAL'85)",

}

Winkler, F 1985, Reducing the Complexity of the Knuth-Bendix Completion Algorithm: A "Unification" of Different Approaches. in BF Caviness (ed.), Proceedings European Confernce on Computer Algebra (EUROCAL'85). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 204 LNCS, Springer Verlag, pp. 378-389. https://doi.org/10.1007/3-540-15984-3_293

Reducing the Complexity of the Knuth-Bendix Completion Algorithm: A "Unification" of Different Approaches. / Winkler, Franz.
Proceedings European Confernce on Computer Algebra (EUROCAL'85). ed. / Bob F. Caviness. Springer Verlag, 1985. p. 378-389 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 204 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

TY - GEN

T1 - Reducing the Complexity of the Knuth-Bendix Completion Algorithm: A "Unification" of Different Approaches.

AU - Winkler, Franz

PY - 1985

Y1 - 1985

UR - https://www.scopus.com/pages/publications/71049133039

U2 - 10.1007/3-540-15984-3_293

DO - 10.1007/3-540-15984-3_293

M3 - Conference proceedings

SN - 9783540159841

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 378

EP - 389

BT - Proceedings European Confernce on Computer Algebra (EUROCAL'85)

A2 - Caviness, Bob F.

PB - Springer Verlag

ER -

Winkler F. Reducing the Complexity of the Knuth-Bendix Completion Algorithm: A "Unification" of Different Approaches. In Caviness BF, editor, Proceedings European Confernce on Computer Algebra (EUROCAL'85). Springer Verlag. 1985. p. 378-389. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-15984-3_293

Reducing the Complexity of the Knuth-Bendix Completion Algorithm: A "Unification" of Different Approaches.

Publication series

Fields of science

Access to Document

Other files and links

Cite this