Skip to main content

Main Results of the OADymPPaC Project

  • Conference paper
Book cover Logic Programming (ICLP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3132))

Included in the following conference series:

Abstract

The 3 years OADymPPaC project ended may 2004.

The expected impacts of the project were of three kinds: new results in constraint program development and debugging, and visualization of dynamic phenomena; improvement of the industrial and academic platforms: constraint solvers and their tools for constraint program development and modules of visualization, enhancement of several platforms (GNU-Prolog, PaLM, Choco, CHIP); contribution to the teaching of the programming with constraints.

All results (reports and systems) may be found at the project URL:

http://contraintes.inria.fr/OADymPPaC

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Langevine, L.: Codeine, a Propagation Tracer for GNU-Prolog (2004), http://contraintes.inria.fr/~langevin/codeine

  2. Langevine, L., Deransart, P., Ducassé, M.: A propagation tracer for GNU-Prolog: from formal definition to efficient implementation. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 269–283. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Jussien, N., Barichard, V.: The PaLM system: explanation-based constraint programming. In: Proceedings of TRICS: Techniques foR Implementing Constraint programming Systems, a post-conference workshop of CP 2000, Singapore, pp. 118–133 (2000), Available at http://www.emn.fr/jussien/publications/jussien-WCP00.pdf

  4. COSYTEC: CHIP++ V5.6, alpha version (2004), http://www.cosytec.com

  5. Debruyne, R., Ferrand, G., Jussien, N., Lesaint, W., Ouis, S., Tessier, A.: Correctness of constraint retraction algorithms. In: FLAIRS 2003: Sixteenth International Florida Artificial Intelligence Research Society Conference, St. Augustine, Florida, USA, pp. 172–176. AAAI press, Menlo Park (2003)

    Google Scholar 

  6. Fages, F.: CLPGUI: a generic graphical user interface for constraint logic programming over finite domains. In: Tessier, A. (ed.) Proceedings of the 12th Workshop on Logic Programming Environments (WLPE 2002), Copenhagen (2002), Available as CoRR:cs.SE/0207048

    Google Scholar 

  7. Ducassé, M., Langevine, L.: Automated analysis of CLP(FD) program execution traces. In: Stuckey, P. (ed.) Proceedings of the International Conference on Logic Programming. LNCS, Springer, Heidelberg (2002) (Extended version), available at http://www.irisa.fr/lande/ducasse/

    Google Scholar 

  8. Baudel, T., et al.: ILOG Visual CP reference manual. Manufactured and freely distributed by ILOG (2003), http://www2.ilog.com/preview/Discovery/gentra4cp/

  9. Gonhiem, M., Jussien, N., Fekete, J.D.: Visualizing explanations to exhibit dynamic structure in constraint problem satisfaction. In: O’Sullivan, B. (ed.) Proceedings of the third International Workshop on User Interaction in Constraint Satisfaction (UICS 2003), Cork University, Ireland (2003), Available at http://www.cs.ucc.ie/~osullb/UICS-03/

  10. Arnaud, G.: PAVOT Reference Manual (2004), http://contraintes.inria.fr/~arnaud/pavot/

  11. Deransart, P., Ducassé, M., Langevine, L.: A generic trace model for finite domain solvers. In: O’Sullivan, B. (ed.) Proceedings of the second International Workshop on User Interaction in Constraint Satisfaction (UICS 2002), Cornell University, USA (2002), Available at http://www.cs.ucc.ie/~osullb/UICS-02/papers/deransart_et_al-uics02.ps

  12. Ferrand, G., Lesaint, W., Tessier, A.: Theoretical foundations of value withdrawal explanations for domain reduction. Electronic Notes in Theoretical Computer Science, vol. 76 (2002), http://www.elsevier.com/gej-ng/31/29/23/126/23/26/76008.pdf

  13. Langevine, L., Deransart, P., Ducassé, M.: A generic trace schema for the portability of CP(FD) debugging tools. In: Apt, K.R., Fages, F., Rossi, F., Szeredi, P., Váncza, J. (eds.) CSCLP 2003. LNCS (LNAI), vol. 3010, pp. 171–195. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Deransart, P.: al.: Generic Trace Format for Constraint Programming, version 2.1. Technical report, INRIA, EMN, University of Orléans, Cosytec, ILOG (2004), http://contraintes.inria.fr/OADymPPaC/Public/Trace

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deransart, P. (2004). Main Results of the OADymPPaC Project. In: Demoen, B., Lifschitz, V. (eds) Logic Programming. ICLP 2004. Lecture Notes in Computer Science, vol 3132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27775-0_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27775-0_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22671-0

  • Online ISBN: 978-3-540-27775-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics