About: Knuth–Bendix completion algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Knuth–Bendix completion algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is a semi-decision algorithm for transforming a set of equations (over terms) into a confluent term rewriting system. When the algorithm succeeds, it effectively solves the word problem for the specified algebra. Buchberger's algorithm for computing Gröbner bases is a very similar algorithm. Although developed independently, it may also be seen as the instantiation of Knuth–Bendix algorithm in the theory of polynomial rings.

Attributes	Values
rdf:type	software
rdfs:label	Knuth–Bendix completion algorithm (en)
rdfs:comment	The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is a semi-decision algorithm for transforming a set of equations (over terms) into a confluent term rewriting system. When the algorithm succeeds, it effectively solves the word problem for the specified algebra. Buchberger's algorithm for computing Gröbner bases is a very similar algorithm. Although developed independently, it may also be seen as the instantiation of Knuth–Bendix algorithm in the theory of polynomial rings. (en)
sameAs	Knuth–Bendix completion algorithm
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Cite_journal dbt:Donald_Knuth_navbox dbt:Math dbt:MathWorld dbt:Mvar dbt:NumBlk dbt:Reflist dbt:EquationNote dbt:Underset dbt:Mset dbt:EquationRef dbt:Overunderset
Subject	Combinatorics on words Computational group theory Donald Knuth Rewriting systems
gold:hypernym	Algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Knuth–Bendix_completion_algorithm?oldid=1066943757&ns=0
Wikipage page ID	614147 (xsd:integer)
page length (characters) of wiki page	21395 (xsd:nonNegativeInteger)
Wikipage revision ID	1066943757 (xsd:integer)
Link from a Wikipage to another Wikipage	Group (mathematics) Normal form (abstract rewriting) Well-order Abstract rewriting system Algebra Algorithm Binary relation Buchberger's algorithm Combinatorics on words Computational group theory Donald Knuth Rewriting systems Free abelian group Generating set of a group Donald Knuth Word problem (mathematics) Critical pair (term rewriting) Decidability (logic) Presentation of a group Presentation of a monoid Term (logic) Closure (mathematics) Composition of relations Computational group theory Confluence (abstract rewriting) Converse relation Coset E (theorem prover) Newman's lemma Rewrite order Rewriting Encompassment ordering Equation Gröbner basis Polynomial ring RE (complexity) Relation (mathematics) Resolution (logic) Shortlex order dbr:Logged_rewriting
has abstract	The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is a semi-decision algorithm for transforming a set of equations (over terms) into a confluent term rewriting system. When the algorithm succeeds, it effectively solves the word problem for the specified algebra. Buchberger's algorithm for computing Gröbner bases is a very similar algorithm. Although developed independently, it may also be seen as the instantiation of Knuth–Bendix algorithm in the theory of polynomial rings. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Knuth–Bendix_completion_algorithm
is Wikipage redirect of	Knuth-Bendix Knuth-Bendix algorithm Knuth-Bendix completion Knuth–Bendix algorithm Knuth–Bendix completion Knuth-Bendix completion algorithm Knuth Bendix completion Knuth Bendix completion algorithm
is Link from a Wikipage to another Wikipage of	Bendix Buchberger's algorithm David Plaisted Donald Knuth Critical pair (term rewriting) Completion Computational group theory Computer algebra system Coset enumeration List of algorithms List of computability and complexity topics Encompassment ordering Knuth-Bendix Knuth-Bendix algorithm Knuth-Bendix completion Knuth–Bendix algorithm Knuth–Bendix completion Knuth-Bendix completion algorithm Knuth Bendix completion Knuth Bendix completion algorithm
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Knuth–Bendix_completion_algorithm

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software