Abstract
Answer set programming (ASP) has long been used for modeling and solving hard search problems. Experience shows that the performance of ASP tools on different ASP encodings of the same problem may vary greatly from instance to instance and it is rarely the case that one encoding outperforms all others. We describe a system and its implementation that given a set of encodings and a training set of instances, builds performance models for the encodings, predicts the execution time of these encodings on new instances, and uses these predictions to select an encoding for solving.
Original language | English |
---|---|
Title of host publication | Logic Programming and Nonmonotonic Reasoning - 16th International Conference, LPNMR 2022, Proceedings |
Editors | Georg Gottlob, Daniela Inclezan, Marco Maratea |
Pages | 415-428 |
Number of pages | 14 |
DOIs | |
State | Published - 2022 |
Event | 16th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2022 - Genoa, Italy Duration: Sep 5 2022 → Sep 9 2022 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 13416 LNAI |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 16th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2022 |
---|---|
Country/Territory | Italy |
City | Genoa |
Period | 9/5/22 → 9/9/22 |
Bibliographical note
Publisher Copyright:© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.
Keywords
- answer set programming
- encoding selection
- machine learning
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science