Independence in constraint logic programs

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

Descripción

Título: Independence in constraint logic programs
Autor/es:
  • García de la Banda, M.
  • Hermenegildo, Manuel V.
  • Marriott, K.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: ILPS 1993
Fechas del Evento: October 26-29, 1993
Lugar del Evento: Vancouver, British Columbia, Canada
Título del Libro: Logic Programming, Proceedings of the 1993 International Symposium
Fecha: Octubre 1993
ISBN: 0262631520
Materias:
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Inteligencia Artificial
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (1MB) | Vista Previa

Resumen

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.

Más información

ID de Registro: 14468
Identificador DC: http://oa.upm.es/14468/
Identificador OAI: oai:oa.upm.es:14468
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 13 Feb 2013 07:29
Ultima Modificación: 21 Abr 2016 14:10
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM