• No results found

Contracts and Computation Formal modelling and analysis for normative natural language

N/A
N/A
Protected

Academic year: 2021

Share "Contracts and Computation Formal modelling and analysis for normative natural language"

Copied!
2
0
0

Loading.... (view fulltext now)

Full text

(1)

Contracts and Computation

Formal modelling and analysis for

normative natural language

John J. Camilleri

The defence of this thesis for the degree of Doctor of Philosophy will be held in room HC3, Hörsalsvägen 14,

Chalmers University of Technology, on Wednesday 1stNovember, 2017 at 10:00.

Faculty opponent: Giovanni Sartor

University of Bologna and European University Institute of Florence

Department of Computer Science and Engineering Chalmers University of Technology and University of Gothenburg

(2)

Abstract

Whether we are aware of it or not, our digital lives are governed by contracts of various kinds, such as privacy policies, software licenses, service agreements, and regulations. At their essence, normative documents like these dictate the permissions, obligations, and prohibitions of two or more parties entering into an agreement, including the penalties which must be paid when someone breaks the rules. Such documents are often lengthy and hard to understand, and most people tend to agree to these legally binding contracts without ever reading them. Our goal is to create tools which can take a natural language document as input and allow an end user to easily ask questions about its implications, get-ting back meaningful answers in natural language within a reasonable amount of time. We do this by bringing formal methods to the analysis of normative texts, investigating how they can be effectively modelled and the kinds of automatic processing that these models enable.

This thesis includes six research papers by the author which cover the var-ious aspects of this approach: entity recognition and modality extraction from natural language, controlled natural languages and visual diagrams as interfaces for modelling, logical formalisms which can be used for contract representation, and analysis via syntactic filtering, trace evaluation, random testing, and model checking. These components are then combined into a prototype tool for end users, allowing for end-to-end analysis of normative texts in natural language.

Keywords

normative texts, contract analysis, controlled natural language, model checking

References

Related documents

1998 ACM Subject Classification F.4.2 Grammars and Other Rewriting Systems, F.4.3 Formal Languages, G.2.2 Graph Theory, I.2.7 Natural Language Processing.. Keywords and phrases

Based on the results in this study we are unable to conclude that there is any statistical difference between first word search and most significant word search algorithms in either

Figure 30 - Expenditure and revenue of the system in Cyprus (left) and Israel (right) over the projected period in the higher electricity prices (+150%) scenario, in million

We then ran both algorithms again but this time excluded queries expecting an album as result and only asked for tracks and artists.. We also did a third run of the algorithms with

This thesis includes four research articles by the author which investigate the various compo- nents that a system such as this would require; from entity recognition and

unlimited embedding with quite simple recursive rules as shown in the sample lexicon entries in Figure 11 for the reading of the sentence John claims that Sarah knows that

We also describe the design of a rule-based shallow parser for Swedish called GTA and a detection algorithm for context-sensitive spelling errors based on semi-supervised

In a recent work 7], some general results on exponential stabil- ity of random linear equations are established, which can be applied directly to the performance analysis of a