MARC Record from marc_columbia

LEADER: 04182mam a2200385 a 4500
001 1985209
005 20220609043440.0
008 970422t19971997gw a b 001 0 eng
010 $a 97018882
020 $a3540629505 (softcover : alk. paper)
035 $a(OCoLC)ocm36841604
035 $9AMK4885CU
035 $a(NNC)1985209
035 $a1985209
040 $aDLC$cDLC$dCUY$dNNC$dOrLoB-B
050 00 $aQA267$b.R48 1997
082 00 $a005.13/1$221
245 00 $aRewriting techniques and applications :$b8th international conference, RTA-97, Sitges, Spain, June 1997 : proceedings /$cHubert Comon (ed.).
260 $aBerlin ;$aNew York :$bSpringer,$c[1997], ©1997.
263 $a9706
300 $axi, 338 pages :$billustrations ;$c24 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
490 1 $aLecture notes in computer science ;$v1232
504 $aIncludes bibliographical references and index.
505 00 $tWell behaved search and the Robbins problem /$rW. McCune --$tGoal-directed completion using SOUR graphs /$rC. Lynch --$tShostak's congruence closure as completion /$rD. Kapur --$tConditional equational specifications of data types with partial operations for inductive theorem proving /$rU. Kuhler and C.-P. Wirth --$tCross-sections for finitely presented monolids with decidable work problems /$rF. Otto, M. Katsura and Y. Kobayashi --$tNew undecidability results for finitely presented monoids /$rA. Sattler-Klein --$tOn the property of preserving regularity for string-rewriting systems /$rF. Otto --$tRewrite systems for natural, integral, and rational arithmetic /$rE. Contejean, C. Marche and L. Rabehasaina --$tD-bases for polynomial ideals over commutative Noetherian rings /$rL. Bachmair and A. Tiwari --$tOn the word problem for free lattices /$rG. Struth --$tA total ground path ordering for providing termination of AC rewrite systems /$rD. Kapur and G. Sivakumar --
505 80 $tProving innermost normalisation automatically /$rT. Arts and J. Giesl --$tTermination of context-sensitive rewriting /$rH. Zantema --$tA new parallel closed condition for Church-Rosser of left-linear term rewriting systems /$rM. Oyamaguchi and Y. Ohta --$tInnocuous constructor-sharing combinations /$rN. Dershowitz --$tScott's conjecture is true, position sensitive weights /$rS. Perlo-Freeman and P. Prohle --$tTwo dimensional rewriting /$rY. Lafont --$tA complete axiomatisation for the inclusion of series-parallel partial orders /$rD. Bechet, P. de Groote and C. Retore --$tUndecidability of the first order theory of one-step right ground rewriting /$rJ. Marcinkowski --$tThe first-order theory of one step rewriting in linear Noetherian systems is undecidable /$rS. Vorobyov --$tSolving linear Diophantine equations using the geometric structure of the solution space /$rA. P. Tomas and M. Filgueiras --
505 80 $tA criterion for intractability of E-unification with free function symbols and its relevance for combination of unification algorithms /$rK. Schulz --$tEffective reduction and conversion strategies for combinators /$rR. Statman --$tFinite family developments /$rV. van Oostrom --$tPrototyping combination of unification algorithms with the ELAN rule-based programming language /$rC. Ringeissen --$tThe invariant package of MAS /$rM. Gobel --$tOpal: A system for computing noncommutative Grobner bases /$rE. Green, L. Heath and B. Keller --$tTRAM: an abstract machine for order-sorted conditional term rewriting systems /$rK. Ogata, K. Ohhara and K. Futatsugi.
650 0 $aRewriting systems (Computer science)$vCongresses.$0http://id.loc.gov/authorities/subjects/sh2010111020
650 0 $aComputer programming$vCongresses.$0http://id.loc.gov/authorities/subjects/sh2007004295
650 0 $aAlgorithms$vCongresses.$0http://id.loc.gov/authorities/subjects/sh2007100991
700 1 $aComon, Hubert.$0http://id.loc.gov/authorities/names/n95033973
711 2 $aInternational Conference on Rewriting Techniques and Applications$n(8th :$d1997 :$cSitges, Spain)
830 0 $aLecture notes in computer science ;$v1232.$0http://id.loc.gov/authorities/names/n42015162
852 00 $boff,eng$hQA267$i.I555 1997