Use of methods of algebraic programming for the formal verification of legal acts
This article briefly describes the programmable tool for the analysis of a normative legal document. A mechanism for checking legal requirements is presented. The model of the legal document is proposed in the form of a set of special rules. Verification is provided by means of algebraic programming...
Saved in:
| Date: | 2018 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
PROBLEMS IN PROGRAMMING
2018
|
| Subjects: | |
| Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/272 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Problems in programming |
| Download file: |  |
Institution
Problems in programming| Summary: | This article briefly describes the programmable tool for the analysis of a normative legal document. A mechanism for checking legal requirements is presented. The model of the legal document is proposed in the form of a set of special rules. Verification is provided by means of algebraic programming and methods of symbolic transformation. This approach allows us to analyze the legislative base of structural and logical errors, check the contradictions, completeness and integrity of legal acts. Presently, the mechanism of claster analysis of text, which makes it possible to identify the frequency of occurrence of various vague language constructs.Problems in programming 2018; 2-3: 109-114 |
|---|