Title: Herbrand constraints in HAL
Authors: Demoen, Bart ×
de la Banda, MG
Harvey, W
Marriott, K
Overton, D
Stuckey, PJ #
Issue Date: 2004
Publisher: Springer-verlag berlin
Series Title: Program development in computational logic vol:3049 pages:499-538
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.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
chp%3A10.1007%2F978-3-540-25951-0_15.pdf Published 399KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science