Conditional rewrite rules (Q1065790)
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 3922627
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conditional rewrite rules |
scientific article; zbMATH DE number 3922627 |
Statements
Conditional rewrite rules (English)
0 references
1984
0 references
The purpose of this paper is to develop a general study of conditional equational theories. A system of conditional equations is defined simply as a finite set of equational Horn clauses. It is shown that from an algebraic point of view these systems give rise to results analogous to those for classical equational theories. Unfortunately, for the related conditional rewriting systems the rewriting problem is unsolvable and the normal form function is uncomputable. Besides its intrinsic beauty such a general model may become a valuable tool for a ''top down'' search of decidability thresholds.
0 references
conditional equational theories
0 references
conditional equations
0 references
equational Horn clauses
0 references
0.8197762370109558
0 references
0.8168471455574036
0 references
