Unsatisfiable core learning for Chuffed: Improving the performance of Chuffed, a Lazy-Clause-Generation solver, by using machine learning to predict unsatisfiable cores

Solving propositional satisfiability (SAT) and constraint programming (CP) instances has been a fundamental part of a wide range of modern applications. For this reason a lot of research went into improving the efficiency of modern SAT and CP solvers. Recently much of this research has gone into exploring the possibilities of integrating machine...

Applying Constraint Programming To Enterprise Modelling

Enterprise Modelling (EM) is the process of producing models, which in turn can be used to support understanding, analysis, (re)design, reasoning, control and learning about various aspects of an enterprise. Various EM techniques and languages exist, and are often supported by computational tools, in particular simulation. The goal of this...