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

光明正大

獨(dú)行者

enmesh

Algorithms and reductions for rewriting problems,ique-normal-form property are shown Expspace-hard for commutative semi-thue systems. We also show that there is a family of string rewrite systems for which the word problem is trivially decidable but confluence undecidable, and we show a linear equational theory with decidable word problem but undecidable linear equational matching.

說笑

Modularity of termination using dependency pairs,s yields new modularity criteria which extend previous results in this area. In particular, existing results for modularity of innermost termination can easily be obtained as direct consequences of our new criteria.

acquisition

0302-9743 ing rewriting, theorem proving, resolution, normalization, unification, equational logics, lambda calculus, constraint solving, and functional programming.978-3-540-64301-2978-3-540-69721-3Series ISSN 0302-9743 Series E-ISSN 1611-3349

Radiation

Flagging

Ordering constraints over feature trees expressed in second-order monadic logic,h existential quantifiers is decidable but PSPACE-hard. Our decidability proof is based on a new technique where feature constraints are expressed in second-order monadic logic with countably many successors SΩS. We thereby reduce the entailment problem of FT≤with existential quantification to Rabin‘s famous theorem on tree automata.

顯而易見

locus-ceruleus

品牌