Knuth-Bendix procedure and non deterministic behavior - an example
Uloženo v:
| Název: | Knuth-Bendix procedure and non deterministic behavior - an example |
|---|---|
| Autoři: | Gnaedig, I. |
| Informace o vydavateli: | European Association for Theoretical Computer Science, Leiden |
| Témata: | nondeterminism, rules ordering, Software, source code, etc. for problems pertaining to computer science, Knuth-Bendix algorithm, rewriting rules, completion, Theorem proving (deduction, resolution, etc.), rewriting systems |
| Popis: | The author presents an example in order to illustrate the nondeterminism of the Knuth-Bendix algorithm, with respect to the ordering it uses. He introduces a set of rules describing the axioms of Boolean algebra, with an additional axiom, corresponding to a theorem to be refuted. The paper shows how different orderings on terms, during an execution of the Knuth- Bendix procedure on these rules, lead to different completion processes. It is also shown how eleven such different sessions produce only two different rewriting systems. |
| Druh dokumentu: | Article |
| Popis souboru: | application/xml |
| Přístupová URL adresa: | https://zbmath.org/4080964 |
| Přístupové číslo: | edsair.c2b0b933574d..ef3d33876e1b3b02fbc442cda0bbd041 |
| Databáze: | OpenAIRE |
Nájsť tento článok vo Web of Science Buďte první, kdo okomentuje tento záznam!