01043nam0 2200313 450 00000224120050630115600.088-386-0725-7--------d1996----km-y0itay50------baitaITMarketing strategicouna prospettiva europeaJean-Jacques Lambin2. ed.MilanoMacGraw-Hill libri Italia1996cXXVI, 577 p.ill.24 cmCollana di istruzione scientificaSerie di discipline aziendali8Tit. orig. : Le marketing strategiqueTrad. di : Alberto Biancardi, Isabella Farinelli ...[et al.]2001Collana di istruzione scientificaMarketing658.8Lambin,Jean-Jacques79664Biancardi,AlbertoFarinelli,IsabellaIT UNIPARTHENOPE RICA UNIMARC000002241NAVA1658-M/373409420001211Marketing strategico197036UNIPARTHENOPE05061nam 2200625 450 99646608580331620220113145520.03-662-21551-910.1007/978-3-662-21551-7(CKB)1000000000233978(SSID)ssj0000326347(PQKBManifestationID)11268655(PQKBTitleCode)TC0000326347(PQKBWorkID)10265663(PQKB)10727523(DE-He213)978-3-662-21551-7(MiAaPQ)EBC6593074(Au-PeEL)EBL6593074(OCoLC)1250084194(EXLCZ)99100000000023397820220113d1993 uy 0engurnn|008mamaatxtccrRewriting techniques and applications 5th international conference, RTA-93, Montreal, Canada, June 16-18, 1993 : proceedings /Claude Kirchner, editor1st ed. 1993.Berlin, Germany ;New York, New York :Springer-Verlag,[1993]©19931 online resource (XI, 492 p.) Lecture Notes in Computer Science,0302-9743 ;690Bibliographic Level Mode of Issuance: Monograph3-540-56868-9 Includes bibliographical references and index.Rewrite techniques in theorem proving -- Redundancy criteria for constrained completion -- Bi-rewriting, a term rewriting technique for monotonic order relations -- A case study of completion modulo distributivity and Abelian groups -- A semantic approach to order-sorted rewriting -- Distributing equational theorem proving -- On the correctness of a distributed memory Gröbner basis algorithm -- Improving transformation systems for general E-unification -- Equational and membership constraints for infinite trees -- Regular path expressions in feature logic -- Proving properties of typed lambda terms: Realizability, covers, and sheaves -- Some lambda calculi with categorical sums and products -- Paths, computations and labels in the ?-calculus -- Confluence and superdevelopments -- Relating graph and term rewriting via Böhm models -- Topics in termination -- Total termination of term rewriting -- Simple termination is difficult -- Optimal normalization in orthogonal term rewriting systems -- A graph reduction approach to incremental term rewriting -- Generating tables for bottom-up matching -- On some algorithmic problems for groups and monoids -- Combination techniques and decision problems for disunification -- The negation elimination from syntactic equational formula is decidable -- Encompassment properties and automata with constraints -- Recursively defined tree transductions -- AC complement problems: Satisfiability and negation elimination -- A precedence-based total AC-compatible ordering -- Extension of the associative path ordering to a chain of associative commutative symbols -- Polynomial time termination and constraint satisfaction tests -- Linear interpretations by counting patterns -- Some undecidable termination problems for semi-Thue systems -- Saturation of first-order (constrained) clauses with the Saturate system -- MERILL: An equational reasoning system in standard ML -- Reduce the redex ? ReDuX -- Agg — An implementation of algebraic graph rewriting -- Smaran: A congruence-closure based system for equational computations -- LAMBDALG: Higher order algebraic specification language -- More problems in rewriting.This volume contains the proceedings of RTA-93, the fifth International Conference on Rewriting Techniques and Applications, held in Montreal, Canada, in June 1993. The volume includes three invited lectures, "Rewrite techniques in theorem proving" (L. Bachmair), "Proving properties of typed lambda terms: realizability, covers, and sheaves" (J. Gallier), and "On some algorithmic problems for groups and monoids" (S.J. Adian), together with 29 selected papers, 6 system descriptions, and a list of open problems in the field. The papers covermany topics: term rewriting; termination; graph rewriting; constraint solving; semantic unification, disunification and combination; higher-order logics; and theorem proving, with several papers on distributed theorem proving, theorem proving with constraints and completion.Lecture Notes in Computer Science,0302-9743 ;690Rewriting systems (Computer science)CongressesComputer programmingCongressesAlgorithmsCongressesElectronic books.Rewriting systems (Computer science)Computer programmingAlgorithms005.13/1Kirchner ClaudeInternational Conference on Rewriting Techniques and ApplicationsMiAaPQMiAaPQMiAaPQBOOK996466085803316Rewriting Techniques and Applications774195UNISA