An integrated modelling, debugging, and visualisation environment for G12

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6308 LNCS, Issue , 2010, Pages 522-536

  Bauer, Andreas ^a,b   Botea, Viorica ^a   Brown, Mark ^a   Gray, Matt ^a,b   Harabor, Daniel ^a,b   Slaney, John ^a,b  

^a CSIRO   (Australia)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; TREES (MATHEMATICS); VISUALIZATION;

CONSTRAINT MODEL; CONSTRAINT PROBLEMS; DOMAIN SPECIFIC; EVALUATING MODELS; INTEGRATED MODELLING; PLANNING PROBLEM; SEARCH PROCESS; TIGHT INTEGRATIONS;

PROGRAM DEBUGGING;

EID: 78149237035     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15396-9_42     Document Type: Conference Paper

References (15)

1. Choco Constraint Solving Toolkit., http://www.emn.fr/z-info/choco-solver/
2. ILOG OPL Studio, http://www.ilog.com/products/oplstudio/
3. Apt, K., Wallace, M.: Constraint logic programming using ECLiPSe. Cambridge University Press, Cambridge (2007)
4. Deransart, P., Hermenegildo, M.V., Maluszynski, J. (eds.): DiSCiPl 1999. LNCS, vol. 1870. Springer, Heidelberg (2000)
5. Flener, P., Pearson, J., Ågren, M.: Introducing ESRA, a relational language for modelling combinatorial problems. In: Bruynooghe, M. (ed.) LOPSTR 2004. LNCS, vol. 3018, pp. 214-232. Springer, Heidelberg (2004)
6. Gent, I.P., Miguel, I., Rendl, A.: Tailoring solver-independent constraint models: A case study with ESSENCE and MINION. In: Proc. 7th Symposium on Abstraction, Reformulation and Approximation (SARA), pp. 184-199 (2007)
7. Harel, D., Koren, Y.: A fast multi-scalemethod for drawing large graphs. J. Graph Algorithms Appl. 6(3), 179-202 (2002)
8. Ierusalimschy, R., de Figueiredo, L.H., Filho, W.C.: Lua - an extensible extension language. Softw. Pract. Exper. 26(6), 635-652 (1996)
9. Jones, C.V.: Visualization and Optimization. Kluwer, Boston (1996)
10. Kilby, P., Slaney, J.K., Thiébaux, S., Walsh, T.: Estimating search tree size. In: Proc. of the Twenty-First National Conference on Artificial Intelligence (AAAI). AAAI Press, Menlo Park (2006)
11. Lee, N.: A declarative debugging scheme. Journal of Functional and Logic Programming, 1997(3) (April 1997)
12. Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: Towards a standard CP modelling language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529-543. Springer, Heidelberg (2007)
13. Quigley, A.J., Eades, P.: Fade: Graph drawing, clustering, and visual abstraction. In: Graph Drawing, pp. 197-210 (2000)
14. Schulte, C.: Oz explorer: A visual constraint programming tool. In: Proc. of the 14th International Conference on Logic Programming (ICLP), pp. 286-300. MIT Press, Cambridge (1997)
15. Wallace, M., The G12 team: G12 - Towards the Separation of Problem Modelling and Problem Solving. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 8-10. Springer, Heidelberg (2009)