Rewriting Techniques and Applications
Springer Berlin (Verlag)
978-3-540-62950-4 (ISBN)
The 24 revised full papers presented were selected from a total of 54 submissions. Also included are abstracts of two invited talks and four system descriptions. Besides classical topics like termination, confluence, or applications to theorem proving, several new approaches to rewriting are presented. All in all, this volume presents the state of the art in the area of rewriting techniques and applications.
Well-behaved search and the Robbins problem.- Goal-Directed Completion using SOUR Graphs.- Shostak's congruence closure as completion.- Conditional equational specifications of data types with partial operations for inductive theorem proving.- Cross-sections for finitely presented monoids with decidable word problems.- New undecidability results for finitely presented monoids.- On the property of preserving regularity for string-rewriting systems.- Rewrite systems for natural, integral, and rational arithmetic.- D-bases for polynomial ideals over commutative noetherian rings.- On the word problem for free lattices.- A total, ground path ordering for proving termination of AC-rewrite systems.- Proving innermost normalisation automatically.- Termination of context-sensitive rewriting.- A new parallel closed condition for Church-Rosser of left-linear term rewriting systems.- Innocuous constructor-sharing combinations.- Scott's conjecture is true, position sensitive weights.- Two-dimensional rewriting.- A complete axiomatisation for the inclusion of series-parallel partial orders.- Undecidability of the first order theory of one-step right ground rewriting.- The first-order theory of one step rewriting in linear noetherian systems is undecidable.- Solving linear Diophantine equations using the geometric structure of the solution space.- A criterion for intractability of E-unification with free function symbols and its relevance for combination of unification algorithms.- Effective reduction and conversion strategies for combinators.- Finite family developments.- Prototyping combination of unification algorithms with the ELAN rule-based programming language.- The invariant package of MAS.- Opal: A system for computing noncommutative gröbner bases.- TRAM: An abstract machinefor order-sorted conditional term rewriting systems.
| Erscheint lt. Verlag | 14.5.1997 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XII, 348 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 469 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
| Informatik ► Theorie / Studium ► Compilerbau | |
| Schlagworte | algorithm • algorithms • automated deduction • Automatisches Beweisverfahren • Automatisches Schließen • Constraint-Auflösung • Constraint (Künstliche Intelligenz) • Constraint Solving • formale Sprachen • Hardcover, Softcover / Informatik, EDV/Programmiersprachen • HC/Informatik, EDV/Programmiersprachen • Logischer Schluss • Mathematische Logik • Monoid • Programmiersprache • programming • Programming language • Stringersetzung • String Rewriting • Term • Termersetzung • Term Rewriting • Theorem-Beweisen • theorem proving |
| ISBN-10 | 3-540-62950-5 / 3540629505 |
| ISBN-13 | 978-3-540-62950-4 / 9783540629504 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
