Abstract
In this paper we describe the design and implementation of CP-Viz, a generic visualization platform for constraint programming. It provides multiple views to show the search tree, and the state of constraints and variables for a post-mortem analysis of a constraint program. Different to most previous visualization tools, it is system independent, using a light-weight, intermediate XML format to exchange information between solvers and the visualization tools. CP-Viz is available under an open-source licence, and has already been interfaced to four different constraint systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling problems. Journal of Mathematical and Computer Modelling 17(7), 57–73 (1993)
Beldiceanu, N., Carlsson, M., Poder, E., Sadek, R., Truchet, C.: A generic geometrical constraint kernel in space and time for handling polymorphic k-dimensional objects. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 180–194. Springer, Heidelberg (2007)
Beldiceanu, N., Carlsson, M., Rampon, J.X.: Global constraint catalog. Technical Report T2005:08, SICS (May 2005)
Deransart, P.: Main results of the OADymPPaC project. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 456–457. Springer, Heidelberg (2004)
Deransart, P., Hermenegildo, M.V., Małuszyński, J.: DiSCiPl 1999. LNCS, vol. 1870. Springer, Heidelberg (2000)
Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., Berthier, F.: The constraint logic programming language CHIP. In: FGCS, pp. 693–702 (1988)
Dooms, G., Hentenryck, P.V., Michel, L.: Model-driven visualizations of constraint-based local search. Constraints 14(3), 294–324 (2009)
Epstein, S.L., Li, X.: Cluster graphs as abstractions for constraint satisfaction problems. In: Bulitko, V., Beck, J.C. (eds.) SARA. AAAI, Menlo Park (2009)
Hulubei, T.: Refutation Analysis for Constraint Satisfaction Problems. PhD thesis, University College Cork (2007)
Lesaint, D., Mehta, D., O’Sullivan, B., Quesada, L., Wilson, N.: A Soft Global Precedence Constraint. In: IJCAI 2009, Pasadena, CA, USA (2009)
Lesaint, D., Mehta, D., O’Sullivan, B., Quesada, L., Wilson, N.: Consistency techniques for finding an optimal relaxation of a feature subscription. In: Proceeding of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), pp. 283–290 (2008)
Meier, M.: Debugging constraint programs. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 204–221. Springer, Heidelberg (1995)
Nieuwenhuis, R.: A cumulative scheduling problem. Personal Communication (2008)
Schulte, C.: Oz Explorer: A visual constraint programming tool. In: ICLP, Leuven, Belgium, pp. 286–300 (1997)
Simonis, H.: An ECLiPSe ELearning course (2009), http://4c.ucc.ie/~hsimonis/ELearning/index.htm
Simonis, H., Aggoun, A.: Search-tree visualisation. In: Deransart et al [5], pp. 191–208.
Simonis, H., Aggoun, A., Beldiceanu, N., Bourreau, E.: Complex constraint abstraction: Global constraint visualisation. In: Deransart et al [5], 299–317
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simonis, H., Davern, P., Feldman, J., Mehta, D., Quesada, L., Carlsson, M. (2010). A Generic Visualization Platform for CP. In: Cohen, D. (eds) Principles and Practice of Constraint Programming – CP 2010. CP 2010. Lecture Notes in Computer Science, vol 6308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15396-9_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-15396-9_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15395-2
Online ISBN: 978-3-642-15396-9
eBook Packages: Computer ScienceComputer Science (R0)