Independence in constraint logic programs

García de la Banda, M. and Hermenegildo, Manuel V. and Marriott, K. (1993). Independence in constraint logic programs. In: "ILPS 1993", October 26-29, 1993, Vancouver, British Columbia, Canada. ISBN 0262631520.


Title: Independence in constraint logic programs
  • García de la Banda, M.
  • Hermenegildo, Manuel V.
  • Marriott, K.
Item Type: Presentation at Congress or Conference (Article)
Event Title: ILPS 1993
Event Dates: October 26-29, 1993
Event Location: Vancouver, British Columbia, Canada
Title of Book: Logic Programming, Proceedings of the 1993 International Symposium
Date: October 1993
ISBN: 0262631520
Faculty: Facultad de Informática (UPM)
Department: Inteligencia Artificial
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) | Preview


Studying independence of literals, variables, and substitutions has proven very useful in the context of logic programming (LP). Here we study independence in the broader context of constraint logic programming (CLP). We show that a naive extrapolation of the LP definitions of independence to CLP is unsatisfactory (in fact, wrong) for two reasons. First, because interaction between variables through constraints is more complex than in the case of logic programming. Second, in order to ensure the efUciency of several optimizations not only must independence of the search space be considered, but also an orthogonal issue - "independence of constraint solving." We clarify these issues by proposing various types of search independence and constraint solver independence, and show how they can be combined to allow different independence-related optimizations, from parallelism to intelligent backtracking. Sufficient conditions for independence which can be evaluated "a-priori" at run-time are also proposed. Our results suggest that independence, provided a suitable definition is chosen, is even more useful in CLP than in LP.

More information

Item ID: 14468
DC Identifier:
OAI Identifier:
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 13 Feb 2013 07:29
Last Modified: 21 Apr 2016 14:10
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM