{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T03:17:31Z","timestamp":1773717451596,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T00:00:00Z","timestamp":1628726400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T00:00:00Z","timestamp":1628726400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Artif Intell Law"],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we present an informal introduction to Logical English (LE) and illustrate its use to standardise the legal wording of the Automatic Early Termination (AET) clauses of International Swaps and Derivatives Association (ISDA) Agreements. LE can be viewed both as an alternative to conventional legal English for expressing legal documents, and as an alternative to conventional computer languages for automating legal documents. LE is a controlled natural language (CNL), which is designed both to be computer-executable and to be readable by English speakers without special training. The basic form of LE is syntactic sugar for logic programs, in which all sentences have the same standard form, either as rules of the form<jats:italic>conclusion if conditions<\/jats:italic>or as unconditional sentences of the form<jats:italic>conclusion.<\/jats:italic>However, LE extends normal logic programming by introducing features that are present in other computer languages and other logics. These features include typed variables signalled by common nouns, and existentially quantified variables in the<jats:italic>conclusions<\/jats:italic>of sentences signalled by indefinite articles. Although LE translates naturally into a logic programming language such as Prolog or ASP, it can also serve as a neutral standard, which can be compiled into other lower-level computer languages.<\/jats:p>","DOI":"10.1007\/s10506-021-09295-3","type":"journal-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T05:02:53Z","timestamp":1628744573000},"page":"163-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Logical English meets legal English for swaps and derivatives"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1341-8583","authenticated-orcid":false,"given":"Robert","family":"Kowalski","sequence":"first","affiliation":[]},{"given":"Akber","family":"Datoo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,12]]},"reference":[{"issue":"6","key":"9295_CR1","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1017\/S1471068406002778","volume":"6","author":"G Antoniou","year":"2006","unstructured":"Antoniou G, Billington D, Governatori G, Maher MJ (2006) Embedding defeasible logic into logic programming. Theory Pract Logic Progr 6(6):703\u2013735","journal-title":"Theory Pract Logic Progr"},{"key":"9295_CR2","unstructured":"ASD-STE100 (2017) ASD simplified technical english. http:\/\/www.asd-ste100.org\/"},{"issue":"4","key":"9295_CR3","first-page":"911","volume":"8","author":"G Antoniou","year":"2021","unstructured":"Antoniou G, Baryannis G, Batsakis S, Governatori G, Islam MB, Liu Q, Robaldo L, Siragusa G (2021) Large-scale legal reasoning with rules and databases. IfCoLoG J Logic Appl 8(4):911\u2013939","journal-title":"IfCoLoG J Logic Appl"},{"key":"9295_CR4","doi-asserted-by":"crossref","unstructured":"Athan T, Boley H, Governatori G, Palmirani M, Paschke A, and Wyner A (2013) Oasis LegalRuleMl. In proceedings of the fourteenth international conference on artificial intelligence and law pp. 3\u201312","DOI":"10.1145\/2514601.2514603"},{"issue":"9\u201310","key":"9295_CR5","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1016\/j.artint.2011.03.002","volume":"175","author":"JF Baget","year":"2011","unstructured":"Baget JF, Lecl\u00e8re M, Mugnier ML, Salvat E (2011) On rules with existential variables: walking the decidability line. Artif Intell 175(9\u201310):1620\u20131654","journal-title":"Artif Intell"},{"key":"9295_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0743-1066(94)90041-8","volume":"18","author":"J Barklund","year":"1994","unstructured":"Barklund J, Hamfeld A (1994) Hierarchical representation of legal knowledge with metaprogramming in logic. J Logic Program 18:55\u201380","journal-title":"J Logic Program"},{"key":"9295_CR7","doi-asserted-by":"crossref","unstructured":"Bench-Capon TJ, Robinson GO, Routen TW, and Sergot MJ (1987) Logic programming for large scale applications in law: a formalisation of supplementary benefit legislation. In proceedings of the 1st international conference on artificial intelligence and law pp. 190\u2013198","DOI":"10.1145\/41735.41757"},{"key":"9295_CR8","doi-asserted-by":"crossref","unstructured":"Bos J (2008) Wide-coverage semantic analysis with boxer. In Bos J, and Delmonte R (eds) Semantics in text processing. STEP 2008 conference proceedings, research in computational semantics, pp. 277\u2013286. College Publications","DOI":"10.3115\/1626481.1626503"},{"key":"9295_CR9","doi-asserted-by":"crossref","unstructured":"Cal\u00ec A, Gottlob G, Lukasiewicz T, Marnette B, and Pieris A (2010) Datalog+\/-: A family of logical knowledge representation and query languages for new applications. In 2010 25th annual IEEE symposium on logic in computer science pp. 228\u2013242. IEEE","DOI":"10.1109\/LICS.2010.27"},{"key":"9295_CR10","first-page":"1129","volume":"104","author":"SJ Choi","year":"2005","unstructured":"Choi SJ, Gulati GM (2005) Contract as statute. Mich l Rev 104:1129","journal-title":"Mich l Rev"},{"key":"9295_CR11","unstructured":"Clack CD (2021) Languages for smart and computable contracts. https:\/\/arxiv.org\/abs\/2104.03764"},{"key":"9295_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/9781119357216","volume-title":"Legal data for banking: business optimisation and regulatory compliance","author":"A Datoo","year":"2019","unstructured":"Datoo A (2019) Legal data for banking: business optimisation and regulatory compliance. John Wiley & Sons"},{"key":"9295_CR13","doi-asserted-by":"crossref","unstructured":"Datoo A, and Clack CD (2021) Smart close-out netting. J Secur Oper 13\u2013To appear in July 2021","DOI":"10.69554\/KYOQ7901"},{"key":"9295_CR14","unstructured":"Davila J (2017) Rock, paper, scissors. http:\/\/demo.logicalcontracts.com\/example\/RockPaperScissorsBaseEN.pl"},{"key":"9295_CR15","unstructured":"Devlin J, Chang MW, Lee K, and Toutanova K (2018) Bert: pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805"},{"key":"9295_CR16","volume-title":"Lexon bible: hitchhiker\u2019s guide to digital contracts","author":"H Diedrich","year":"2020","unstructured":"Diedrich H (2020) Lexon bible: hitchhiker\u2019s guide to digital contracts. Wildfire Publishing"},{"key":"9295_CR17","unstructured":"Fu Z (2020) Logical english (LE) for representing legal documents, MSc thesis. Imperial college London"},{"key":"9295_CR18","unstructured":"Fuchs NE (2013) Attempto project. http:\/\/attempto.ifi.uzh.ch\/site\/"},{"key":"9295_CR19","first-page":"75","volume-title":"CNL","author":"NE Fuchs","year":"2018","unstructured":"Fuchs NE (2018) Understanding texts in attempto controlled english. CNL. pp 75\u201384"},{"key":"9295_CR20","unstructured":"Fuchs NE, and Schwitter R (1995) Specifying logic programs in controlled natural language. In CLNLP 95, workshop on computational logic for natural language processing, Edinburgh"},{"key":"9295_CR21","unstructured":"Fuchs NE, and Schwitter R (1996) Attempto controlled english (ace). In EMISA workshop nat\u00fcrlichsprachlicher entwurf von informationssystemen\u2013grundlagen, methoden, Werkzeuge, Anwendungen, Ev. Akademie Tutzing"},{"key":"9295_CR22","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-85658-0_3","volume-title":"Reasoning web","author":"NE Fuchs","year":"2008","unstructured":"Fuchs NE, Kaljurand K, Kuhn T (2008) Attempto controlled english for knowledge representation. Reasoning web. Springer, Berlin, Heidelberg, pp 104\u2013124"},{"key":"9295_CR23","unstructured":"Genesereth M (2015) Computational law: the cop in the backseat. In third annual futurelaw conference"},{"key":"9295_CR24","first-page":"282","volume-title":"Rule representation, interchange and reasoning on the web","author":"TF Gordon","year":"2009","unstructured":"Gordon TF, Governatori G, Rotolo A (2009) Rules and norms: requirements for rule interchange languages in the legal domain. In: Governatori G, Hall J, Paschke A (eds) Rule representation, interchange and reasoning on the web. Springer, pp 282\u2013296"},{"issue":"1","key":"9295_CR25","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10579-016-9338-7","volume":"51","author":"SC Guy","year":"2017","unstructured":"Guy SC, Schwitter R (2017) The PENG ASP system: architecture, language and authoring tool. Lang Resour Eval 51(1):67\u201392","journal-title":"Lang Resour Eval"},{"key":"9295_CR26","unstructured":"Holzenberger N, Blair-Stanek A, and Van Durme B (2020) A dataset for statutory reasoning in tax law entailment and question answering. arXiv Preprint arXiv:2005.05257"},{"key":"9295_CR27","unstructured":"Idelberger F (2020) Merging traditional contracts (or law) and (smart) e-contracts\u2013a novel approach. MLR 2020. The 1st workshop on models of legal reasoning"},{"key":"9295_CR28","unstructured":"ISDA (2020) What is the ISDA clause library? https:\/\/www.isda.org\/a\/DZdEE\/ISDA-Clause-Library-Project-Memo.pdf"},{"key":"9295_CR29","unstructured":"Karadotchev V (2019) First steps towards logical english. MSc thesis. Imperial college London"},{"key":"9295_CR30","unstructured":"Kowalski R (1982) Logic as a computer language for children. In proceedings of European conference on artificial intelligence. Orsay, France"},{"issue":"2","key":"9295_CR32","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF03037468","volume":"8","author":"R Kowalski","year":"1990","unstructured":"Kowalski R (1990) English as a logic programming language. N Gener Comput 8(2):91\u201393","journal-title":"N Gener Comput"},{"key":"9295_CR33","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/3-540-55930-2_15","volume-title":"Logic programming in action","author":"R Kowalski","year":"1992","unstructured":"Kowalski R (1992) Legislation as logic programs. In: Comyn G, Fuchs NE, Ratcliffe MJ (eds) Logic programming in action. Springer, Verlag, pp 203\u2013230"},{"key":"9295_CR34","unstructured":"Kowalski R (2019) Logical english. http:\/\/www.doc.ic.ac.uk\/~rak\/papers\/Logical%20English.pdf"},{"key":"9295_CR35","unstructured":"Kowalski R (2020) Logical english, logic and practice of programming (LPOP). http:\/\/www.doc.ic.ac.uk\/~rak\/papers\/LPOP.pdf"},{"issue":"3\u20134","key":"9295_CR36","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF03037170","volume":"9","author":"RA Kowalski","year":"1991","unstructured":"Kowalski RA, Sadri F (1991) Logic programs with exceptions. N Gener Comput 9(3\u20134):387\u2013400","journal-title":"N Gener Comput"},{"issue":"1","key":"9295_CR37","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00354-015-0103-z","volume":"33","author":"R Kowalski","year":"2015","unstructured":"Kowalski R, Sadri F (2015) Reactive computing as model generation. N Gener Comput 33(1):33\u201367","journal-title":"N Gener Comput"},{"issue":"03","key":"9295_CR38","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1017\/S1471068416000041","volume":"16","author":"R Kowalski","year":"2016","unstructured":"Kowalski R, Sadri F (2016) Programming in logic without logic programming. Theory Pract Logic Program 16(03):269\u2013295","journal-title":"Theory Pract Logic Program"},{"issue":"1","key":"9295_CR39","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF03037383","volume":"4","author":"R Kowalski","year":"1986","unstructured":"Kowalski R, Sergot M (1986) A logic-based calculus of events. New Gener Comput 4(1):67\u201395","journal-title":"New Gener Comput"},{"issue":"1","key":"9295_CR40","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1162\/COLI_a_00168","volume":"40","author":"T Kuhn","year":"2014","unstructured":"Kuhn T (2014) A survey and classification of controlled natural languages. Comput Linguist 40(1):121\u2013170","journal-title":"Comput Linguist"},{"key":"9295_CR41","unstructured":"Lee J (2020) Oracle intelligent advisor\u2014best practice guide for policy modelers. https:\/\/www.oracle.com\/technetwork\/apps-tech\/policy-automation\/learnmore\/opabestpracticeguidev12-3697709.pdf"},{"issue":"1","key":"9295_CR42","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF00370676","volume":"57","author":"GJC Lokhorst","year":"1996","unstructured":"Lokhorst GJC (1996) Reasoning about actions and obligations in first-order logic. Stud Logica 57(1):221\u2013237","journal-title":"Stud Logica"},{"key":"9295_CR43","doi-asserted-by":"crossref","unstructured":"Mar\u00edn RH, and Sartor G (1999) Time and norms: a formalisation in the event-calculus. In proceedings of the 7th international conference on artificial intelligence and law. pp. 90\u201399","DOI":"10.1145\/323706.323719"},{"key":"9295_CR44","unstructured":"Morris J (2020) Blawx alpha: user friendly rules as code on the web. https:\/\/www.blawx.com\/"},{"key":"9295_CR45","unstructured":"Morris J (2021) Rules as code: how technology may change the language in which legislation is written, and what it might mean for lawyers of tomorrow. TECHSHOW 2021. https:\/\/s3.amazonaws.com\/us.inevent.files.general\/6773\/68248\/1ac865f1698619047027fd22eddbba6e057e990e.pdf"},{"key":"9295_CR46","unstructured":"OMG (2015) Semantics of business vocabulary and business rules (SBVR), v1.3. https:\/\/www.omg.org\/spec\/SBVR\/1.3\/PDF"},{"key":"9295_CR47","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.artint.2015.06.005","volume":"227","author":"H Prakken","year":"2015","unstructured":"Prakken H, Sartor G (2015) Law and logic: a review from an argumentation perspective. Artif Intell 227:214\u2013245","journal-title":"Artif Intell"},{"key":"9295_CR48","first-page":"301","volume-title":"Readings in artificial intelligence and databases Morgan Kaufmann","author":"R Reiter","year":"1989","unstructured":"Reiter R (1989) Towards a logical reconstruction of relational database theory. Readings in artificial intelligence and databases Morgan Kaufmann. Elsevier, pp 301\u2013327"},{"key":"9295_CR49","first-page":"153","volume-title":"JSAI international symposium on artificial intelligence","author":"K Satoh","year":"2010","unstructured":"Satoh K, Asai K, Kogawa T, Kubota M, Nakamura M, Nishigai Y, Shirakawa K, Takano C (2010) PROLEG: an implementation of the presupposed ultimate fact theory of Japanese civil code by PROLOG technology. JSAI international symposium on artificial intelligence. Springer, Berlin, Heidelberg, pp 153\u2013164"},{"key":"9295_CR50","unstructured":"Schwitter R (2002) English as a formal specification language. In proceedings 13th international workshop on database and expert systems applications. pp. 228\u2013232. IEEE"},{"key":"9295_CR51","first-page":"33","volume-title":"Prospects for representing the law as logic programs","author":"MJ Sergot","year":"1982","unstructured":"Sergot MJ (1982) Prospects for representing the law as logic programs. Academic Press, Logic programming, pp 33\u201342"},{"key":"9295_CR52","doi-asserted-by":"crossref","unstructured":"Sergot MJ, Kamble AS, and Bajaj KK (1991) Indian central civil service pension rules: a case study in logic programming applied to regulations. In proceedings of the 3rd international conference on artificial intelligence and law. pp. 118\u2013127","DOI":"10.1145\/112646.112661"},{"issue":"5","key":"9295_CR53","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1145\/5689.5920","volume":"29","author":"MJ Sergot","year":"1986","unstructured":"Sergot MJ, Sadri F, Kowalski RA, Kriwaczek F, Hammond P, Cory HT (1986) The British nationality act as a logic program. Commun ACM 29(5):370\u2013386","journal-title":"Commun ACM"},{"key":"9295_CR54","volume-title":"Human reasoning and cognitive science","author":"K Stenning","year":"2012","unstructured":"Stenning K, Van Lambalgen M (2012) Human reasoning and cognitive science. MIT Press"},{"issue":"4","key":"9295_CR55","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1111\/j.1468-0068.2008.00684.x","volume":"42","author":"PB Vranas","year":"2008","unstructured":"Vranas PB (2008) New foundations for imperative logic I: logical connectives, consistency, and quantifiers. No\u00fbs 42(4):529\u2013572","journal-title":"No\u00fbs"},{"issue":"2","key":"9295_CR56","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1017\/S1471068418000522","volume":"19","author":"J Wielemaker","year":"2019","unstructured":"Wielemaker J, Riguzzi F, Kowalski RA, Lager T, Sadri F, Calejo M (2019) Using SWISH to realize interactive web-based tutorials for logic-based languages. Theory Pract Logic Program 19(2):229\u2013261","journal-title":"Theory Pract Logic Program"},{"key":"9295_CR57","volume-title":"Toward clarity and grace","author":"J Williams","year":"1990","unstructured":"Williams J (1990) Toward clarity and grace. The University of Chicago, Chicago"},{"key":"9295_CR58","volume-title":"Lessons in clarity and grace","author":"J Williams","year":"2017","unstructured":"Williams J, Bizup J (2017) Lessons in clarity and grace, Twelfth. Pearson","edition":"Twelfth"},{"key":"9295_CR59","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-19575-9_15","volume-title":"Logic in the theory and practice of lawmaking","author":"A Wyner","year":"2015","unstructured":"Wyner A (2015) From the language of legislation to executable logic programs. Logic in the theory and practice of lawmaking. Springer, Cham, pp 409\u2013434"}],"container-title":["Artificial Intelligence and Law"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10506-021-09295-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10506-021-09295-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10506-021-09295-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T08:58:19Z","timestamp":1725613099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10506-021-09295-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,12]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["9295"],"URL":"https:\/\/doi.org\/10.1007\/s10506-021-09295-3","relation":{},"ISSN":["0924-8463","1572-8382"],"issn-type":[{"value":"0924-8463","type":"print"},{"value":"1572-8382","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,12]]},"assertion":[{"value":"24 June 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}