JaCoP is a Java Constraint Programming solver. It provides a significant number of (global) constraints to facilitate efficient modeling. It also provides modular design of search to help user tailor search to specific characteristics of problem being addressed. It is currently more than 90.000 lines of code, not including examples and testing code. We have been working on JaCoP for past 10 years. It has been refactored, transformed, improved many times. JaCoP provides a large library of examples as well as extensive Java API documentation. There are more than 20.000 lines of code explaining how to model and solve diverse problems. We have cases of JaCoP usage by young people at high school age. CP technology is not easy to use so at least we tried to make using JaCoP as easy as we could. JaCoP is being used in research, teaching, and industry. We participated in Minizinc Challenge and our solver has been awarded a silver prize in a fixed category.

References in zbMATH (referenced in 21 articles )

Showing results 1 to 20 of 21.
Sorted by year (citations)

1 2 next

  1. Benouhiba, Toufik: A multi-level refinement approach for structural synthesis of optimal probabilistic models (2021)
  2. Michel, L.; Schaus, P.; Van Hentenryck, P.: MiniCP: a lightweight solver for constraint programming (2021)
  3. Maximiliano Cristiá, Andrea Fois, Gianfranco Rossi: Declarative Programming with Intensional Sets in Java Using JSetL (2020) arXiv
  4. Malik, Avinash; Walker, Cameron; O’Sullivan, Michael; Sinnen, Oliver: Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay (2018)
  5. Schiendorfer, Alexander; Knapp, Alexander; Anders, Gerrit; Reif, Wolfgang: MiniBrass: soft constraints for MiniZinc (2018)
  6. Hiermann, Gerhard; Prandtstetter, Matthias; Rendl, Andrea; Puchinger, Jakob; Raidl, Günther R.: Metaheuristics for solving a multimodal home-healthcare scheduling problem (2015)
  7. Schrijvers, Tom; Tack, Guido; Wuille, Pieter; Samulowitz, Horst; Stuckey, Peter J.: An introduction to search combinators (2013)
  8. Schrijvers, Tom; Tack, Guido; Wuille, Pieter; Samulowitz, Horst; Stuckey, Peter J.: Search combinators (2013)
  9. Soh, Takehide; Tamura, Naoyuki; Banbara, Mutsunori: Scarab: a rapid prototyping tool for SAT-based constraint programming systems (2013) ioport
  10. Bofill, Miquel; Palahí, Miquel; Suy, Josep; Villaret, Mateu: Solving constraint satisfaction problems with SAT modulo theories (2012)
  11. Bistarelli, Stefano; Pirolandi, Daniele; Santini, Francesco: Solving weighted argumentation frameworks with soft constraints (2011)
  12. Eames, Brandon K.; Neema, Sandeep K.; Saraswat, Rohit: DesertFD: a finite-domain constraint based tool for design space exploration (2010) ioport
  13. Lombardi, Michele; Milano, Michela: Allocation and scheduling of conditional task graphs (2010)
  14. Lombardi, Michele; Milano, Michela; Ruggiero, Martino; Benini, Luca: Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip (2010)
  15. Stuckey, Peter J.; Becket, Ralph; Fischer, Julien: Philosophy of the MiniZinc challenge (2010)
  16. Islam, Shariful; Suri, Neeraj; Balogh, András; Csertán, György; Pataricza, András: An optimization based design for integrated dependable real-time embedded systems (2009) ioport
  17. Boniol, Frédéric; Hladik, Pierre-Emmanuel; Pagetti, Claire; Aspro, Frédéric; Jégu, Victor: A framework for distributing real-time functions (2008)
  18. Szymanek, Radoslaw; Lecoutre, Christophe: Constraint-level advice for shaving (2008)
  19. Cherroun, Hadda; Darte, Alain; Feautrier, Paul: Reservation table scheduling: branch-and-bound based optimization(V S.) integer linear programming techniques (2007)
  20. Maestro, Juan Antonio; Mozos, Daniel; Dormido, Raquel; Reviriego, Pedro: New alternatives to the estimation problem in hardware-software codesign of complex embedded systems: The H.261 video co-dec case study (2005) ioport

1 2 next