Contract text markup language: A regularization method for extracting legal elements towards smart contracts

被引:0
|
作者
Fan Y. [1 ]
Wang D. [2 ]
Lin H. [1 ]
Chen E. [1 ]
He X. [1 ]
Zhu Y. [1 ]
机构
[1] School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing
[2] College of Control Science and Engineering, Zhejiang University, Hangzhou
关键词
code generation; domain specific language; legal informatics; markup language; smart legal contract;
D O I
10.13374/j.issn2095-9389.2023.01.13.003
中图分类号
学科分类号
摘要
The importance of smart contracts at the legal level is increasing. However, the contract is written in natural language, and the computers cannot process it directly. Thus, accurately understanding contract content and meaning representation remains challenging. This problem leads to a lack of regularization in generating smart contract programs and legal recognition and effectiveness. Therefore, it is necessary to develop a new approach to transform real-life legal contracts into smart contract programs and ensure the regularization of legal element extraction and program conversion. In this paper, we propose a contract text markup language (CTML), which is a normative computer processing language for expressing meaning in legal contracts. A method for regulating the content and meaning representation of legal contract text is established by annotating the content and meaning representation of the syntax, structure, and vocabulary in the contract using CTML to achieve the extraction and conversion of contract elements. First, a contract metamodel of CTML, which includes a three-layer “element−property−component” semantic structure and metadata markup representation, is established. Thereafter, the contract text information is gradually refined from “large to small” and “coarse to fine” to build the corresponding relationship from real-life contracts to smart legal contracts. Furthermore, the syntax of CTML is designed such that the legal elements can be extracted and regularized to form an annotated contract using CTML. Second, we designed specific conversion rules from CTML to smart legal contract language to generate smart legal contract programs by recursively abstracting syntax trees and establishing a mapping relationship. These rules help users write contracts, improve the efficiency of converting contract text to executable code, and ensure that smart legal contracts are written on solid grounds, thereby improving the conversion chain from legal contracts to executable smart contracts. In addition, considering a factoring contract as an example, we illustrated the details of semantic extraction and code generation. Accordingly, the contract semantic extraction is clearer, the conversion is more normative, and the code development is more effective. Thus, the proposed CTML provides an alternative regularization method to generate smart legal contracts. © 2024 Science Press. All rights reserved.
引用
收藏
页码:109 / 119
页数:10
相关论文
共 29 条
  • [1] Wei S, Dai K M., An analysis of blockchain applications in financial scenarios and an exploration of enterprise software architecture of blockchain as a service(BaaS), J Guangdong Univ Technol, 37, 2, (2020)
  • [2] Guo S F., Blockchain smart contracts in contract law, Orient Law, 3, (2019)
  • [3] Ogilvie J W L., Defining computer program parts under learned hand’s abstractions test in software copyright infringement cases, Mich Law Rev, 91, 3, (1992)
  • [4] Larenz K., Methodenlehre der Rechtswissenschaft, (2013)
  • [5] Chai Z G., Thoughts on contract law of smart contracts under blockchain, Soc Sci Guangdong, 4, (2019)
  • [6] Zhao J W, Ding H J., Regulation the code: The foundations, framework, limitation of computation law, Internet Law Rev, 1, (2016)
  • [7] Zhou X F, Zhao Z H., Parsing computational jurisprudence, Commun CCF, 13, 5, (2017)
  • [8] Chen J D., The legal structure of smart contract, Orient Law, 3, (2019)
  • [9] Liu Q, Wang D J, Wang X X, Et al., Review on conformance between legal contract and smart contract, Appl Res Compute, 38, 1, (2021)
  • [10] Accord [J/OL]