Developing a Generic Trace Model for Constraint Solving in CLP(fd)

Title: Developing a Generic Trace Model for Constraint Solving in CLP(fd)

Research Question: How can we develop a generic trace model for constraint solving in CLP(fd) that can be used by various debugging tools, and how can we validate this model?

Methodology: We propose a trace model for constraint solving by narrowing, which is the first one proposed for CLP(fd). We also develop an instrumented meta-interpreter to experiment with the model. This meta-interpreter is based on well-known Prolog meta-interpretation techniques and the described operational semantic for the constraint part.

Results: We show that the proposed trace model contains the necessary information to build known and useful execution views. This work sets the basis for generic execution analysis of CLP(fd) programs.

Implications: This research has implications for the development of debugging tools for CLP(fd) programs. It provides a standardized trace model that can be used by various tools, making it easier to develop and maintain these tools. Furthermore, it sets a framework for future research in this area, as it provides a basis for comparing and improving upon existing trace models and debugging techniques.

Link to Article: https://arxiv.org/abs/0111043v1 Authors: arXiv ID: 0111043v1