Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.09576 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929591687315456 |
|---|---|
| author | Miguel, Ian Salamon, András Z. Stone, Christopher |
| author_facet | Miguel, Ian Salamon, András Z. Stone, Christopher |
| contents | Formulating an effective constraint model of a parameterised problem class is crucial to the efficiency with which instances of the class can subsequently be solved. It is difficult to know beforehand which of a set of candidate models will perform best in practice. This paper presents a system that employs graph rewriting to reformulate an input model for improved performance automatically. By situating our work in the Essence abstract constraint specification language, we can use the structure in its high level variable types to trigger rewrites directly. We implement our system via rewrite rules expressed in the Graph Programs 2 language, applied to the abstract syntax tree of an input specification. We show how to automatically translate the solution of the reformulated problem into a solution of the original problem for verification and presentation. We demonstrate the efficacy of our system with a detailed case study. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_09576 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Automating Reformulation of Essence Specifications via Graph Rewriting Miguel, Ian Salamon, András Z. Stone, Christopher Artificial Intelligence F.4.2 Formulating an effective constraint model of a parameterised problem class is crucial to the efficiency with which instances of the class can subsequently be solved. It is difficult to know beforehand which of a set of candidate models will perform best in practice. This paper presents a system that employs graph rewriting to reformulate an input model for improved performance automatically. By situating our work in the Essence abstract constraint specification language, we can use the structure in its high level variable types to trigger rewrites directly. We implement our system via rewrite rules expressed in the Graph Programs 2 language, applied to the abstract syntax tree of an input specification. We show how to automatically translate the solution of the reformulated problem into a solution of the original problem for verification and presentation. We demonstrate the efficacy of our system with a detailed case study. |
| title | Automating Reformulation of Essence Specifications via Graph Rewriting |
| topic | Artificial Intelligence F.4.2 |
| url | https://arxiv.org/abs/2411.09576 |