Titlebook: Rewriting Techniques and Applications; 9th International Co Tobias Nipkow Conference proceedings 1998 Springer-Verlag Berlin Heidelberg 199

HARP

Harridan

Decidable approximations of sets of descendants and sets of normal forms,chniques. In the context of rewriting logic, a Term Rewriting System is a program, and a normal form is a result of the program. Thus, approximations of sets of descendants and sets of normal forms provide tools for analysing a few properties of programs: we show how to compute a superset of results

CHIP

Algorithms and reductions for rewriting problems,gorithm for Unique-normal-form property of ground systems for the first time. Next we prove undecidability of these problems for a fixed string rewriting system using our reductions. Finally, we prove partial decidability results for Confluence of commutative semi-thue systems. The Confluence and Un

我悲伤

The decidability of simultaneous rigid ,-unification with one variable,mplies that the ∀*∃∀* fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the ∃∃-fragment, we obtain ., .. It is also proved that SREU with one variable and a constant bound on the number of rigid equations is P-complete.

英寸

Ordering constraints over feature trees expressed in second-order monadic logic,es. We investigate decidability and complexity questions for fragments of the first-order theory of FT≤. It is well-known that the first-order theory of FT is decidable and that several of its fragments can be decided in quasi-linear time, including the satisfiability problem of FT and its entailmen

否决

吞下

预兆好

王得到

Decidable approximations of sets of descendants and sets of normal forms,rategy. The main technical contribution of the paper is the construction of an approximation automaton which recognises a superset of the set of normal forms of terms in a set ., w.r.t. a Term Rewriting System ..

HEPA-filter