000 | 03892nam a22005415i 4500 | ||
---|---|---|---|
001 | 978-3-540-48685-5 | ||
003 | DE-He213 | ||
005 | 20160624102036.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1999 gw | s |||| 0|eng d | ||
020 |
_a9783540486855 _9978-3-540-48685-5 |
||
024 | 7 |
_a10.1007/3-540-48685-2 _2doi |
|
050 | 4 | _aQA8.9-QA10.3 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aMAT018000 _2bisacsh |
|
072 | 7 |
_aCOM051010 _2bisacsh |
|
082 | 0 | 4 |
_a005.131 _223 |
245 | 1 | 0 |
_aRewriting Techniques and Applications _h[electronic resource] : _b10th International Conference, RTA-99 Trento, Italy, July 2–4, 1999 Proceedings / _cedited by Paliath Narendran, Michael Rusinowitch. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999. |
|
300 |
_aXII, 408 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1631 |
|
505 | 0 | _aSession 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. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aLogic design. | |
650 | 0 |
_aAlgebra _xData processing. |
|
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aProgramming Languages, Compilers, Interpreters. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
700 | 1 |
_aNarendran, Paliath. _eeditor. |
|
700 | 1 |
_aRusinowitch, Michael. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540662013 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1631 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-48685-2 |
942 |
_2EBK6548 _cEBK |
||
999 |
_c35842 _d35842 |