On a Certain Learning Algorithm for Logical Neural Networks
In this paper, we propose an algorithm for constructing variable-valued logical functions in the case of adding new production rules. The algorithm proposed serves as the basis for the method of constructive learning for logical neural networks based on variable-valued predicates.
Saved in:
| Published in | Journal of mathematical sciences (New York, N.Y.) Vol. 260; no. 2; pp. 157 - 162 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
New York
Springer US
01.01.2022
Springer Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1072-3374 1573-8795 1573-8795 |
| DOI | 10.1007/s10958-022-05680-8 |
Cover
| Abstract | In this paper, we propose an algorithm for constructing variable-valued logical functions in the case of adding new production rules. The algorithm proposed serves as the basis for the method of constructive learning for logical neural networks based on variable-valued predicates. |
|---|---|
| AbstractList | In this paper, we propose an algorithm for constructing variable-valued logical functions in the case of adding new production rules. The algorithm proposed serves as the basis for the method of constructive learning for logical neural networks based on variable-valued predicates. In this paper, we propose an algorithm for constructing variable-valued logical functions in the case of adding new production rules. The algorithm proposed serves as the basis for the method of constructive learning for logical neural networks based on variable-valued predicates. Keywords and phrases: variable-valued predicate, variable-valued logical function, learning sample, production rule, logical neural network, constructive learning algorithm. AMS Subject Classification: 68T27 |
| Audience | Academic |
| Author | Dimitrichenko, D. P. |
| Author_xml | – sequence: 1 givenname: D. P. surname: Dimitrichenko fullname: Dimitrichenko, D. P. email: dimdp@rambler.ru organization: Institute of Applied Mathematics and Automation of the Kabardino-Balkar Scientific Center of the Russian Academy of Sciences |
| BookMark | eNqNkU1LAzEQhoMo-PkHPC14Tp3d2WyyeCrFLyh60XNId5M1dZvUZIv03xttUYQiksOE8DzDvJNjsu-804Sc5zDKAfhlzKFmgkJRUGCVACr2yFHOOFLBa7af7sALisjLQ3Ic4xySVAk8IlePLlPZRIdBWZdNtQrOui4b950PdnhZZMaHbOo726g-e9Cr8FWGdx9e4yk5MKqP-mxbT8jzzfXT5I5OH2_vJ-MpbRBLQWdcNTBrOEdEIVrFqqoEyBUqaFVbKjZj2DKDha51hZURBvIy53XRAmrTMjwhuOm7cku1fld9L5fBLlRYyxzkZ365yS9TfvmVX4pkXWysZfBvKx0HOfer4NKgsqgKLNM0aT_fVKd6La0zfgiqWdjYyDGH1BugrBNFd1CddjrtI_2Esen5Fz_awafT6oVtdgrFRmiCjzFo87-E273EBLtOh5-Ef1gfqRCkbA |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media, LLC, part of Springer Nature 2022 COPYRIGHT 2022 Springer Springer Science+Business Media, LLC, part of Springer Nature 2022. |
| Copyright_xml | – notice: Springer Science+Business Media, LLC, part of Springer Nature 2022 – notice: COPYRIGHT 2022 Springer – notice: Springer Science+Business Media, LLC, part of Springer Nature 2022. |
| DBID | AAYXX CITATION ADTOC UNPAY |
| DOI | 10.1007/s10958-022-05680-8 |
| DatabaseName | CrossRef Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1573-8795 |
| EndPage | 162 |
| ExternalDocumentID | 10.1007/s10958-022-05680-8 A701000049 10_1007_s10958_022_05680_8 |
| GroupedDBID | -52 -5D -5G -BR -EM -Y2 -~C -~X .86 .VR 06D 0R~ 0VY 1N0 1SB 2.D 29L 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 642 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFFNX AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AZFZN B-. B0M BA0 BAPOH BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP EAD EAP EAS EBLON EBS EIOEI EJD EMK EPL ESBYG ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG6 HMJXF HQYDN HRMNR HVGLF HZ~ IAO IEA IHE IJ- IKXTQ IOF ISR ITC IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C JBSCW JCJTX JZLTJ KDC KOV KOW LAK LLZTM M4Y MA- N2Q NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P9R PF0 PT4 PT5 QOK QOS R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SDD SDH SDM SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 XU3 YLTOR Z7R Z7U Z7X Z7Z Z81 Z83 Z86 Z88 Z8M Z8R Z8T Z8W Z92 ZMTXR ZWQNP ~8M ~A9 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION AEIIB ADTOC UNPAY |
| ID | FETCH-LOGICAL-c3348-b7ac0bc7733388da5664001a3a0dad4a5b53d5f32e9e636f8f0141792d03efd53 |
| IEDL.DBID | UNPAY |
| ISSN | 1072-3374 1573-8795 |
| IngestDate | Tue Aug 19 16:35:11 EDT 2025 Wed Sep 17 23:58:20 EDT 2025 Mon Oct 20 21:52:56 EDT 2025 Thu Jun 12 23:55:19 EDT 2025 Mon Oct 20 16:24:52 EDT 2025 Wed Oct 01 02:23:45 EDT 2025 Fri Feb 21 02:46:25 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | variable-valued logical function production rule 68T27 constructive learning algorithm variable-valued predicate learning sample logical neural network |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3348-b7ac0bc7733388da5664001a3a0dad4a5b53d5f32e9e636f8f0141792d03efd53 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://link.springer.com/content/pdf/10.1007/s10958-022-05680-8.pdf |
| PQID | 2623433357 |
| PQPubID | 2043545 |
| PageCount | 6 |
| ParticipantIDs | unpaywall_primary_10_1007_s10958_022_05680_8 proquest_journals_2623433357 gale_infotracmisc_A701000049 gale_infotracgeneralonefile_A701000049 gale_infotracacademiconefile_A701000049 crossref_primary_10_1007_s10958_022_05680_8 springer_journals_10_1007_s10958_022_05680_8 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 20220100 |
| PublicationDateYYYYMMDD | 2022-01-01 |
| PublicationDate_xml | – month: 1 year: 2022 text: 20220100 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Journal of mathematical sciences (New York, N.Y.) |
| PublicationTitleAbbrev | J Math Sci |
| PublicationYear | 2022 |
| Publisher | Springer US Springer Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer – name: Springer Nature B.V |
| References | ShibzukhovZMConstructive Learning Methods for Neural Networks [in Russian]2006MoscowNauka DimitrichenkoDPApplications of veriable-valued logical functions and neural networks in decision-making systemsVestn. KRAUNC. Fiz.-Mat. Nauki20164-1169310036056381413.68129 L. A. Lyutikova, Modeling and Minimizing Knowledge Bases in Terms of Multivalued Predicate Logic [in Russian], Nalchik (2006). BarskyABLogical Neural Networks [in Russian]2007MoscowINTUIT DimitrichenkoDPApplications of neural networks for improving the efficiency of variable-valued logical functionsVestn. Irkutsk. Tekhn. Univ.2015101051216 S. Haykin, Neural Networks. A Comprehensive Foundation, Prentice Hall, Upper Saddle River, New Jersey (1999). ZM Shibzukhov (5680_CR6) 2006 5680_CR4 DP Dimitrichenko (5680_CR2) 2015; 10 AB Barsky (5680_CR1) 2007 DP Dimitrichenko (5680_CR3) 2016; 4-1 5680_CR5 |
| References_xml | – reference: BarskyABLogical Neural Networks [in Russian]2007MoscowINTUIT – reference: DimitrichenkoDPApplications of neural networks for improving the efficiency of variable-valued logical functionsVestn. Irkutsk. Tekhn. Univ.2015101051216 – reference: ShibzukhovZMConstructive Learning Methods for Neural Networks [in Russian]2006MoscowNauka – reference: S. Haykin, Neural Networks. A Comprehensive Foundation, Prentice Hall, Upper Saddle River, New Jersey (1999). – reference: L. A. Lyutikova, Modeling and Minimizing Knowledge Bases in Terms of Multivalued Predicate Logic [in Russian], Nalchik (2006). – reference: DimitrichenkoDPApplications of veriable-valued logical functions and neural networks in decision-making systemsVestn. KRAUNC. Fiz.-Mat. Nauki20164-1169310036056381413.68129 – volume-title: Logical Neural Networks [in Russian] year: 2007 ident: 5680_CR1 – ident: 5680_CR4 – volume: 10 start-page: 12 issue: 105 year: 2015 ident: 5680_CR2 publication-title: Vestn. Irkutsk. Tekhn. Univ. – volume: 4-1 start-page: 93 issue: 16 year: 2016 ident: 5680_CR3 publication-title: Vestn. KRAUNC. Fiz.-Mat. Nauki – volume-title: Constructive Learning Methods for Neural Networks [in Russian] year: 2006 ident: 5680_CR6 – ident: 5680_CR5 |
| SSID | ssj0007683 |
| Score | 2.2329185 |
| Snippet | In this paper, we propose an algorithm for constructing variable-valued logical functions in the case of adding new production rules. The algorithm proposed... |
| SourceID | unpaywall proquest gale crossref springer |
| SourceType | Open Access Repository Aggregation Database Index Database Publisher |
| StartPage | 157 |
| SubjectTerms | Algorithms Analysis Data mining Machine learning Mathematics Mathematics and Statistics Neural networks |
| SummonAdditionalLinks | – databaseName: SpringerLink Journals (ICM) dbid: U2A link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB50PagH8Ymrq-QgetBA2zRNiqdFFBEfFxe8hUmTrsJaZXdF_Pcmfay7IqKnHhLSdCYz-ZKZ-QpwYKWNmYgNlWEW0RiTkMocLUUHlpmQOjNl1fvNbXLZi68e-ENdFDZqst2bkGTpqaeK3VIuqc8-d5u2DKichwXu6bzcKu5F3Yn_dQC6SqsXEWVuHnWpzM9jzGxH353yVHR0GRbfilf8eMfBYGoDuliFlRo5km6l6jWYs8U6LN9MaFdHG3B6VxAkZ1WUn9TUqX3SHfRfhk_jx2fiECq5rpwd8bQc5aPMAx9tQu_i_P7sktZ_R6CZr56lWmAW6EwI5k6Z0qDDZc4eQ2QYGDQxcs2Z4TmLbGoTluQy9zmdIo1MwGxuONuCVvFS2G0gmukQjQ64ztKYGUSHknJMZS5jnRhp23DcCEm9ViQY6ovu2ItUOZGqUqRKtuHIy1F5CxkPMcM60d-9y3NNqa4Iwupo0obDmZ79imn7p46dmY7OBLLZ5kZlqjbBkYocsIudbLhow0mjxq_m3-Z_MlH1Hz5353-j78JSVK4_f4vTgdZ4-Gb3HK4Z6_1yGX8C-EXqGA priority: 102 providerName: Springer Nature |
| Title | On a Certain Learning Algorithm for Logical Neural Networks |
| URI | https://link.springer.com/article/10.1007/s10958-022-05680-8 https://www.proquest.com/docview/2623433357 https://link.springer.com/content/pdf/10.1007/s10958-022-05680-8.pdf |
| UnpaywallVersion | publishedVersion |
| Volume | 260 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 1573-8795 dateEnd: 20241102 omitProxy: true ssIdentifier: ssj0007683 issn: 1072-3374 databaseCode: ABDBF dateStart: 20030401 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVEBS databaseName: Mathematics Source customDbUrl: eissn: 1573-8795 dateEnd: 20241102 omitProxy: false ssIdentifier: ssj0007683 issn: 1072-3374 databaseCode: AMVHM dateStart: 19970101 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/mathematics-source providerName: EBSCOhost – providerCode: PRVLSH databaseName: SpringerLink Journals customDbUrl: mediaType: online eissn: 1573-8795 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007683 issn: 1072-3374 databaseCode: AFBBN dateStart: 19730101 isFulltext: true providerName: Library Specific Holdings – providerCode: PRVAVX databaseName: SpringerLINK - Czech Republic Consortium customDbUrl: eissn: 1573-8795 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007683 issn: 1072-3374 databaseCode: AGYKE dateStart: 19970101 isFulltext: true titleUrlDefault: http://link.springer.com providerName: Springer Nature – providerCode: PRVAVX databaseName: SpringerLink Journals (ICM) customDbUrl: eissn: 1573-8795 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0007683 issn: 1072-3374 databaseCode: U2A dateStart: 19970101 isFulltext: true titleUrlDefault: http://www.springerlink.com/journals/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3Nb9MwFH_a2gPswPiaKGyVDwgOzF0Sx7GjnbKPMgErHKi0nSJ_pSBKVrWpEPz12HGytdOEQJx88FMSvw_75_i9nwFeGm5iwmKNeagiHIskxLwQBgsLlgnjUum66v18lJyN43cX9GIDTtpamDrbvT2S9DUNjqWprA5mujhYKXxLKccuE90u4DzAfGC7N6GbUIvIO9Adjz5llz7dMMKE1GTMIWUEu7u1m9qZux-0tj7dnqVXjku34N6ynImfP8R0urIiDbfBtGPxiSjfBstKDtSvWzSP_zvYh_Cggawo8z72CDZM-Ri2zq_5XhdP4PBjiQQ69ukFqOFsnaBsOrmaf62-fEcWGqMPfpZFjg-kbuoE9MVTGA9PPx-f4eZaBqxc2S6WTKhAKsaI3d5yLSwgtBNBKIgItNCxoJISTQsSmdQkJCl44ZJJWRrpgJhCU7IDnfKqNM8ASSJDoWVApUpjooWw8KwQKS94LBPNTQ_etMbIZ559I7_hWXZqya1a8lotOe_Ba2ev3IVmNRdKNBUG9l2O5CrPWBD6PVEPXq1JTjzF912Cu2uCNvbUenfrGnkT-4s8sogytrqhrAf7rXVvuv_0_fvXLvUXw33-b-Iv4H5U-5D7fbQLnWq-NHsWUFWyD91seHQ0cu3by_enfdgcR1m_iaLfFJ0WoA |
| linkProvider | Unpaywall |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3Nb9MwFH-C7jB24HuiMMAHBAfmKYmd2BGnatoorB2XVRon6_kjBVGyqU2F4K_HzkfXThNipxxsOfbz-_g5fu8XgDdOOs4Et1TGJqEcs5jKAh1FD5aZkNrYuup9fJoNJ_zzeXreFoUtumz37kqy9tRrxW55KmnIPvdBW0ZU3oUt7g8oSQ-2Bh-_nhytPLCH0E1ivUgo8zNpi2VuHmUjIF13y2v3ozuwvSwv8fcvnM3WQtDxA5h0k28yT34cLCt9YP5c43W87eoewv0Wk5JBo0SP4I4rH8POeEXoungCH76UBMlhkz9AWlLWKRnMphfz79W3n8RjXzJq3CgJhB_1o84wXzyFyfHR2eGQtv9doCbU5VIt0ETaCMH8-VVa9IjPW3qMDCOLlmOqU2bTgiUudxnLClmEbFGRJzZirrAp24VeeVG6Z0A00zFaHaXa5JxZRI-_CsxlIbnOrHR9eN8JX1029Brqikg5iER5kahaJEr24V3YHxVsr5qjwbaEwL8rsFipgYji5tDTh7cbPacNh_dNHfc2OnrjMpvNnSqo1rgXKvGQkXvZpKIP-91uXjX_a_77KxX6j-U-v93or2F7eDYeqdGn05MXcC-pdSl8K9qDXjVfupcePVX6VWssfwGY0goR |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwEB4VKvE4oJaHuhRaH6pyAGuT2Ikd9bQCVkB5HViJmzWOnaXSEla7Qaj_vnaSXXYRQvSUgy3HmfGMP3tmvgD8sNJyJrihMswiyjEJqczRUnRgmQmpM1NVvV9cJic9fnYb385U8VfZ7pOQZF3T4FmairI9NHl7pvAtjSX1mehuA5cBlQvwkXuiBLeie1Fn6osdmK5T7EVEmZtTUzbz-hhzW9NLBz0TKV2F5cdiiH-fcDCY2Yy6n2CtQZGkU6v9M3ywxTqsXkwpWMcb8OuqIEgO64g_aWhU-6Qz6D-M_pR398ShVXJeOz7iKTqqR5UTPt6EXvf45vCENn9KoJmvpKVaYBboTAjmTpzSoMNozjZDZBgYNBxjHTMT5yyyqU1Yksvc53eKNDIBs7mJ2RYsFg-F_QJEMx2i0UGss5Qzg-gQU46pzCXXiZG2BfsTIalhTYihnqmPvUiVE6mqRKpkC_a8HJW3lnKEGTZJ_-5dnndKdUQQ1seUFvyc69mvWbdf67gz19GZQzbfPFGZasxxrCIH8riTTSxacDBR43PzW_M_mKr6HZ-7_X-jf4el66OuOj-9_P0VVqJqKfrLnR1YLEePdtfBnVJ_q1b0PwNT8UA |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Nb9QwEB2V7QF64LtioSAfEByot0kcx444rQpVhWjhwErlZI0_siCWdLWbFYJfjx0n7W5VIRCnHDxK4vGM_RLPewZ47qTLmcgtlanJaI5FSmWFjqIHy0xIbWzLej85LY4n-bszfrYFb3ouTFvt3m9JRk5DUGmqm4O5rQ7WiG8llzRUovsFXCZUjnzzDdguuEfkA9ienH4cf47lhhllrBVjTrlgNJyt3XFnrr_Rxvp0dZZe2y7dgZureo4_f-BstrYiHd0B1_clFqJ8G60aPTK_rsg8_m9n78LtDrKScYyxe7Dl6vuwc3Kh97p8AK8_1ATJYSwvIJ1m65SMZ9Pzxdfmy3fioTF5H2dZEvRA2ktbgL58CJOjt58Oj2l3LAM1gbZLtUCTaCME85-30qIHhH4iSJFhYtHmyDVnllcsc6UrWFHJKhSTijKzCXOV5WwXBvV57R4B0UynaHXCtSlzZhE9PKuwlJXMdWGlG8KrfjDUPKpvqEud5eAW5d2iWrcoOYSXYbxUSM1mgQY7hoF_VhC5UmORpPGbaAgvNiynUeL7OsO9DUOfe2azuQ8N1eX-UmUeUebeN1wMYb8f3cvmP73__kVI_UV3H_-b-RO4lbUxFH4f7cGgWazcUw-oGv2sy5ffVIESpw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=ON+A+CERTAIN+LEARNING+ALGORITHM+FOR+LOGICAL+NEURAL+NETWORKS&rft.jtitle=Journal+of+mathematical+sciences+%28New+York%2C+N.Y.%29&rft.au=Dimitrichenko%2C+D.P&rft.date=2022-01-01&rft.pub=Springer&rft.issn=1072-3374&rft.volume=260&rft.issue=2&rft.spage=157&rft_id=info:doi/10.1007%2Fs10958-022-05680-8&rft.externalDocID=A701000049 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1072-3374&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1072-3374&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1072-3374&client=summon |