{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T02:27:46Z","timestamp":1673404066514},"publisher-location":"Berlin, Heidelberg","reference-count":75,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540189282","type":"print"},{"value":"9783540388500","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-18928-9_4","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:50:26Z","timestamp":1330199426000},"page":"38-51","source":"Crossref","is-referenced-by-count":1,"title":["Current trends in rewriting techniques and related problems"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Lescanne","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"4_CR1","series-title":"Technical Report","volume-title":"Critical Pair Criteria for the Knuth-Bendix Completion Procedure","author":"L. Bachmair","year":"1986","unstructured":"L. Bachmair and N. Dershowitz. Critical Pair Criteria for the Knuth-Bendix Completion Procedure. Technical Report, Department of Computer Science, U. Illinois, Urbana-Champaign, 1986."},{"key":"4_CR2","unstructured":"L. Bachmair, N. Dershowitz, and J. Hsiang. Orderings for equational proofs. In Proc. 1st IEEE Symp. Logic in Computer Science, Cambridge, Massachussetts, June 1986."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"L. Bachmair and D.A. Plaisted. Termination orderings for associative-commutative rewriting systems. Journal of Symbolic Computation, 1985.","DOI":"10.1016\/S0747-7171(85)80019-5"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"F. Bellegarde and P. Lescanne. Transformation ordering. In 12th Coll. on Trees in Algebra and Programming, TAPSOFT, Springer Verlag, 1987.","DOI":"10.1007\/3-540-17660-8_48"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"A. BenCherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 1987.","DOI":"10.1016\/0167-6423(87)90030-X"},{"key":"4_CR6","unstructured":"A. Colmerauer. Equations and inequations on finite and infinite trees. In Proc. FGCS'84, pages 85\u201399, November 1984."},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/3-540-16780-3_85","volume-title":"Sufficient completeness, term rewriting system and anti-unification","author":"H. Comon","year":"1986","unstructured":"H. Comon. Sufficient completeness, term rewriting system and anti-unification. In J. Siekmann, editor, Proc. 8th Conference on Automated Deduction, Oxford, pages 128\u2013140, Springer Verlag, Lecture Notes in Computer Science, Oxford (England), 1986."},{"key":"4_CR8","unstructured":"G. Cousineau, L. Paulson, G. Huet, R. Milner, M. Gordon, and C. Wadsworth. The ML Handbook. INRIA, Rocquencourt, May 1985."},{"key":"4_CR9","unstructured":"M. Dauchet, T. Heuillard, P. Lescanne, and S. Tison. Decidability of the confluence of ground term rewriting systems. In Proc. 2nd IEEE Symp. on Logic In Computer Science, Ithaca, New York, 1987."},{"key":"4_CR10","series-title":"Technical Report","volume-title":"Applications of the Knuth-Bendix Completion Procedure","author":"N. Dershowitz","year":"1983","unstructured":"N. Dershowitz. Applications of the Knuth-Bendix Completion Procedure. Technical Report ATR-83(8478), Laboratory Operation, Aerospace Corporation, El Segundo, CA 90245, May 1983."},{"key":"4_CR11","volume-title":"Proc. Colloquium on Resolution of Equations in Algebraic Structures","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz. Completion and its applications. In Proc. Colloquium on Resolution of Equations in Algebraic Structures, MCC, 3500 West Balconies Center Drive, Austin, Texas 787596509, May 4\u20136 1987."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279\u2013301, 1982.","journal-title":"Theoretical Computer Science"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"L. Fribourg. A strong restriction of the completion procedure for theories with constructors. In L. Kott, editor, Int. Coll. on Automata Languages and Programming, Springer Verlag, Lecture Notes in Computer Science, 1986.","DOI":"10.1007\/3-540-16761-7_60"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"J.H. Gallier and W. Snyder. A general complete E-unification procedure. In P. Lescanne, editor, 2nd Conf. on Rewriting Techniques and Applications, Springer Verlag, Lecture Notes in Computer Science, 1987.","DOI":"10.1007\/3-540-17220-3_19"},{"key":"4_CR15","first-page":"286","volume":"87","author":"H. Ganzinger","year":"1987","unstructured":"H. Ganzinger. Ground term confluence in parametric conditional equational specifications. In F.J. Brandenburg, G. Vidal-Naquet, and M. Wirsing, editors, STACS 87, pages 286\u2013298, Springer Verlag, 1987.","journal-title":"STACS"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Proving termination of associative rewriting systems by rewriting","author":"I. Gnaedig","year":"1986","unstructured":"I. Gnaedig and P. Lescanne. Proving termination of associative rewriting systems by rewriting. In J. Siekmann, editor, Proc. 8th Conference on Automated Deduction, Oxford, Springer Verlag, Lecture Notes in Computer Science, Oxford (England), 1986."},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"J. Goguen, C. Kirchner, and J. Meseguer. Concurrent term rewriting as a model of computation. In Graph reduction Workshop, Santa Fe, NM, September 1986.","DOI":"10.1007\/3-540-18420-1_50"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"J.A. Goguen. How to prove algebraic inductive hypotheses without induction, with applications to the correctness of data type implementation. In W. Bibel and Kowalski, editors, Proc. 5th Conf. on Automated Deduction, pages 356\u2013373, Springer Verlag, Lecture Notes in Computer Science, 1980.","DOI":"10.1007\/3-540-10009-1_27"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"A. Herold. Combination of unification algorithms. In Proc. 8th Conference on Automated Deduction, Oxford, pages 450\u2013469, Springer Lecture Notes in Computer Science 230, 1986.","DOI":"10.1007\/3-540-16780-3_111"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"S. H\u00f6lldobler. A unification algorithm for confluent theories. In 14th Int. Coll. on Automata, Languages and Programming, 1987.","DOI":"10.1007\/3-540-18088-5_4"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"J. Hsiang and M. Rusinowitch. On word problems in equational theories. In Int. Coll. on Automata Languages and Programming, 1987.","DOI":"10.1007\/3-540-18088-5_6"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0022-0000(81)90002-7","volume":"23","author":"G. Huet","year":"1981","unstructured":"G. Huet. A complete proof of correctness of the Knuth and Bendix completion algorithm. Journal of Computer Systems and Sciences, 23:11\u201321, 1981.","journal-title":"Journal of Computer Systems and Sciences"},{"key":"4_CR23","unstructured":"G. Huet. Formal Structures for Computation and Deduction. Technical Report, INRIA, May 1986."},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0022-0000(82)90006-X","volume":"25","author":"G. Huet","year":"1982","unstructured":"G. Huet and J.M. Hullot. Proofs by induction in equational theories with constructors. J. Comp. Sys. Sc., 25:239\u2013266, 1982.","journal-title":"J. Comp. Sys. Sc."},{"key":"4_CR25","unstructured":"G. Huet and J.J. Levy. Call By Need Computations in Non-Ambiguous Linear Term Rewriting Systems. Technical Report 359, Laboria, August 1979."},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-10009-1_25","volume-title":"Canonical forms and unification","author":"J. M. Hullot","year":"1980","unstructured":"J.M. Hullot. Canonical forms and unification. In Proc. of the 5th Conf. on Automated Deduction, pages 318\u2013334, Springer Verlag, Lecture Notes in Computer Science, Les Arcs, France, July 1980."},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"H. Hussmann. Unification in conditional equational theories. In Proc. of EUROCAL, Springer Verlag, 1985.","DOI":"10.1007\/3-540-15984-3_328"},{"key":"4_CR28","unstructured":"J. P. Jouannaud and B. Waldmann. Reductive conditional term rewriting systems. In Proc. 3rd IFIP Conf. on Formal Description of Programming Concepts, Lyngby (Danemark), 1986."},{"issue":"4","key":"4_CR29","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J. P. Jouannaud","year":"1986","unstructured":"J.P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal on Computing, 15(4):1155\u20131194, 1986.","journal-title":"SIAM Journal on Computing"},{"key":"4_CR30","volume-title":"Proc. 1rst IEEE Symp. on Logic in Computer Science","author":"J. P. Jouannaud","year":"1986","unstructured":"J.P. Jouannaud and E. Kounalis. Proofs by induction in equational theories without constructors. In Proc. 1rst IEEE Symp. on Logic in Computer Science, IEEE, Cambridge, Massachusetts, (USA), 1986."},{"key":"4_CR31","unstructured":"J.P. Jouannaud, P. Lescanne, and F. Reinig. Recursive decomposition ordering. In Bjorner D., editor, Formal Description of Programming Concepts 2, pages 331\u2013346, North Holland, Garmish Partenkirschen, RFA, 1982."},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"S. Kaplan. Fair Conditional Term Rewriting Systems: Unification, Termination and Confluence. Technical Report, U. of Paris Sud, Orsay, Orsay, 1984. Conditional rewriting.","DOI":"10.1007\/978-3-662-09691-8_11"},{"key":"4_CR33","volume-title":"Proc. Colloquium on Resolution of Equations in Algebraic Structures","author":"S. Kaplan","year":"1987","unstructured":"S. Kaplan and J-L. Remy. Completion algorithms for conditional rewriting systems. In Proc. Colloquium on Resolution of Equations in Algebraic Structures, MCC, 3500 West Balconies Center Drive, Austin, Texas 78759-6509, May 4\u20136 1987."},{"issue":"2","key":"4_CR34","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0004-3702(87)90017-8","volume":"31","author":"D. Kapur","year":"1987","unstructured":"D. Kapur and D.R. Musser. Proof by consistency. Artificial Intelligence, 31(2):125\u2013157, 1987.","journal-title":"Artificial Intelligence"},{"key":"4_CR35","unstructured":"C. Kirchner. Computing unification algorithms. In Proc. 1st IEEE Symp. on Logic in Computer Science, Boston (USA), pages 206\u2013216, 1986."},{"key":"4_CR36","unstructured":"C. Kirchner, M\u00e9thodes et outils de conception syst\u00e9matique d'algorithmes d'unification dans les th\u00e9ories \u00e9quationnelles. PhD thesis, Universit\u00e9 de Nancy 1, 1985."},{"key":"4_CR37","unstructured":"C. Kirchner, editor. Proceedings on a workshop on Unification. Centre de Recherche en Informatique de Nancy, BP 239, 54506 Vand\u0153uvre-les-Nancy, France, 1987."},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"C. Kirchner and H. Kirchner. Reveur-3 the implementation of a general completion procedure parametrized by built in theories and strategies. Science for Computer Programming, 20, 1986.","DOI":"10.1016\/0167-6423(87)90004-9"},{"key":"4_CR39","unstructured":"C. Kirchner and P. Lescanne. Solving disequations. In Proc. 2nd Symp. on Logic in Computer Science, 1987."},{"key":"4_CR40","series-title":"Lecture Notes in Computer Science","volume-title":"A general inductive completion algorithm and abstract data types","author":"H. Kirchner","year":"1984","unstructured":"H. Kirchner. A general inductive completion algorithm and abstract data types. In Proc. 7th international Conference on Automated Deduction, Springer Verlag, Lecture Notes in Computer Science, Napa Valley (California, USA), 1984."},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"D. Knuth and P. Bendix. Simple Word Problems in Universal Algebras, pages 263\u2013297. Pergamon Press, 1970.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"4_CR42","unstructured":"E. Kounalis. Validation de sp\u00e9cifications alg\u00e9briques par compl\u00e9tion inductive. PhD thesis, Universit\u00e9 de Nancy 1, 1985."},{"key":"4_CR43","volume-title":"Equational Completion by Proof Transformation","author":"W. K\u00fcchlin","year":"1986","unstructured":"W. K\u00fcchlin. Equational Completion by Proof Transformation. PhD thesis, Swiss Federal Institute of Technology (ETH), CH-8092 Zurich, Switzerland, June 1986."},{"key":"4_CR44","unstructured":"W. K\u00fcchlin. Inductive Completion by Proof Transformation. Technical Report 87-08, Computer and Information Sciences, University Deleware, February 1987."},{"key":"4_CR45","series-title":"Technical Report","volume-title":"A simple explanation of inductionless induction","author":"D. S. Lankford","year":"1981","unstructured":"D.S. Lankford. A simple explanation of inductionless induction. Technical Report, Lousiana Tech, Ruston (Louisiana), 1981."},{"key":"4_CR46","series-title":"Technical Report","volume-title":"Lazy pattern matching","author":"A. Laville","year":"1987","unstructured":"A. Laville. Lazy pattern matching. Technical Report, U. of Reims, France, 1987."},{"key":"4_CR47","unstructured":"A. Lazrek, P. Lescanne, and J-J. Thiel. Proving inductive equalities, Algorithms and Implementation. Technical Report, CRIN 86-R-087, Centre de Recherche en Informatique de Nancy, 1986."},{"key":"4_CR48","first-page":"80","volume":"30","author":"P. Lescanne","year":"1986","unstructured":"P. Lescanne. Divergence of the Knuth-Bendix procedure and termination orderings. Bull. EATCS, 30:80\u201383, October 1986.","journal-title":"Bull. EATCS"},{"key":"4_CR49","doi-asserted-by":"crossref","unstructured":"P. Lescanne, editor. Rewriting Techniques and Applications. Volume 256, Springer Verlag, May 1987.","DOI":"10.1007\/3-540-17220-3"},{"key":"4_CR50","volume-title":"Proc. Colloquium on Resolution of Equations in Algebraic Structures","author":"A. Martelli","year":"1987","unstructured":"A. Martelli, C. Moiso, and G-F. Rossi. Lazy unification algorithms for canonical rewrite systems. In Proc. Colloquium on Resolution of Equations in Algebraic Structures, MCC, 3500 West Balconies Center Drive, Austin, Texas 78759-6509, May 4\u20136 1987."},{"issue":"2","key":"4_CR51","first-page":"258","volume":"4","author":"A. Martelli","year":"1982","unstructured":"A. Martelli and U. Montanari. An efficient unification algorithm. ACM T.O.P.L.A.S, 4(2):258\u2013282, 1982.","journal-title":"ACM T.O.P.L.A.S"},{"key":"4_CR52","doi-asserted-by":"crossref","unstructured":"D. L. Musser. On proving inductive properties of abstract data types. Proc. of the 7th Annual Acm Symposium on Principles of Programming Languages, 154\u2013162, 1980.","DOI":"10.1145\/567446.567461"},{"key":"4_CR53","first-page":"243","volume-title":"Proc. Hardware and Software Components and Architectures for 5th Generation","author":"J. Mazali","year":"1985","unstructured":"J. Mazali. Filtrage associatif, commutatif ou idempotent. In Proc. Hardware and Software Components and Architectures for 5th Generation, pages 243\u2013258, AFCET, Paris (France), March 1985."},{"key":"4_CR54","unstructured":"J. Mzali. M\u00e9thodes de filtrage \u00e9quationnel et de preuve automatique de th\u00e9or\u00e8mes. PhD thesis, Universit\u00e9 de Nancy 1, September 1986."},{"issue":"2","key":"4_CR55","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M. H. A. A. Newman","year":"1942","unstructured":"M. H. A. Newman. On theories with a combinatorial definition of Equivalence. Annals of Math, 43(2):223\u2013243, 1942.","journal-title":"Annals of Math"},{"key":"4_CR56","unstructured":"M. J. O'Donnell. Equational Logic as a Programming Language. Foundations of Computing, MIT Press, 1985."},{"key":"4_CR57","doi-asserted-by":"crossref","unstructured":"M. Oyamaguchi. The Church-Rosser Property for Ground Term Rewriting Systems is Decidable. Technical Report, Faculty of Engineering, Mie University, Tsu 514, Japan, 1987.","DOI":"10.1016\/0304-3975(87)90100-9"},{"key":"4_CR58","unstructured":"M. Oyamaguchi. Sufficient sequentiality: a decidable condition for call-by-need computations in term rewriting systems. COMP86-38, 1986."},{"key":"4_CR59","unstructured":"E. Paul. Proof by induction in equational theories with relations between constructors. In B. Courcelle, editor, Proc. 9th Colloquium on trees in Algebra and Programming, pages 210\u2013225, Cambridge University Press, 1984."},{"issue":"2","key":"4_CR60","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G. Peterson","year":"1981","unstructured":"G. Peterson and M. Stickel. Complete sets of reduction for equational theories with complete unification algorithms. J. of ACM, 28(2):233\u2013264, 1981.","journal-title":"J. of ACM"},{"key":"4_CR61","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/S0019-9958(85)80005-X","volume":"65","author":"D. Plaisted","year":"1985","unstructured":"D. Plaisted. Semantic confluence and completion method. Information and Control, 65:182\u2013215, 1985.","journal-title":"Information and Control"},{"key":"4_CR62","unstructured":"G. Plotkin. Lattice-Theoretic Properties of Subsumption. Technical Report Memo Mip-R-77, U. of Edinburgh, 1970."},{"key":"4_CR63","unstructured":"L. Puel. Ensembles in\u00e9vitables d'arbres et applications \u00e0 la g\u00e9n\u00e9ralisation du th\u00e9or\u00e8me de Kruskal. C.R. Acad. Sc. Paris, serie I, 301(18), 1985."},{"key":"4_CR64","unstructured":"L. Puel. Proof in the final algebra. In B. Courcelle, editor, Proc. 9th Coll. on Trees in Algebra and Programming, pages 227\u2013242, Cambridge University Press, 1984."},{"key":"4_CR65","series-title":"Technical Report","volume-title":"Using Unavoidable Sets of Trees to Generalize Kruskal's Theorem","author":"L. Puel","year":"1986","unstructured":"L. Puel. Using Unavoidable Sets of Trees to Generalize Kruskal's Theorem. Technical Report, Laboratoire d'Informatique de l'Ecole Normale Sup\u00e9rieure, Paris, 1986."},{"key":"4_CR66","doi-asserted-by":"crossref","unstructured":"P. W. Purdom and C. A. Brown. Fast many-to-one matching algorithn. In Proc. 1rst Conf. Rewriting Techniques and Applications, pages 407\u2013416, Springer Verlag, Lecture Notes in Computer Science, May 1985.","DOI":"10.1007\/3-540-15976-2_21"},{"key":"4_CR67","doi-asserted-by":"crossref","unstructured":"P. R\u00e9ty. Improving basic narrowing techniques and commutation properties. In 2nd International Conference on Rewriting Techniques and Applications, 1987.","DOI":"10.1007\/3-540-17220-3_20"},{"key":"4_CR68","unstructured":"P. R\u00e9ty, C. Kirchner, H. Kirchner, and P. Lescanne. An algorithm for unification based on narrowing. Technical Report 86-R-131, Centre de Recherche en Informatique de Nancy, 1986."},{"key":"4_CR69","unstructured":"G. Smolka and W. Nutt. Order-sorted equational computation. In H. Ait-Kaci, editor, Coll. on Resolution of Equations in Algebraic Structure, Austin, Texas, 1987."},{"key":"4_CR70","doi-asserted-by":"crossref","unstructured":"E. Tid\u00e8n. Unification in combinations of collapse-free theories with disjoint sets of function symbols. In Proc. 8th Conference on Automated Deduction, Oxford, pages 431\u2013449, Springer Verlag, Lecture Notes in Computer Science, 1986.","DOI":"10.1007\/3-540-16780-3_110"},{"key":"4_CR71","unstructured":"Y. Toyama. Contrexamples to termination for the direct sum of term rewriting systems. 1986."},{"key":"4_CR72","doi-asserted-by":"crossref","unstructured":"Y. Toyama. On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the ACM, 1986.","DOI":"10.1145\/7531.7534"},{"key":"4_CR73","doi-asserted-by":"crossref","unstructured":"F. Winkler and B. Buchberger. A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm. In Colloquium on Algebra, Combinatorics and Logic in Computer Science, Gyor (Hungary), 1983.","DOI":"10.1145\/1089338.1089341"},{"key":"4_CR74","series-title":"Lecture Notes in Computer Science","first-page":"301","volume-title":"Proc. 1st Conference on Rewriting Techniques and Applications","author":"K. Yelick","year":"1985","unstructured":"K. Yelick. Combining unification algorithm for confined equational theories. In Proc. 1st Conference on Rewriting Techniques and Applications, pages 301\u2013324, Springer Verlag, Lecture Notes in Computer Science, Dijon (France), 1985."},{"key":"4_CR75","volume-title":"Proc. 1st Conference on Rewriting Techniques and Applications","author":"H. Zhang","year":"1985","unstructured":"H. Zhang and J-L R\u00e9my. Contextual rewriting. In Proc. 1st Conference on Rewriting Techniques and Applications, page, Springer Verlag, Dijon (France), 1985."}],"container-title":["Trends in Computer Algebra","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18928-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:41Z","timestamp":1605644141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18928-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540189282","9783540388500"],"references-count":75,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-18928-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1988]]}}}