- 3 Ergebnisse
Kleinster Preis: € 59,49, größter Preis: € 59,49, Mittelwert: € 59,49
1
Rewriting Techniques and Applications - Hubert Comon
Bestellen
bei Springer.com
€ 59,49
Bestellen
Details und Versand
gesponserter Link
Hubert Comon:

Rewriting Techniques and Applications - neues Buch

ISBN: 9783540690511

This book constitutes the refereed proceedings of the 8th International Conference on Rewriting Techniques and Applications, RTA-97, held in Sitges, Spain, in June 1997. The 24 revised fu… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
2
Rewriting Techniques and Applications - Hubert Comon
Bestellen
bei Springer.com
€ 59,49
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link

Hubert Comon:

Rewriting Techniques and Applications - neues Buch

ISBN: 9783540690511

Computer Science; Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Symbolic and Algebraic Manipulation; Artificial… Mehr…

  - Versandkosten: EUR 0.00
zuklappen (X)
3
Rewriting Techniques and Applications - Hubert Comon
Bestellen
bei Springer.com
€ 59,49
Bestellen
Details und Versand
gesponserter Link
Hubert Comon:
Rewriting Techniques and Applications - neues Buch

ISBN: 9783540690511

Computer Science; Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Symbolic and Algebraic Manipulation; Artificial… Mehr…

  - Versandkosten:zzgl. Versandkosten.
zuklappen (X)
1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
Rewriting Techniques and Applications
Autor:
Titel:
ISBN-Nummer:

9783540690511

Detailangaben zum Buch - Rewriting Techniques and Applications


EAN (ISBN-13): 9783540690511
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2016-12-12T10:13:07+01:00 (Vienna)
Detailseite zuletzt geändert am 2019-10-22T19:56:08+02:00 (Vienna)
ISBN/EAN: 9783540690511

ISBN - alternative Schreibweisen:
978-3-540-69051-1
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: rewriting

Daten vom Verlag:

Autor/in: Hubert Comon
Titel: Lecture Notes in Computer Science; Rewriting Techniques and Applications - 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997. Proceedings
Verlag: Springer; Springer Berlin
348 Seiten
Erscheinungsjahr: 2005-07-13
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XII, 348 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Programmiersprachen; Compiler und Übersetzer; Verstehen; Automatisches Schließen; Constraint-Auflösung; Monoid; Stringersetzung; Termersetzung; Theorem-Beweisen; algorithm; algorithms; automated deduction; constraint solving; programming; programming language; string rewriting; term rewriting; theorem proving; C; Compilers and Interpreters; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Symbolic and Algebraic Manipulation; Artificial Intelligence; Computer Science; Theoretische Informatik; Mathematik für Informatiker; Künstliche Intelligenz; BC

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.
< zum Archiv...