Tools for Search Tree Visualization: The APT Tool


Autoria(s): Carro Liñares, Manuel; Hermenegildo, Manuel V.
Data(s)

01/09/2000

Resumo

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.

Formato

application/pdf

Identificador

http://oa.upm.es/14564/

Idioma(s)

eng

Publicador

Facultad de Informática (UPM)

Relação

http://oa.upm.es/14564/1/HERME_ARTINBOOKS_2000-1.pdf

http://link.springer.com/chapter/10.1007%2F10722311_10?LI=true

info:eu-repo/semantics/altIdentifier/doi/10.1007/10722311_10

Direitos

http://creativecommons.org/licenses/by-nc-nd/3.0/es/

info:eu-repo/semantics/openAccess

Fonte

Tools for Search Tree Visualization: The APT Tool | En: Analysis and Visualization Tools for Constraint Programming | pag. 237-252 | Springer Berlin Heidelberg | 2000-09

Palavras-Chave #Informática
Tipo

info:eu-repo/semantics/bookPart

Sección de Libro

PeerReviewed