Legal Engineering of the Anti-Abuse Rule in ATAD: Architecture of the Regression Tree Model

• Published in: TalTech Journal of European Studies Vol. 11; no. 2; pp. 65 - 82
• Main Author: Künnapas, Kaido
• Format: Journal Article
• Language: English
• Published: Tallinn Sciendo 01.09.2021; De Gruyter Poland
• Subjects: anti-abuse rule; ATAD; Automation; decision tree; Decision trees; legal algorithms; legal engineering; machine learning; regression tree
• ISSN: 2674-4619; 2674-4600; 2674-4619
• DOI: 10.2478/bjes-2021-0015

Every taxable arrangement is subject to an anti-abuse test. Abusive arrangements are treated as not valid for tax purposes, which is similar to the treatment of artificial arrangements in civil law. The European Union has introduced in its Anti-Tax Avoidance Directive a general anti-abuse test which must be transposed into the domestic laws of Member States. Such a test has its inner structure, consisting of an elimination and requalification stage, while the elimination stage entails genuineness and a tax benefit test. The general anti-abuse test has a great potential (or scalability when speaking in the language of start-ups) of being automated and integrated into different legal application processes (such as taxpayer self-assessment systems, transactions certified by public notary or merger and acquisition deals) to discover debt push down abuses or other arrangement structures which may have abusive content. While the best method for create a reliable algorithm is a decision tree type model, the inner ambiguity of the general anti-abuse test prevents using the full benefits of automation of tax laws. The purpose of this article is to design a decision tree type model for the test and address the main challenges of such a model, both from the perspective of the clarity of concepts and the quality of input information such an engine would use.