Herbrand Constraint Solving in HAL

Herbrand Constraint Solving in HAL (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Bart Demoen , Maria García de la Banda , Warwick Harvey , Kim Marriott , Peter Stuckey

Citations:

6 - 2 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Herbrand Constraint Solving in HAL	user correction - Legacy Corrections
AUTHOR NAME	Bart Demoen	user correction - Legacy Corrections
AUTHOR AFFIL	, Warwick Harvey; y	user correction - Legacy Corrections
AUTHOR NAME	Maria García de la Banda	user correction - Legacy Corrections
AUTHOR NAME	Warwick Harvey	user correction - Legacy Corrections
AUTHOR NAME	Kim Marriott	user correction - Legacy Corrections
AUTHOR AFFIL	y	user correction - Legacy Corrections
AUTHOR NAME	Peter Stuckey	user correction - Legacy Corrections
AUTHOR AFFIL	; z; Dept. of Computer Science, K.U.Leuven; y School of Computer Science & Software Engineering, Monash University; z School of Computer Science & Software Engineering, University of Melbourne,	user correction - Legacy Corrections
AUTHOR ADDR	; Belgium; Australia; Australia	user correction - Legacy Corrections
ABSTRACT	HAL is a new constraint logic programming language specifically designed to support the construction of and experimentation with constraint solvers. One of the most important constraint solvers in any logic programming language is the Herbrand (or term) constraint solver. HAL programs are compiled to Mercury but, while Mercury provides only tests for equality and construction and deconstruction of ground terms, HAL supports full unification and logical variables. In this paper we describe the HAL Herbrand constraint solver and show how by using Parma bindings, rather than the standard term representation used in the WAM, we can implement a solver which interacts gracefully with Mercury's term representation. Like Mercury, HAL allows type, mode and determinism declarations. HAL uses information from these declarations to reduce the overhead of Herbrand constraint solving wherever possible. We systematically evaluate the effect of each kind of declaration on the efficiency of HAL programs. Essentially, we start with a pure Prolog program, then add type, then mode, and finally determinism declarations, and compare the efficiency of these different versions. This is possible since, as HAL provides full unification and a "constrained" mode, all versions are legitimate HAL programs.	user correction - Legacy Corrections
YEAR	1999	user correction - Legacy Corrections
CITATIONS	9 found	ParsCit 1.0