Tools for Search Tree Visualization: The APT Tool

Carro Liñares, Manuel y Hermenegildo, Manuel V. (2000). Tools for Search Tree Visualization: The APT Tool. En: "Analysis and Visualization Tools for Constraint Programming". Lecture Notes in Computer Science (1870). Springer Berlin Heidelberg, pp. 237-252. ISBN 9783540411376. https://doi.org/10.1007/10722311_10.

Descripción

Título: Tools for Search Tree Visualization: The APT Tool
Autor/es:
  • Carro Liñares, Manuel
  • Hermenegildo, Manuel V.
Editor/es:
  • Deransart, Pierre
  • Hermenegildo Salinas, Manuel Vicente
  • Małuszynski, Jan
Tipo de Documento: Sección de Libro
Título del Libro: Analysis and Visualization Tools for Constraint Programming
Fecha: Septiembre 2000
ISBN: 9783540411376
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 (783kB) | Vista Previa

Resumen

The control part of the execution of a constraint logic program can be conceptually shown as a search-tree, where nodes correspond to calis, and whose branches represent conjunctions and disjunctions. This tree represents the search space traversed by the program, and has also a direct relationship with the amount of work performed by the program. The nodes of the tree can be used to display information regarding the state and origin of instantiation of the variables involved in each cali. This depiction can also be used for the enumeration process. These are the features implemented in APT, a tool which runs constraint logic programs while depicting a (modified) search-tree, keeping at the same time information about the state of the variables at every moment in the execution. This information can be used to replay the execution at will, both forwards and backwards in time. These views can be abstracted when the size of the execution requires it. The search-tree view is used as a framework onto which constraint-level visualizations (such as those presented in the following chapter) can be attached.

Más información

ID de Registro: 14564
Identificador DC: http://oa.upm.es/14564/
Identificador OAI: oai:oa.upm.es:14564
Identificador DOI: 10.1007/10722311_10
URL Oficial: http://link.springer.com/chapter/10.1007%2F10722311_10?LI=true
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 28 Feb 2013 09:16
Ultima Modificación: 21 Abr 2016 14:17
  • 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