𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fuzzy term-rewriting system

✍ Scribed by Churn Jung Liau; Bertrand I-peng Lin

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
615 KB
Volume
44
Category
Article
ISSN
0165-0114

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Term Rewrite Systems for Lattice Theory
Term Rewrite Systems for Lattice Theory
✍ Ralph Freese; J. JeΕΎek; J.B. Nation πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 367 KB

It is shown that, even though there is a very well-behaved, natural normal form for lattice theory, there is no finite, convergent \(A C\) term rewrite system for the equational theory of all lattices.

Confluence of Curried Term-Rewriting Sys
Confluence of Curried Term-Rewriting Systems
✍ Stefan Kahrs πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 721 KB

Term rewriting systems operate on first-order terms. Presenting such terms in curried form is usually regarded as a trivial change of notation. However, in the absence of a type-discipline, or in the presence of a more powerful type-discipline than simply typed \(\lambda\)-calculus, the change is no

Term-rewriting systems with rule priorit
Term-rewriting systems with rule priorities
✍ J.C.M. Baeten; J.A. Bergstra; J.W. Klop; W.P. Weijland πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 463 KB
Reachability in Conditional Term Rewriti
Reachability in Conditional Term Rewriting Systems
✍ Guillaume Feuillade; Thomas Genet πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 844 KB

In this paper, we study the reachability problem for conditional term rewriting systems. Given two ground terms \(s\) and \(t\), our practical aim is to prove \(s εŠ›_{\mathcal{R}}^{*} t\) for some join conditional term rewriting system \(\mathcal{R}\) (possibly not terminating and not confluent). The