Skip to content
Go to file

Latest commit


Git stats


Failed to load latest commit information.
Latest commit message
Commit time


Scala Monadic Constraint Solver

The goal of this project is to define a Constraint Satisfiaction Problem, CSP, solver framework which employs Monadic programming techniques.


The project is organized into the following subsystems:

  • API
  • Core


Here, the types defined are largely concerned with defining the contracts expected to be provided in a deployed environment. Why separate them from where they are fulfilled? This is done to help facilitate OSGi-based use as well as to provide a clear separation of concerns.

There are "concrete" classes found in the API bundle, though. These are implementation agnostic and, even though being classes and not traits, represent concepts expected not to vary across implementations. Of course, some may be found to contain implementation concerns/leanings/encodings. If that happens, then they should be refactored.

Two of the main design goals are to enable a rich embedded [DSL] ( when defining problems and to facilitate an open-ended set of solvers to be available. A small example of the EDSL looks like :

val problem = Problem (
	new Equation[Int] {
		def apply = 'x < 10 && 'x > 0
	new Equation[Int] {
		def apply = 'y === 'x ** 2
	// This could have been in the Equation above, but is shown
	// separately for illustrative purposes.
	new Equation[Int] {
		def apply = 'y < 10

Solving these constraints would yield values corresponding to :

('x -> 1, 'y -> 1), ('x -> 2, 'y -> 4), ('x -> 3, 'y -> 9)


The core subsystem is where the smocs implementation resides. These collaborations are most certainly implementation specific and should be expected to change across major releases, with the option to have binary incompatibility broken in a minor release (though this should happen less frequently).


Within Core exists a CSP implementation which is designed to be the simplest possible (yet conformant) CSP implementation. It is intended as more of a research/learning solver than one for production use.

Since many people, including the author at the outset of this effort, will not be intimately familiar with the nuances regarding optimal CSP implementation, the types in com.tubros.constraint.core.internal.simple are intentionally made to be approachable without regard to performance. Keeping performance concerns disjoint from a correct, albeit potentially slow, implementation hopefully makes this fascinating subject approachable to developers seeking to apply CSP's in their daily work.


The next level of sophistication regarding CSP solvers resides in the com.tubros.constraint.core.internal.tree package. Here, the TreeFiniteDomainSolver employs a SolutionTree to search the problem space for satisfactory answers. It uses a small set of heuristics to make informed decisions regarding variable ordering within the SolutionTree and also uses constraint propagation.



Further Reading

This section lists various resources considered relevant to CSP. It is by no means exhaustive and is provided so that the interested reader can have a starting point.

  1. Stuart Russell, Peter Norvig, "Chapter 6: Constraint Satisfaction Problems", in Artificial Intelligence A Modern Approach, (Prentice Hall, 2010).
  2. Francesca Rossi, Peter van Beek, Toby Walsh Handbook of Constraint Programming, (Elsevier Science, 2006).
  3. Tom Schrijvers, Peter Stuckey, Philip Wadler, Monaid Constraint Programming, accessed January 24, 2013,
  4. eed3si9n, learning Scalaz, accessed January 24, 2013,
  5. Dr. Jacob Feldman, JSR-331, accessed January 24, 2013,
  6. Tiark Rompf, Martin Odersky, Lightweight Modular Staging: A Pragmatic Approach to Runtime Code Generation and Compiled DSLs, accessed Feb 7, 2013,


Scala Monadic Constraint Solver




No releases published
You can’t perform that action at this time.