The refereed proceedings of the 14th International Conference on Rewriting Techniques and Applications, RTA 2003, held in Valencia, Spain in June 2003. The 26 revised regular papers and 6 system descriptions presented together with 3 invited contributions were carefully reviewed and selected from 61 submissions. All current aspects of rewriting are addressed.

Produktinformation

Utgivningsdatum:2003-05-27
Mått:155 x 235 x 29 mm
Vikt:797 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:518
Upplaga:2003
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540402541

Utforska kategorier

Programmeringsböcker inom Data och IT
Programspråk inom Data och IT

Innehållsförteckning

Invited Talk.- Symbolic Systems Biology.- Confluence as a Cut Elimination Property.- Associative-Commutative Rewriting on Large Terms.- A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms.- Efficient Reductions with Director Strings.- Rewriting Logic and Probabilities.- The Maude 2.0 System.- Diagrams for Meaning Preservation.- Expression Reduction Systems with Patterns.- Residuals in Higher-Order Rewriting.- Rewriting UNITY.- New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols.- An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation.- Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties.- Rule-Based Analysis of Dimensional Safety.- Invited Talk.- Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems.- On the Complexity of Higher-Order Matching in the Linear ?-Calculus.- XML Schema, Tree Logic and Sheaves Automata.- Size-Change Termination for Term Rewriting.- Monotonic AC-Compatible Semantic Path Orderings.- Relating Derivation Lengths with the Slow-Growing Hierarchy Directly.- Tsukuba Termination Tool.- Liveness in Rewriting.- Validation of the JavaCard Platform with Implicit Induction Techniques.- “Term Partition” for Mathematical Induction.- Equational Prover of Theorema.- Termination of Simply Typed Term Rewriting by Translation and Labelling.- Rewriting Modulo in Deduction Modulo.- Termination of String Rewriting Rules That Have One Pair of Overlaps.- Environments for Term Rewriting Engines for Free!.- Joint RTA-TLCA Invited Talk.- A Logical Algorithm for ML Type Inference.- A Rewriting Alternative to Reidemeister-Schreier.- Stable Computational Semanticsof Conflict-Free Rewrite Systems (Partial Orders with Duplication).- Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism.- Testing Extended Regular Language Membership Incrementally by Rewriting.

Mer från samma författare

Automated Deduction – CADE-20

Robert Nieuwenhuis

Häftad, 2005

571 kr

Automated Deduction - CADE-20

Robert Nieuwenhuis

E-bok

2005

739 kr

Logic for Programming, Artificial Intelligence, and Reasoning

Robert Nieuwenhuis, Andrei Voronkov

Häftad, 2001

1 135 kr

Rewriting Techniques and Applications

14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings

Fler format och utgåvor

Beskrivning

Produktinformation

Utforska kategorier

Innehållsförteckning

Mer från samma författare

Mer från samma serie

Du kanske också är intresserad av

Rewriting Techniques and Applications

14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings

Fler format och utgåvor

Beskrivning

Produktinformation

Utforska kategorier

Innehållsförteckning

Mer från samma författare

Mer från samma serie

Du kanske också är intresserad av

Rewriting Techniques and Applications

14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings

Fler format och utgåvor

Beskrivning

Produktinformation

Utforska kategorier

Innehållsförteckning

Mer från samma författare

Mer från samma serie

Du kanske också är intresserad av