03770oam 2200565 450 99646574850331620210716220535.03-540-48685-210.1007/3-540-48685-2(CKB)1000000000211086(SSID)ssj0000326352(PQKBManifestationID)11243966(PQKBTitleCode)TC0000326352(PQKBWorkID)10296534(PQKB)11217428(DE-He213)978-3-540-48685-5(MiAaPQ)EBC3072319(MiAaPQ)EBC6486136(PPN)15520100X(EXLCZ)99100000000021108620210716d1999 uy 0engurnn|008mamaatxtccrRewriting techniques and applications 10th international conference, RTA-99 Trento, Italy, July 2-4, 1999 : proceedings /Paliath Narendran, Michael Rusinowitch (editors)1st ed. 1999.Berlin, Heidelberg :Springer,[1999]©19991 online resource (XII, 408 p.) Lecture Notes in Computer Science ;1631Bibliographic Level Mode of Issuance: Monograph3-540-66201-4 Includes bibliographical references at the end of each chapters and index.Session 1 -- Solved Forms for Path Ordering Constraints -- Jeopardy -- Strategic Pattern Matching -- Session 2: -- On the Strong Normalization of Natural Deduction with Permutation-Conversions -- Normalisation in Weakly Orthogonal Rewriting -- Strong Normalization of Proof Nets Modulo Structural Congruences -- Session 3: Invited Talk -- Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas -- Session 4: -- Undecidability of the Part of the Theory of Ground Term Algebra Modulo an AC Symbol -- Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting -- A New Result about the Decidability of the Existential One-Step Rewriting Theory -- Session 5: -- A Fully Syntactic AC-RPO -- Theory Path Orderings -- A Characterisation of Multiply Recursive Functions with Higman’s Lemma -- Session 6: -- Deciding the Word Problem in the Union of Equational Theories Sharing Constructors -- Normalization via Rewrite Closures -- Test Sets for the Universal and Existential Closure of Regular Tree Languages -- Session 7: Invited Tutorial -- Higher-Order Rewriting -- Session 8: System Descriptions -- The Maude System -- TOY: A Multiparadigm Declarative System -- UniMoK: A System for Combining Equational Unification Algorithms -- : A Laboratory for Rapid Term Graph Rewriting -- Session 9: -- Decidability for Left-Linear Growing Term Rewriting Systems -- Transforming Context-Sensitive Rewrite Systems -- Context-Sensitive AC-rewriting -- Session 10: -- The Calculus of Algebraic Constructions -- HOL-??: An Intentional First-Order Expression of Higher-Order Logic -- Session 11: Invited Talk -- On the Connections between Rewriting and Formal Language Theory -- Session 12: -- A Rewrite System Associated with Quadratic Pisot Units -- Fast Rewriting of Symmetric Polynomials -- On Implementation of Tree Synchronized Languages.Lecture notes in computer science ;1631.Complexity (Linguistics)Complexity (Linguistics)410Rusinowitch MichaelNarendran Paliath1955-International Conference on Rewriting Techniques and Applications(10th :1999 :Trento, Italy)MiAaPQMiAaPQUtOrBLWBOOK996465748503316Rewriting Techniques and Applications774195UNISA