2002/07/11 by Magnus Agren, Magnus S. Ågren, Agren, Magnus +7
Computer Science · #Algorithms and Data Compression #Constraint Satisfaction and Optimization #D.1.6 #D.2.5 #D.2.6 #F.4.1 #FOS: Computer and information sciences #I.2.3 #Model-Driven Software Engineering Techniques #Software Engineering (cs.SE) #cs.SE
paper · pdf · doi:10.48550/arxiv.cs/0207047
16 pages; Alexandre Tessier, editor; WLPE 2002, http://xxx.lanl.gov/abs/cs.SE/0207052
openalex publication_date 2002/07/11 · arxiv created 2002/07/12 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.