Building constraint solvers with HAL

Maria Jose Garcia De La Banda; David G Jeffery; Kim Marriott; Nicholas Nethercote; Peter J Stuckey; Christian Holzbaur

doi:10.1007/3-540-45635-X_14

Building constraint solvers with HAL

Maria Jose Garcia De La Banda, David G Jeffery, Kim Marriott, Nicholas Nethercote, Peter J Stuckey, Christian Holzbaur

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

4 Citations (Scopus)

Abstract

Experience using constrain programming to solve real-life problems has shown that finding an efficient solution to a problem often requires experimentation with different constrain solvers or even building a problem-specific solver. HAL is a new constrain logic programming language expressly designed to facilitate this process. In this paper we examine different ways of building solvers in HAL. We explain how type classes can be used to specify solver interfaces, allowing the constrain programmer to support modelling of a constrain problem independently of a particular solver, leading to easy “plug and play” experimentation. We compare a number of different ways of writing a simple solver in HAL: using dynamic scheduling, constrain handling rules and building on an existing solver. We also examine how external solvers may be interfaced with HAL, and approaches for removing interface overhead.

Original language	English
Title of host publication	Logic Programming
Subtitle of host publication	17th International Conference, ICLP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings
Editors	Philippe Codognet
Place of Publication	Berlin Germany
Publisher	Springer
Pages	90-104
Number of pages	15
ISBN (Print)	3540429352
DOIs	https://doi.org/10.1007/3-540-45635-X_14
Publication status	Published - 2001
Event	International Conference on Logic Programming 2001 - Paphos, Cyprus Duration: 26 Nov 2001 → 1 Dec 2001 Conference number: 17th https://link.springer.com/book/10.1007/3-540-45635-X (Proceedings)

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	2237
ISSN (Print)	0302-9743

Conference

Conference	International Conference on Logic Programming 2001
Abbreviated title	ICLP 2001
Country/Territory	Cyprus
City	Paphos
Period	26/11/01 → 1/12/01
Internet address	https://link.springer.com/book/10.1007/3-540-45635-X (Proceedings)

Access to Document

10.1007/3-540-45635-X_14

Cite this

Garcia De La Banda, M. J., Jeffery, D. G., Marriott, K., Nethercote, N., Stuckey, P. J., & Holzbaur, C. (2001). Building constraint solvers with HAL. In P. Codognet (Ed.), Logic Programming: 17th International Conference, ICLP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings (pp. 90-104). (Lecture Notes in Computer Science; Vol. 2237). Springer. https://doi.org/10.1007/3-540-45635-X_14

@inproceedings{2c1bb1015ce2478d8276f7cf37273488,

title = "Building constraint solvers with HAL",

abstract = "Experience using constrain programming to solve real-life problems has shown that finding an efficient solution to a problem often requires experimentation with different constrain solvers or even building a problem-specific solver. HAL is a new constrain logic programming language expressly designed to facilitate this process. In this paper we examine different ways of building solvers in HAL. We explain how type classes can be used to specify solver interfaces, allowing the constrain programmer to support modelling of a constrain problem independently of a particular solver, leading to easy “plug and play” experimentation. We compare a number of different ways of writing a simple solver in HAL: using dynamic scheduling, constrain handling rules and building on an existing solver. We also examine how external solvers may be interfaced with HAL, and approaches for removing interface overhead.",

author = "\{Garcia De La Banda\}, \{Maria Jose\} and Jeffery, \{David G\} and Kim Marriott and Nicholas Nethercote and Stuckey, \{Peter J\} and Christian Holzbaur",

year = "2001",

doi = "10.1007/3-540-45635-X\_14",

language = "English",

isbn = "3540429352",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "90--104",

editor = "Philippe Codognet",

booktitle = "Logic Programming",

address = "Switzerland",

note = "International Conference on Logic Programming 2001, ICLP 2001 ; Conference date: 26-11-2001 Through 01-12-2001",

url = "https://link.springer.com/book/10.1007/3-540-45635-X",

}

Garcia De La Banda, MJ, Jeffery, DG, Marriott, K, Nethercote, N, Stuckey, PJ & Holzbaur, C 2001, Building constraint solvers with HAL. in P Codognet (ed.), Logic Programming: 17th International Conference, ICLP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings. Lecture Notes in Computer Science, vol. 2237, Springer, Berlin Germany, pp. 90-104, International Conference on Logic Programming 2001, Paphos, Cyprus, 26/11/01. https://doi.org/10.1007/3-540-45635-X_14

Building constraint solvers with HAL. / Garcia De La Banda, Maria Jose; Jeffery, David G; Marriott, Kim et al.
Logic Programming: 17th International Conference, ICLP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings. ed. / Philippe Codognet. Berlin Germany: Springer, 2001. p. 90-104 (Lecture Notes in Computer Science; Vol. 2237).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Building constraint solvers with HAL

AU - Garcia De La Banda, Maria Jose

AU - Jeffery, David G

AU - Marriott, Kim

AU - Nethercote, Nicholas

AU - Stuckey, Peter J

AU - Holzbaur, Christian

N1 - Conference code: 17th

PY - 2001

Y1 - 2001

N2 - Experience using constrain programming to solve real-life problems has shown that finding an efficient solution to a problem often requires experimentation with different constrain solvers or even building a problem-specific solver. HAL is a new constrain logic programming language expressly designed to facilitate this process. In this paper we examine different ways of building solvers in HAL. We explain how type classes can be used to specify solver interfaces, allowing the constrain programmer to support modelling of a constrain problem independently of a particular solver, leading to easy “plug and play” experimentation. We compare a number of different ways of writing a simple solver in HAL: using dynamic scheduling, constrain handling rules and building on an existing solver. We also examine how external solvers may be interfaced with HAL, and approaches for removing interface overhead.

AB - Experience using constrain programming to solve real-life problems has shown that finding an efficient solution to a problem often requires experimentation with different constrain solvers or even building a problem-specific solver. HAL is a new constrain logic programming language expressly designed to facilitate this process. In this paper we examine different ways of building solvers in HAL. We explain how type classes can be used to specify solver interfaces, allowing the constrain programmer to support modelling of a constrain problem independently of a particular solver, leading to easy “plug and play” experimentation. We compare a number of different ways of writing a simple solver in HAL: using dynamic scheduling, constrain handling rules and building on an existing solver. We also examine how external solvers may be interfaced with HAL, and approaches for removing interface overhead.

UR - https://www.scopus.com/pages/publications/69749125380

U2 - 10.1007/3-540-45635-X_14

DO - 10.1007/3-540-45635-X_14

M3 - Conference Paper

SN - 3540429352

T3 - Lecture Notes in Computer Science

SP - 90

EP - 104

BT - Logic Programming

A2 - Codognet, Philippe

PB - Springer

CY - Berlin Germany

T2 - International Conference on Logic Programming 2001

Y2 - 26 November 2001 through 1 December 2001

ER -

Garcia De La Banda MJ, Jeffery DG, Marriott K, Nethercote N, Stuckey PJ, Holzbaur C. Building constraint solvers with HAL. In Codognet P, editor, Logic Programming: 17th International Conference, ICLP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings. Berlin Germany: Springer. 2001. p. 90-104. (Lecture Notes in Computer Science). doi: 10.1007/3-540-45635-X_14

Building constraint solvers with HAL

Abstract

Publication series

Conference

Access to Document

Other files and links

Cite this