Beschreibung:
Unlike current survey articles and textbooks, here the so-called confluence and termination hierarchies play a key role. Throughout, the relationships between the properties in the hierarchies are reviewed, and it is shown that for every implication X => Y in the hierarchies, the property X is undecidable for all term rewriting systems satisfying Y. Topics covered include: the newest techniques for proving termination of rewrite systems; a comprehensive chapter on conditional term rewriting systems; a state-of-the-art survey of modularity in term rewriting, and a uniform framework for term and graph rewriting, as well as the first result on conditional graph rewriting.
New advanced text/reference book on term rewriting theory and application. Essential, state-of-the-art reference for computer scientists and advanced graduates working in field of computational logic programming.
1 Motivation.- 2 Abstract Reduction Systems.- 3 Term Rewriting Systems.- 4 Confluence.- 5 Termination.- 6 Relative Undecidability.- 7 Conditional Rewrite Systems.- 8 Modularity.- 9 Graph Rewriting.- 10 Proving Termination of Logic Programs.- A Kruskal's Theorem.- A.l Partial Well-Orderings.- A.2 A Proof of Kruskal's Theorem.- References.