scientific article; zbMATH DE number 3938563

From MaRDI portal
Publication:3709891





[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.




Cited in
(27)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3709891)