LEADER 01216nam 2200349 n 450 001 996386247403316 005 20221108052946.0 035 $a(CKB)1000000000609433 035 $a(EEBO)2240899214 035 $a(UnM)99851537 035 $a(EXLCZ)991000000000609433 100 $a19920406d1633 uy | 101 0 $alat 135 $aurbn||||a|bb| 200 00$aHistoria naualis antiqua$b[electronic resource] $elibris quatuor. Autore Tho. Rivio, Regis in Anglia aduocato 210 $aLondini $cApud Robertum Barker, typographum regium: et hæred. Io. Billii$dAnno 1633 215 $a[8], 357, 356-491, [3] p., folded plate 300 $aThe folded plate bears five woodcuts of ships. 300 $aThe last leaf is blank. 300 $aReproduction of the original in the Henry E. Huntington Library and Art Gallery. 330 $aeebo-0113 606 $aNaval history, Ancient$vEarly works to 1800 615 0$aNaval history, Ancient 700 $aRyves$b Thomas$cSir,$f1583?-1652.$01012960 801 0$bCu-RivES 801 1$bCu-RivES 801 2$bCStRLIN 801 2$bWaOLN 906 $aBOOK 912 $a996386247403316 996 $aHistoria naualis antiqua$92376932 997 $aUNISA LEADER 05464nam 22006975 450 001 9910144922303321 005 20200705190903.0 010 $a3-540-69051-4 024 7 $a10.1007/3-540-62950-5 035 $a(CKB)1000000000234639 035 $a(SSID)ssj0000326350 035 $a(PQKBManifestationID)11276111 035 $a(PQKBTitleCode)TC0000326350 035 $a(PQKBWorkID)10265914 035 $a(PQKB)11620956 035 $a(DE-He213)978-3-540-69051-1 035 $a(PPN)155225170 035 $a(EXLCZ)991000000000234639 100 $a20121227d1997 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aRewriting Techniques and Applications$b[electronic resource] $e8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997. Proceedings /$fedited by Hubert Comon 205 $a1st ed. 1997. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1997. 215 $a1 online resource (XII, 348 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1232 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-62950-5 327 $aWell-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 machine for order-sorted conditional term rewriting systems. 330 $aThis 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 full papers presented were selected from a total of 54 submissions. Also included are abstracts of two invited talks and four system descriptions. Besides classical topics like termination, confluence, or applications to theorem proving, several new approaches to rewriting are presented. All in all, this volume presents the state of the art in the area of rewriting techniques and applications. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1232 606 $aProgramming languages (Electronic computers) 606 $aComputer logic 606 $aLogic, Symbolic and mathematical 606 $aComputer science?Mathematics 606 $aArtificial intelligence 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aSymbolic and Algebraic Manipulation$3https://scigraph.springernature.com/ontologies/product-market-codes/I17052 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 615 0$aProgramming languages (Electronic computers) 615 0$aComputer logic. 615 0$aLogic, Symbolic and mathematical. 615 0$aComputer science?Mathematics. 615 0$aArtificial intelligence. 615 14$aProgramming Languages, Compilers, Interpreters. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aArtificial Intelligence. 676 $a005.13/1 702 $aComon$b Hubert$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on Rewriting Techniques and Applications$d(8th :$f1997 :$eSitges, Spain) 906 $aBOOK 912 $a9910144922303321 996 $aRewriting Techniques and Applications$9774195 997 $aUNINA