LEADER 06028nam 22007455 450 001 996465665203316 005 20200705171733.0 010 $a3-540-68596-0 024 7 $a10.1007/3-540-61464-8 035 $a(CKB)1000000000234483 035 $a(SSID)ssj0000326349 035 $a(PQKBManifestationID)11266251 035 $a(PQKBTitleCode)TC0000326349 035 $a(PQKBWorkID)10267436 035 $a(PQKB)10256506 035 $a(DE-He213)978-3-540-68596-8 035 $a(PPN)155233459 035 $a(EXLCZ)991000000000234483 100 $a20121227d1996 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aRewriting Techniques and Applications$b[electronic resource] $e7th International Conference, RTA-96, New Brunswick, NJ, USA July 27 - 30, 1996. Proceedings /$fedited by Harald Ganzinger 205 $a1st ed. 1996. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1996. 215 $a1 online resource (XI, 440 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1103 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-61464-8 327 $aRewrite-based automated reasoning: Challenges ahead -- Fine-grained concurrent completion -- AC-complete unification and its application to theorem proving -- Superposition theorem proving for abelian groups represented as integer modules -- Symideal Gröbner bases -- Termination of constructor systems -- Dummy elimination in equational rewriting -- On proving termination by innermost termination -- A recursive path ordering for higher-order terms in ?-long ?-normal form -- Higher-order superposition for dependent types -- Higher-order narrowing with definitional trees -- Design of a proof assistant -- A compiler for nondeterministic term rewriting systems -- Combinatory reduction systems with explicit substitution that preserve strong normalisation -- Confluence properties of extensional and non-extensional ?-calculi with explicit substitutions (extended abstract) -- On the power of simple diagrams -- Coherence for sharing proof nets -- Modularity of termination in term graph rewriting -- Confluence of terminating conditional rewrite systems revisited -- Applications of rewrite techniques in monoids and rings -- Compositional term rewriting: An algebraic proof of Toyama's theorem -- The first-order theory of one-step rewriting is undecidable -- An algorithm for distributive unification -- On the termination problem for one-rule semi-Thue system -- Efficient second-order matching -- Linear second-order unification -- Unification of higher-order patterns in a simply typed lambda-calculus with finite products and terminal type -- Decidable approximations of term rewriting systems -- Semantics and strong sequentially of priority term rewriting systems -- Higher-order families -- A new proof manager and graphic interface for the larch prover -- ReDuX 1.5: New facets of rewriting -- CiME: Completion modulo E -- Distributed larch prover (DLP): An experiment in parallelizing a rewrite-rule based prover -- EPIC: An equational language Abstract machine and supporting tools -- SPIKE-AC: A system for proofs by induction in Associative-Commutative theories -- On gaining efficiency in completion-based theorem proving. 330 $aThis book constitutes the refereed proceedings of the 7th International Conference on Rewriting Techniques and Applications, RTA-96, held in New Brunswick, NJ, USA, in July 1996. The 27 revised full papers presented in this volume were selected from a total of 84 submissions, also included are six system descriptions and abstracts of three invited papers. The topics covered include analysis of term rewriting systems, string and graph rewriting, rewrite-based theorem proving, conditional term rewriting, higher-order rewriting, unification, symbolic and algebraic computation, and efficient implementation of rewriting on sequential and parallel machines. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1103 606 $aSoftware engineering 606 $aComputers 606 $aProgramming languages (Electronic computers) 606 $aComputer logic 606 $aMathematical logic 606 $aArtificial intelligence 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 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 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 615 0$aSoftware engineering. 615 0$aComputers. 615 0$aProgramming languages (Electronic computers). 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aArtificial intelligence. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aTheory of Computation. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aArtificial Intelligence. 676 $a005.13/1 702 $aGanzinger$b Harald$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on Rewriting Techniques and Applications$d(7th :$f1996 :$eNew Brunswick, N.J.) 906 $aBOOK 912 $a996465665203316 996 $aRewriting Techniques and Applications$9774195 997 $aUNISA