Last Updated
：2025/12/02
Knuth-Bendix completion algorithm
Proper noun
Japanese Meaning
（計算理論）項の集合に対する一群の方程式を、縮約性（コンフルエント性）を持つ項書き換え系へと変換するための、半決定的アルゴリズム
Quizzes for review
(computing theory) A semidecision algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
Knuth-Bendix completion algorithm
Graduate students implemented the Knuth-Bendix completion algorithm to optimize their theorem prover by turning a set of term equations into a confluent rewriting system.
See correct answer
Graduate students implemented the Knuth-Bendix completion algorithm to optimize their theorem prover by turning a set of term equations into a confluent rewriting system.
音声機能が動作しない場合はこちらをご確認ください
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
