二十国集团国家计算机程序算法的可专利性

A. Matveev, E. Martyanova
{"title":"二十国集团国家计算机程序算法的可专利性","authors":"A. Matveev, E. Martyanova","doi":"10.21684/2412-2343-2022-9-3-144-173","DOIUrl":null,"url":null,"abstract":"Ubiquitous computerization and digitalization are contributing to the unprecedented growth of the software market. Computer programs are protected as subject of copyright law in international law and domestic legal systems. However, copyright law does not protect the interests of the copyright holder from borrowing ideas and algorithms which often have agreat commercial value. This circumstance has prompted the legal science and law enforcement practice of the most developed states to justify the possibility of protecting computer programs and their algorithms. The leading states chosen for in this paper are the G20 states. The relevance of this choice is due to the following: 1) The G20 states account for 86% of global GDP; 2) All world leaders in computer software development are G20 members; 3) All BRICS states are G20 members; 4) The law-and-orders of the G20 states are relevant to all existing traditions of the legal protection of intellectual property in the world. The legal systems of the G20 states follow one of three approaches according to the criterion of patentability of computer programs and their algorithms. We call the first approach “neutral.” It includes States which legislation does not explicitly prohibit the patenting of computer programs, but computer programs themselves are not mentioned among the subject matters of inventions. The second (“positive”) approach includes those states which legislation explicitly classifies computer programs as patentable inventions. On the contrary, the third (“negating”) approach includes states where it is legally established that computer programs as such are unpatentable. The results of the research demonstrate that there is no direct correlation between the way of solving the issue of patentability of computer program algorithms in different legal systems and the state’s place in the global IT market. For example, the United States and China take aneutral approach, Japan takes apositive approach, the EU Member States and India take anegating approach. We believe that the most flexible approach is aneutral approach from the point of view of patent law policy. The most liberal and consistent approach is the positive approach presented by the Japanese legal system. Finally, the negating approach is the most controversial and at the same time widespread among the G20 and BRICS states.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Patentability of Computer Program Algorithms in the G20 States\",\"authors\":\"A. Matveev, E. Martyanova\",\"doi\":\"10.21684/2412-2343-2022-9-3-144-173\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ubiquitous computerization and digitalization are contributing to the unprecedented growth of the software market. Computer programs are protected as subject of copyright law in international law and domestic legal systems. However, copyright law does not protect the interests of the copyright holder from borrowing ideas and algorithms which often have agreat commercial value. This circumstance has prompted the legal science and law enforcement practice of the most developed states to justify the possibility of protecting computer programs and their algorithms. The leading states chosen for in this paper are the G20 states. The relevance of this choice is due to the following: 1) The G20 states account for 86% of global GDP; 2) All world leaders in computer software development are G20 members; 3) All BRICS states are G20 members; 4) The law-and-orders of the G20 states are relevant to all existing traditions of the legal protection of intellectual property in the world. The legal systems of the G20 states follow one of three approaches according to the criterion of patentability of computer programs and their algorithms. We call the first approach “neutral.” It includes States which legislation does not explicitly prohibit the patenting of computer programs, but computer programs themselves are not mentioned among the subject matters of inventions. The second (“positive”) approach includes those states which legislation explicitly classifies computer programs as patentable inventions. On the contrary, the third (“negating”) approach includes states where it is legally established that computer programs as such are unpatentable. The results of the research demonstrate that there is no direct correlation between the way of solving the issue of patentability of computer program algorithms in different legal systems and the state’s place in the global IT market. For example, the United States and China take aneutral approach, Japan takes apositive approach, the EU Member States and India take anegating approach. We believe that the most flexible approach is aneutral approach from the point of view of patent law policy. The most liberal and consistent approach is the positive approach presented by the Japanese legal system. Finally, the negating approach is the most controversial and at the same time widespread among the G20 and BRICS states.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2022-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21684/2412-2343-2022-9-3-144-173\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21684/2412-2343-2022-9-3-144-173","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

无处不在的计算机化和数字化正在促进软件市场空前的增长。在国际法和国内法律体系中,计算机程序作为版权法的主体受到保护。然而,版权法并没有保护版权所有者的利益,因为他们可以借鉴具有巨大商业价值的创意和算法。这种情况促使最发达国家的法律科学和执法实践证明,保护计算机程序及其算法的可能性是合理的。本文选择的主要国家是G20国家。这一选择的相关性在于:1)G20国家占全球GDP的86%;2)计算机软件开发领域的全球领导者均为G20成员;3)金砖国家均为二十国集团成员;4) G20国家的法律和秩序与世界上所有现有的知识产权法律保护传统相关。根据计算机程序及其算法的可专利性标准,G20国家的法律体系遵循三种方法中的一种。我们称第一种方法为“中立”。它包括那些立法没有明确禁止计算机程序的专利,但计算机程序本身没有在发明的主题中提及的国家。第二种(“积极”)方法包括那些立法明确将计算机程序归类为可申请专利的发明的州。相反,第三种(“否定”)方法包括在法律上确定计算机程序本身不可授予专利的州。研究结果表明,不同法系解决计算机程序算法可专利性问题的方式与国家在全球IT市场中的地位之间没有直接关联。例如,美国和中国采取中立态度,日本采取积极态度,欧盟成员国和印度采取否定态度。我们认为,从专利法政策的角度来看,最灵活的方法是中立的方法。最自由和一致的方法是日本法律制度所呈现的积极方法。最后,否定的方法是最有争议的,同时在G20和金砖国家中也很普遍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
Patentability of Computer Program Algorithms in the G20 States
Ubiquitous computerization and digitalization are contributing to the unprecedented growth of the software market. Computer programs are protected as subject of copyright law in international law and domestic legal systems. However, copyright law does not protect the interests of the copyright holder from borrowing ideas and algorithms which often have agreat commercial value. This circumstance has prompted the legal science and law enforcement practice of the most developed states to justify the possibility of protecting computer programs and their algorithms. The leading states chosen for in this paper are the G20 states. The relevance of this choice is due to the following: 1) The G20 states account for 86% of global GDP; 2) All world leaders in computer software development are G20 members; 3) All BRICS states are G20 members; 4) The law-and-orders of the G20 states are relevant to all existing traditions of the legal protection of intellectual property in the world. The legal systems of the G20 states follow one of three approaches according to the criterion of patentability of computer programs and their algorithms. We call the first approach “neutral.” It includes States which legislation does not explicitly prohibit the patenting of computer programs, but computer programs themselves are not mentioned among the subject matters of inventions. The second (“positive”) approach includes those states which legislation explicitly classifies computer programs as patentable inventions. On the contrary, the third (“negating”) approach includes states where it is legally established that computer programs as such are unpatentable. The results of the research demonstrate that there is no direct correlation between the way of solving the issue of patentability of computer program algorithms in different legal systems and the state’s place in the global IT market. For example, the United States and China take aneutral approach, Japan takes apositive approach, the EU Member States and India take anegating approach. We believe that the most flexible approach is aneutral approach from the point of view of patent law policy. The most liberal and consistent approach is the positive approach presented by the Japanese legal system. Finally, the negating approach is the most controversial and at the same time widespread among the G20 and BRICS states.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1