Constraint solver

Hess, B.,Bekker,H., Berendsen, H.J.C.,andFraaije,J.G.E.M.(1997)LINCS A linear constraint solver for molecular simulations. / Comput. Chem. 18,1463-1472. 

Yices SRI International Constraint solver that can handle flux balance analysis (http // yices.csl.sri.com/)... 

Hess, B. P-LINCS a parallel linear constraint solver for molecular simulation. J. Chem. Theory Comput. 4, 116-122 (2008)... 

Constraint solvers are not part of the ISQ Prolog standard, but it is easy to add such a solver as a module. Most Prolog systems provide those solvers, the most important being clp(FD), where the FD stand for finite domain. Qnly the most basic aspects are covered here. 

Efficient implementations of constraint solvers are available, e.g, the clp(FD) solver implemented in Sictus Prolog. 

Carlsson, M., Ottoson, G., and Carlson, B. (1997). An open-ended finite domain constraint solver. In Proceedings Programming Languages Implementations, Logics, and Programs, Springer-Verlag, New York. 

Hess B et al (1997) LINCS a linear constraint solver for molecular simulations. J Comput Chem 18(12) 1463-1472... 

We used a constraint engine to solve the constraint system resulting from the design requirements. The constraint engine we used in the architecture is the Relational Constraint Solver (RCS) (Mauss et al. 2002), that supports different types of constraints ... 

Mauss, J., Seelisch, F., Tatar, M.M. A relational constraint solver for model-based engineering. In CP, pp. 696-701 (2002)... 

To overcome some of the limitations of SWTs, alternative technologies can be used. For example, SWT-based approaches might be combined with techniques more suitable to mathematical data processing, such as data mining, statistical analysis (Chap. 9), and Relational Constraint Solvers (Chap. 12). Additionally, engineers can use alternative solution approaches, which we hereby briefly compare to SWTs. 

So my proposal is that for the purpose of recording the epistemology of a safety case, models should be expressed as systems of constraints rather than as simulation models less is more. Until fairly recently, it would have been difficult to validate systems of constraints unlike simulation models, it was not feasible to run experimental calculations to check the predictions of the model against intuition and reality. Fortunately, we now have technology such as infinite bounded model checkers, based on highly effective constraint solvers for satisfiability modulo theories (SMT) that allow exploration of constraint-based models (see [18,19] for some simple examples). 

LINCS A Linear Constraint Solver for Molecular Simulations. 

---