No label defined (Q3709891)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3938563
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3938563 |
Statements
1985
0 references
simplification ordering
0 references
rewriting procedure
0 references
finite termination
0 references
unification by narrowing
0 references
Knuth-Bendix-like completion procedure
0 references
0.8419446349143982
0 references
0.8317369222640991
0 references
[For the entire collection see Zbl 0578.00008.] The author considers ''fair'' conditional term rewriting systems, i.e. conditional TRS which for every rule r (where r:\(\bigwedge^{n}_{i=1}u_ i=v_ i\Rightarrow G\to D)\) verifies the following condition: \(G>D\) and \(G>u_ i,v_ i\) for a given simplification ordering \(<\). It is shown that several notions and results available in the case of purely equational rewriting carry over to this formalism. Thus, after stating some general results, a) a rewriting procedure is shown to be totally correct, b) the problem of finite termination is considered, c) the procedure of unification by narrowing is extended, and d) the problem of confluence is considered a Knuth- Bendix-like completion procedure being devised. The author compares the notion of fair conditional TRS to other approaches.
0 references