Towards semi-automatic learning-based model transformation

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

Abstract

Recently, [16] showed that the nogoods inferred by learning solvers can be used to improve a problem model, by detecting constraints that can be strengthened and new redundant constraints. However, the detection process was manual and required in-depth knowledge of both the learning solver and the model transformations performed by the compiler. In this paper we provide the first steps towards a (largely) automatic detection process. In particular, we discuss how nogoods can be automatically simplified, connected back to the constraints in the model, and grouped into more general “patterns” for which common facts might be found. These patterns are easier to understand and provide stronger evidence of the importance of particular constraints. We also show how nogoods generated by different search strategies and problem instances can increase our confidence in the usefulness of these patterns. Finally, we identify significant challenges and avenues for future research.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming
Subtitle of host publication24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings
EditorsJohn Hooker
Place of PublicationCham Switzerland
PublisherSpringer
Pages403-419
Number of pages17
ISBN (Electronic)9783319983349
ISBN (Print)9783319983332
DOIs
Publication statusPublished - 1 Jan 2018
EventInternational Conference on Principles and Practice of Constraint Programming 2018 - Lille, France
Duration: 27 Aug 201831 Aug 2018
Conference number: 24th
http://cp2018.a4cp.org/

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume11008
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Principles and Practice of Constraint Programming 2018
Abbreviated titleCP 2018
CountryFrance
CityLille
Period27/08/1831/08/18
Internet address

Cite this

Zeighami, K., Leo, K., Tack, G., & de la Banda, M. G. (2018). Towards semi-automatic learning-based model transformation. In J. Hooker (Ed.), Principles and Practice of Constraint Programming : 24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings (pp. 403-419). (Lecture Notes in Computer Science ; Vol. 11008 ). Cham Switzerland: Springer. https://doi.org/10.1007/978-3-319-98334-9_27
Zeighami, Kiana ; Leo, Kevin ; Tack, Guido ; de la Banda, Maria Garcia. / Towards semi-automatic learning-based model transformation. Principles and Practice of Constraint Programming : 24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings. editor / John Hooker. Cham Switzerland : Springer, 2018. pp. 403-419 (Lecture Notes in Computer Science ).
@inproceedings{1caa6f48d3ba49d2b96f749075fe08a7,
title = "Towards semi-automatic learning-based model transformation",
abstract = "Recently, [16] showed that the nogoods inferred by learning solvers can be used to improve a problem model, by detecting constraints that can be strengthened and new redundant constraints. However, the detection process was manual and required in-depth knowledge of both the learning solver and the model transformations performed by the compiler. In this paper we provide the first steps towards a (largely) automatic detection process. In particular, we discuss how nogoods can be automatically simplified, connected back to the constraints in the model, and grouped into more general “patterns” for which common facts might be found. These patterns are easier to understand and provide stronger evidence of the importance of particular constraints. We also show how nogoods generated by different search strategies and problem instances can increase our confidence in the usefulness of these patterns. Finally, we identify significant challenges and avenues for future research.",
author = "Kiana Zeighami and Kevin Leo and Guido Tack and {de la Banda}, {Maria Garcia}",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-98334-9_27",
language = "English",
isbn = "9783319983332",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "403--419",
editor = "Hooker, {John }",
booktitle = "Principles and Practice of Constraint Programming",

}

Zeighami, K, Leo, K, Tack, G & de la Banda, MG 2018, Towards semi-automatic learning-based model transformation. in J Hooker (ed.), Principles and Practice of Constraint Programming : 24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings. Lecture Notes in Computer Science , vol. 11008 , Springer, Cham Switzerland, pp. 403-419, International Conference on Principles and Practice of Constraint Programming 2018, Lille, France, 27/08/18. https://doi.org/10.1007/978-3-319-98334-9_27

Towards semi-automatic learning-based model transformation. / Zeighami, Kiana; Leo, Kevin; Tack, Guido; de la Banda, Maria Garcia.

Principles and Practice of Constraint Programming : 24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings. ed. / John Hooker. Cham Switzerland : Springer, 2018. p. 403-419 (Lecture Notes in Computer Science ; Vol. 11008 ).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

TY - GEN

T1 - Towards semi-automatic learning-based model transformation

AU - Zeighami, Kiana

AU - Leo, Kevin

AU - Tack, Guido

AU - de la Banda, Maria Garcia

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Recently, [16] showed that the nogoods inferred by learning solvers can be used to improve a problem model, by detecting constraints that can be strengthened and new redundant constraints. However, the detection process was manual and required in-depth knowledge of both the learning solver and the model transformations performed by the compiler. In this paper we provide the first steps towards a (largely) automatic detection process. In particular, we discuss how nogoods can be automatically simplified, connected back to the constraints in the model, and grouped into more general “patterns” for which common facts might be found. These patterns are easier to understand and provide stronger evidence of the importance of particular constraints. We also show how nogoods generated by different search strategies and problem instances can increase our confidence in the usefulness of these patterns. Finally, we identify significant challenges and avenues for future research.

AB - Recently, [16] showed that the nogoods inferred by learning solvers can be used to improve a problem model, by detecting constraints that can be strengthened and new redundant constraints. However, the detection process was manual and required in-depth knowledge of both the learning solver and the model transformations performed by the compiler. In this paper we provide the first steps towards a (largely) automatic detection process. In particular, we discuss how nogoods can be automatically simplified, connected back to the constraints in the model, and grouped into more general “patterns” for which common facts might be found. These patterns are easier to understand and provide stronger evidence of the importance of particular constraints. We also show how nogoods generated by different search strategies and problem instances can increase our confidence in the usefulness of these patterns. Finally, we identify significant challenges and avenues for future research.

UR - http://www.scopus.com/inward/record.url?scp=85053163412&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-98334-9_27

DO - 10.1007/978-3-319-98334-9_27

M3 - Conference Paper

SN - 9783319983332

T3 - Lecture Notes in Computer Science

SP - 403

EP - 419

BT - Principles and Practice of Constraint Programming

A2 - Hooker, John

PB - Springer

CY - Cham Switzerland

ER -

Zeighami K, Leo K, Tack G, de la Banda MG. Towards semi-automatic learning-based model transformation. In Hooker J, editor, Principles and Practice of Constraint Programming : 24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings. Cham Switzerland: Springer. 2018. p. 403-419. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-319-98334-9_27