English
Related papers

Related papers: A Constraint-Driven System for Contract Assembly

200 papers

The drafting of documents in the procurement field has progressively become more complex and diverse, driven by the need to meet legal requirements, adapt to technological advancements, and address stakeholder demands. While large language…

Computation and Language · Computer Science 2024-10-15 Yilong Zhao , Daifeng Li

Data representation is a fundamental task in machine learning. The representation of data affects the performance of the whole machine learning system. In a long history, the representation of data is done by feature engineering, and…

Computation and Language · Computer Science 2016-11-21 Siwei Lai

We propose the use of Soft Constraints as a natural way to model Service Oriented Architecture. In the framework, constraints are used to model components and connectors and constraint aggregation is used to represent their interactions.…

Artificial Intelligence · Computer Science 2009-06-23 Stefano Bistarelli , Francesco Santini

We introduce a novel type of text representation that preserves the 2D layout of a document. This is achieved by encoding each document page as a two-dimensional grid of characters. Based on this representation, we present a generic…

Reusable software components need expressive specifications. This paper outlines a rigorous foundation to model-based contracts, a method to equip classes with strong contracts that support accurate design, implementation, and formal…

Software Engineering · Computer Science 2013-08-14 Nadia Polikarpova , Carlo A. Furia , Bertrand Meyer

Modern engineering systems include many components of different types and functions. Verifying that these systems satisfy given specifications can be an arduous task, as most formal verification methods are limited to systems of moderate…

Systems and Control · Electrical Eng. & Systems 2021-04-21 Miel Sharf , Bart Besselink , Adam Molin , Qiming Zhao , Karl Henrik Johansson

We address the problem of counting the number of strings in a collection where a given pattern appears, which has applications in information retrieval and data mining. Existing solutions are in a theoretical stage. We implement these…

Data Structures and Algorithms · Computer Science 2015-10-02 Travis Gagie , Aleksi Hartikainen , Juha Kärkkäinen , Gonzalo Navarro , Simon J. Puglisi , Jouni Sirén

The task of automatic text summarization produces a concise and fluent text summary while preserving key information and overall meaning. Recent approaches to document-level summarization have seen significant improvements in recent years…

Computation and Language · Computer Science 2022-12-07 Gonçalo Raposo , Afonso Raposo , Ana Sofia Carmo

Financial structures such as securitisations, insurance contracts, and other hierarchical claims systems can be interpreted as deterministic allocation mechanisms acting on stochastic inflow processes. This paper develops a general…

Computational Finance · Quantitative Finance 2026-02-17 Antonio Scala

A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be represented extensionally, by explicitly listing allowed…

Artificial Intelligence · Computer Science 2015-02-10 Evgenij Thorstensen

We present a system that uses a learned autocompletion mechanism to facilitate rapid creation of semi-structured clinical documentation. We dynamically suggest relevant clinical concepts as a doctor drafts a note by leveraging features from…

Machine Learning · Computer Science 2020-07-31 Divya Gopinath , Monica Agrawal , Luke Murray , Steven Horng , David Karger , David Sontag

Patents play a critical role in driving technological innovation by granting inventors exclusive rights to their inventions. However the process of drafting a patent application is often expensive and time-consuming, making it a prime…

Computation and Language · Computer Science 2025-09-25 Ryan Shea , Zhou Yu

Contract-based design is a promising methodology for taming the complexity of developing sophisticated systems. A formal contract distinguishes between assumptions, which are constraints that the designer of a component puts on the…

Formal Languages and Automata Theory · Computer Science 2020-05-11 Ezio Bartocci , Thomas Ferrère , Thomas A. Henzinger , Dejan Nickovic , Ana Oliveira da Costa

We study automatic Contract Clause Extraction (CCE) by modeling implicit relations in legal contracts. Existing CCE methods mostly treat contracts as plain text, creating a substantial barrier to understanding contracts of high complexity.…

Computation and Language · Computer Science 2022-10-18 Weiwen Xu , Yang Deng , Wenqiang Lei , Wenlong Zhao , Tat-Seng Chua , Wai Lam

Abstractive summarization has made significant strides in condensing and rephrasing large volumes of text into coherent summaries. However, summarizing administrative documents presents unique challenges due to domain-specific terminology,…

Computation and Language · Computer Science 2024-12-12 Phan Phuong Mai Chau , Souhail Bakkali , Antoine Doucet

We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are interpreted over constructor terms (representing data values),…

Logic in Computer Science · Computer Science 2008-12-01 Adel Bouhoula , Florent Jacquemard

Current models for software components have made component-based software engineering practical. However, these models are limited in the sense that their support for the characterization/specification of design components primarily deals…

Software Engineering · Computer Science 2014-02-14 Zitouni Abdelhafid

Legislation can be viewed as a body of prescriptive rules expressed in natural language. The application of legislation to facts of a case we refer to as statutory reasoning, where those facts are also expressed in natural language.…

Computation and Language · Computer Science 2020-08-13 Nils Holzenberger , Andrew Blair-Stanek , Benjamin Van Durme

In this paper we describe an approach to constraint-based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order (MSO) logic are represented by tree automata recognizing the…

cmp-lg · Computer Science 2008-02-03 Frank Morawietz , Tom Cornell

Constrained generative modeling is fundamental to applications such as robotic control and autonomous driving, where models must respect physical laws and safety-critical constraints. In real-world settings, these constraints rarely take…

Machine Learning · Computer Science 2026-03-10 Xiaoxuan Liang , Saeid Naderiparizi , Yunpeng Liu , Berend Zwartsenberg , Frank Wood