Herbrand constraints in HAL

Bart Demoen; Maria Jose Garcia De La Banda; Warwick Harvey; Kim George Marriott; David Matthew Overton; Peter J Stuckey

doi:10.1007/978-3-540-25951-0_15

Herbrand constraints in HAL

Bart Demoen, Maria Jose Garcia De La Banda, Warwick Harvey, Kim George Marriott, David Matthew Overton, Peter J Stuckey

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

Abstract

Mercury is a logic programming language that is considerably faster than traditional Prolog implementations, but lacks support for full unification. HAL is a new constraint logic programming language specifically designed to support the construction of and experimentation with constraint solvers, and which compiles to Mercury. In this paper we describe the HAL Herbrand constraint solver and show how by using PARMA bindings, rather than the standard WAM representation, we can implement a solver that is compatible with Mercury’s term representation. This allows HAL to make use of Mercury’s more efficient procedures for handling ground terms, and thus achieve Mercury-like efficiency while supporting full unification. An important feature of HAL is its support for user-extensible dynamic scheduling since this facilitates the creation of propagation-based constraint solvers. We have therefore designed the HAL Herbrand constraint solver to support dynamic scheduling. We provide experiments to illustrate the efficiency of the resulting system, and systematically compare the effect of different declarations such as type, mode and determinism on the resulting code.

Original language	English
Title of host publication	Program Development in Computational Logic
Subtitle of host publication	A Decade of Research Advances in Logic-Based Program Development
Editors	Maurice Bruynooghe, Kung-Kiu Lau
Place of Publication	Berlin Germany
Publisher	Springer
Pages	499-538
Number of pages	40
ISBN (Print)	3540221522
DOIs	https://doi.org/10.1007/978-3-540-25951-0_15
Publication status	Published - 2004

Publication series

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

Access to Document

10.1007/978-3-540-25951-0_15

Cite this

Demoen, B., Garcia De La Banda, M. J., Harvey, W., Marriott, K. G., Overton, D. M., & Stuckey, P. J. (2004). Herbrand constraints in HAL. In M. Bruynooghe, & K.-K. Lau (Eds.), Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development (pp. 499-538). (Lecture Notes in Computer Science; Vol. 3049). Springer. https://doi.org/10.1007/978-3-540-25951-0_15

@inbook{c26fa271e65e47adac2f2e756ec6c8bd,

title = "Herbrand constraints in HAL",

abstract = "Mercury is a logic programming language that is considerably faster than traditional Prolog implementations, but lacks support for full unification. HAL is a new constraint logic programming language specifically designed to support the construction of and experimentation with constraint solvers, and which compiles to Mercury. In this paper we describe the HAL Herbrand constraint solver and show how by using PARMA bindings, rather than the standard WAM representation, we can implement a solver that is compatible with Mercury{\textquoteright}s term representation. This allows HAL to make use of Mercury{\textquoteright}s more efficient procedures for handling ground terms, and thus achieve Mercury-like efficiency while supporting full unification. An important feature of HAL is its support for user-extensible dynamic scheduling since this facilitates the creation of propagation-based constraint solvers. We have therefore designed the HAL Herbrand constraint solver to support dynamic scheduling. We provide experiments to illustrate the efficiency of the resulting system, and systematically compare the effect of different declarations such as type, mode and determinism on the resulting code.",

author = "Bart Demoen and {Garcia De La Banda}, {Maria Jose} and Warwick Harvey and Marriott, {Kim George} and Overton, {David Matthew} and Stuckey, {Peter J}",

year = "2004",

doi = "10.1007/978-3-540-25951-0_15",

language = "English",

isbn = "3540221522",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "499--538",

editor = "Maurice Bruynooghe and Kung-Kiu Lau",

booktitle = "Program Development in Computational Logic",

}

Demoen, B, Garcia De La Banda, MJ, Harvey, W, Marriott, KG, Overton, DM & Stuckey, PJ 2004, Herbrand constraints in HAL. in M Bruynooghe & K-K Lau (eds), Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development. Lecture Notes in Computer Science, vol. 3049, Springer, Berlin Germany, pp. 499-538. https://doi.org/10.1007/978-3-540-25951-0_15

Herbrand constraints in HAL. / Demoen, Bart; Garcia De La Banda, Maria Jose; Harvey, Warwick et al.
Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development. ed. / Maurice Bruynooghe; Kung-Kiu Lau. Berlin Germany: Springer, 2004. p. 499-538 (Lecture Notes in Computer Science; Vol. 3049).

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

TY - CHAP

T1 - Herbrand constraints in HAL

AU - Demoen, Bart

AU - Garcia De La Banda, Maria Jose

AU - Harvey, Warwick

AU - Marriott, Kim George

AU - Overton, David Matthew

AU - Stuckey, Peter J

PY - 2004

Y1 - 2004

N2 - Mercury is a logic programming language that is considerably faster than traditional Prolog implementations, but lacks support for full unification. HAL is a new constraint logic programming language specifically designed to support the construction of and experimentation with constraint solvers, and which compiles to Mercury. In this paper we describe the HAL Herbrand constraint solver and show how by using PARMA bindings, rather than the standard WAM representation, we can implement a solver that is compatible with Mercury’s term representation. This allows HAL to make use of Mercury’s more efficient procedures for handling ground terms, and thus achieve Mercury-like efficiency while supporting full unification. An important feature of HAL is its support for user-extensible dynamic scheduling since this facilitates the creation of propagation-based constraint solvers. We have therefore designed the HAL Herbrand constraint solver to support dynamic scheduling. We provide experiments to illustrate the efficiency of the resulting system, and systematically compare the effect of different declarations such as type, mode and determinism on the resulting code.

AB - Mercury is a logic programming language that is considerably faster than traditional Prolog implementations, but lacks support for full unification. HAL is a new constraint logic programming language specifically designed to support the construction of and experimentation with constraint solvers, and which compiles to Mercury. In this paper we describe the HAL Herbrand constraint solver and show how by using PARMA bindings, rather than the standard WAM representation, we can implement a solver that is compatible with Mercury’s term representation. This allows HAL to make use of Mercury’s more efficient procedures for handling ground terms, and thus achieve Mercury-like efficiency while supporting full unification. An important feature of HAL is its support for user-extensible dynamic scheduling since this facilitates the creation of propagation-based constraint solvers. We have therefore designed the HAL Herbrand constraint solver to support dynamic scheduling. We provide experiments to illustrate the efficiency of the resulting system, and systematically compare the effect of different declarations such as type, mode and determinism on the resulting code.

U2 - 10.1007/978-3-540-25951-0_15

DO - 10.1007/978-3-540-25951-0_15

M3 - Chapter (Book)

SN - 3540221522

T3 - Lecture Notes in Computer Science

SP - 499

EP - 538

BT - Program Development in Computational Logic

A2 - Bruynooghe, Maurice

A2 - Lau, Kung-Kiu

PB - Springer

CY - Berlin Germany

ER -