Projects per year
Abstract
This paper presents Athanor, a novel local search solver that operates on abstract constraint specifications of combinatorial problems in the Essence language. It is unique in that it operates directly on the high level, nested types in Essence, such as set of partitions or multiset of sequences, without refining such types into low level representations. This approach has two main advantages. First, the structure present in the high level types allows high quality neighbourhoods for local search to be automatically derived. Second, it allows Athanor to scale much better than solvers that operate on the equivalent, but much larger, low-level representations. The paper details how Athanor operates, covering incremental evaluation, dynamic unrolling of quantified expressions and neighbourhood construction. A series of case studies show the performance of Athanor, benchmarked against several local search solvers on a range of problem classes.
Original language | English |
---|---|
Title of host publication | Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19) |
Editors | Sarit Kraus |
Publisher | International Joint Conferences on Artificial Intelligence |
Pages | 1056-1063 |
Number of pages | 8 |
ISBN (Electronic) | 9780999241141 |
DOIs | |
Publication status | Published - 10 Aug 2019 |
Event | Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19) - Macao, China Duration: 10 Aug 2019 → 16 Aug 2019 Conference number: 28 https://www.ijcai19.org/ |
Conference
Conference | Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19) |
---|---|
Abbreviated title | IJCAI-19 |
Country/Territory | China |
City | Macao |
Period | 10/08/19 → 16/08/19 |
Internet address |
Keywords
- Constraints and SAT: Constraints: solvers and tools
- Constraints and SAT: Modeling;formulation
Fingerprint
Dive into the research topics of 'Athanor: high-level local search over abstract constraint specifications in Essence'. Together they form a unique fingerprint.Projects
- 2 Finished
-
A Learning, Optimising Compiler: A Learning, Optimising Compiler for Computational Group Theory
Jefferson, C. A. (PI)
1/10/18 → 28/02/22
Project: Fellowship
-
Modelling and Optimisation with Graphs: Modelling and Optimisation with Graphs
Jefferson, C. A. (PI) & Akgun, O. (CoI)
1/07/17 → 31/10/20
Project: Standard