Change search
ReferencesLink to record
Permanent link

Direct link
Tracing and explaining execution of CLP(FD) programs
Number of Authors: 4
2002 (English)Conference paper (Refereed)
Abstract [en]

Previous work in the area of tracing CLP(FD) programs mainly focuses on providing information about control of execution and domain modification. In this paper, we present a trace structure that provides information about additional important aspects. We incorporate explanations in the trace structure, i.e. reasons for why certain solver actions occur. Furthermore, we come up with a format for describing the execution of the filtering algorithms of global constraints. Some new ideas about the design of the trace are also presented. For example, we have modeled our trace as a nested block structure in order to achieve a hierarchical view. Also, new ways about how to represent and identify different entities such as constraints and domain variables are presented.

Place, publisher, year, edition, pages
2002, 1. , 16 p.
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-14685OAI: diva2:1035979
Proceedings of the 12th International Workshop on Logic Programming Environments, WLPE 2002
Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(208 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 208 kBChecksum SHA-512
Type fulltextMimetype application/pdf
fulltext(203 kB)0 downloads
File information
File name FULLTEXT02.psFile size 203 kBChecksum SHA-512
Type fulltextMimetype application/postscript

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link